Basic algorithms flowcharts for sequential processing

Qus. 1 : An algorithm that calls itself directly or indirectly is called as

1. Sub Function
2. Recursion
3. Reverse Polish Notation
4. Traversal Algorithm

Qus. 2 : <p>What will be the output of the following pseudo code ?</p><pre>Integer a<br>Set a =4<br>do<br><span style="white-space:pre"> </span>print a + 2<br>&nbsp; &nbsp; &nbsp; a = a-1<br>while (a not equals 0)<br>end while</pre>

1. 6 6 6 6
2. 6 5 4 3
3. 6 7 8 9
4. 6 8 10 12

Qus. 3 : What are the three different types of algorithm constructions ?

1. Input/Output, Decision, Repeat
2. Input, Output, Process
3. Loop, Input/Output, Process
4. Sequence, Selection, Repeat

Qus. 4 : Algorithms cannot be represented by

1. pseudo codes
2. syntax
3. flowcharts
4. programs

Qus. 5 : The process of drawing a flowchart for an algorithms is called

1. Performance
2. Algorithmic Representation
3. Evaluation
4. Flowcharting

Qus. 6 : The way for solving a problem step by step is know as

1. Design
2. Palnning
3. Algorithm
4. Execution

Qus. 7 : A detailed flowchart is know as

1. Micro
2. Union
3. Macro
4. Stack

Programs