Unit 2 :Introduction to Algorithm

Question 1

Pseudocode

Answer 1

Pseudocode is an artificial and informal language that helps programmers develop algorithms.

Question 2

Basic Elements of the algorithm?

Answer 2

The basic elements of an algorithm are sequence, selection, and iteration.

Question 3

Sequence?

Answer 3

the order in which behaviors and commands are combined in a project in order to produce the desired result.

Question 4

Selection?

Answer 4

is the use of conditional statements in a project. Conditional statements such as [If then], or [If then else] affect the project flow of a VEXcode VR project.

Question 5

Iteration?

Answer 5

algorithms often use repetition to execute steps a certain number of times, or until a certain condition is met. This is also known as “looping.” Iteration can change the project flow by repeating a behavior a specified number of times or until a condition is met.

Question 6

Input?

Answer 6

a function that allows us to ask a user to enter some data and returns a reference to the data in the form of a string.

Question 7

Output?

Answer 7

The output values are the solution to the problem

Question 8

process statements?

Answer 8

There are three basic constructs in an algorithm: Linear Sequence: is the progression of tasks or statements that follow one after the other. Conditional: IF-THEN-ELSE is a decision that is made between two courses of action. Loop: WHILE and FOR are sequences of statements that are repeated a number of times.

Question 9

Problems?

Answer 9

a problem is a task to be performed.
It is best thought of in terms of inputs and matching outputs. A problem definition should not include any constraints on how the problem is to be solved.

Question 10

INPUT STATEMENT PSUDOCODE?

Answer 10

The INPUT statement describes the arrangement of values in an input record.
EX. infile inclass; input name $ sex $ age height weight; These statements tell IML the following: There are five variables: NAME, SEX, AGE, HEIGHT and WEIGHT.

Question 11

Assignment statement?

Answer 11

Assigning a value to a variable is indicated in pseudocode using an arrow symbol (←). The arrow points from the value being assigned to the variable it is being assigned to.
Also, use = to assign

Question 12

Output Statement?

Answer 12

indicates that an output will appear on the screen

Question 13

IPO CHART/PROCESS TABLES?

Answer 13

The IPO (Input, Processing & Output) chart can be used to analyze a problem. This is a table with three columns, which represent three components: input, output, and processing. The storage component is not shown.

Question 14

INDENTATION PROCEDURES?

Answer 14

All statements showing “dependency” are to be indented. These include while, do, for, if, and switch.

Question 15

NAMING CONVENTIONS?

Answer 15

Variable names are capitalized, and function names are written in all capital letters.

Question 16

CAMEL CASING?

Answer 16

In the camel case, you start a name with a LOWERCASE letter. If the name has multiple words, the later words will start with a capital letter:
EX.iPod” and “GaGa.”
startTheProgram

Question 17

PASCAL CASE?

Answer 17

PascalCase is a naming convention in which the first letter of each word in a compound word is capitalized.
EX.FirstName
LastName

Question 18

Flowline symbol

Answer 18

ARROW

Question 19

Terminal Symbol:

Answer 19

OVAL

Question 20

On-page Connector Symbol

Answer 20

SMALL CIRCLE

Question 21

Input / Output Symbol:

Answer 21

PARALLELOGRAM

Question 22

Process SYMBOL

Answer 22

RECTANGLE

Question 23

Decision Symbol:

Answer 23

DIAMOND

Question 24

Off-page Connector Symbol

Answer 24

PART SQUARE AND TRIANGLE

Question 25

PREPARATION/DECLARATION

Answer 25

parallelogon LONG DIAMOND

Question 26

ARE YOU ABLE TO CONVERT FROM PSEUDOCODE TO FLOWCHART?

Answer 26

YES

Question 27

FLOWCHART TO PSEUDOCODE?

Answer 27

YES MISS SAID TO DO IT EXACTLY AS IT IS SHOWN ONLY USE WHAT IS SHOWN

Question 27

FLOWCHART TO PSEUDOCODE?

Answer 27

YES MISS SAID TO DO IT EXACTLY AS IT IS SHOWN ONLY USE WHAT IS SHOWN

Question 28

IF-THEN-ELSE

Answer 28

IF condition THEN sequence 1 ELSE sequence 2 ENDIF

Question 29

WHILE(loop)

Answer 29

WHILE condition sequence ENDWHILE

Question 30

CASE

Answer 30

A CASE construct indicates a multiway branch based on conditions that are mutually exclusive. Four keywords, CASE, OF, OTHERS, and ENDCASE, and conditions are used to indicate the various alternatives.

Question 31

CASE FORMAT

Answer 31

CASE expression OF condition 1 : sequence 1 condition 2 : sequence 2 ... condition n : sequence n OTHERS: default sequence ENDCASE

Question 32

CASE EXAMPLE

Answer 32

CASE grade OF A : points = 4 B : points = 3 C : points = 2 D : points = 1 F : points = 0 ENDCASE

Question 33

REPEAT-UNTIL

Answer 33

REPEAT-UNTIL This loop is similar to the WHILE loop except that the test is performed at the bottom of the loop instead of at the top. Two keywords, REPEAT, and UNTIL are used.

Question 34

REPEAT-UNTIL

Answer 34

REPEAT sequence UNTIL condition

Question 35

FOR

Answer 35

This loop is a specialized construct for iterating a specific number of times, often called a "counting" loop. Two keywords, FOR and ENDFOR are used.

Question 36

FOR FORMAT

Answer 36

FOR iteration bounds sequence ENDFOR

Question 37

FOR EXAMPLE

Answer 37

FOR each month of the year (good) FOR month = 1 to 12 (ok) FOR each employee in the list (good) FOR empno = 1 to listsize (ok)

Question 38

IS THE ALGORITHM EASY?

Answer 38

IF YOU PRACTICE

Question 39

) Write a psedocode algorithm to read a set of positive integers (terminated by 0) and print their average as well as the largest of the set.

Question 40

) Write a Pseudocode algorithm to read the names and ages of ten (10) people and print the name of the oldest person. Assume that there are no persons of the same age. Data is supplied in the following form: name, age, name age etc.

Question 41

Write a Pseudocode algorithm to print a conversion table from miles to kilometers. The table ranges from 5 to 100 miles in steps (1 mile = 1.61 kilometers).