Basic algorithms flowcharts for sequential processing

Qus. 1 : Two main measures for the efficiency of an algorithm are

1. Processor and memory
2. Complexity and capacity
3. Time and space
4. Data and space

Qus. 2 : What is an algorithm

1. A flowchart
2. Step by step instructions used to solve a problem
3. A flowchart or pseudo code
4. A decision

Qus. 3 : <p>What will be the output of the following pseudo code?</p><pre>integer a,b<br>set a=9,b=5<br>a=a mod(a-3)<br>b=b mod(b-3)<br>print a+b</pre>

1. 4
2. 5
3. 9
4. 8

Qus. 4 : Which of the following symbol is used for input and output operations in a flow chart?

1. Rectangle
2. Parallelogram
3. Circle
4. Diamond

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

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

Qus. 6 : 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. 7 : Algorithms cannot be represented by

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

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

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

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

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

Qus. 10 : A detailed flowchart is know as

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

Qus. 11 : Kite/diamond symbol in flow chart is used for_______

1. Execution
2. Decision
3. Statement
4. All of the above

Qus. 12 : Pictorial representation of an algorithm is called as

1. Statement
2. Program
3. Flow chart
4. All the above

Qus. 13 : The connector symbol for flow chart is

1. Circle
2. Parallelogram
3. Diamond
4. All the above

Qus. 14 : Which property of an algorithm ensures that it terminates after a finite number of steps?

1. Finiteness
2. Effectiveness
3. Definiteness
4. Generality

Qus. 15 : A well-designed algorithm must satisfy:

1. Correctness and finiteness only
2. Finiteness and efficiency only
3. Correctness, finiteness, and clarity
4. Correctness and hardware dependency

Qus. 16 : Consider two algorithms A and B solving the same problem. Algorithm A always terminates but sometimes produces incorrect output, while algorithm B produces correct output but may not terminate for some inputs. Which statement is TRUE?

1. A is preferable because it terminates
2. B is preferable because correctness is fundamental
3. Both satisfy algorithm correctness
4. Both violate essential properties of algorithms

Programs