Question 71 : The process of drawing a flowchart for an algorithm is called __________
1. Performance
2. Evaluation
3. Algorithmic Representation
4. Flowcharting
View Answer   Discuss with Members

Question 72 : In computer science, algorithm refers to a pictorial representation of a flowchart.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 73 : A data structure that follows the FIFO principle.
1. Queue
2. LL
3. Stack
4. Union
View Answer   Discuss with Members

Question 74 : Another name for 1-D arrays.
1. Linear arrays
2. Lists
3. Horizontal array
4. Vertical array
View Answer   Discuss with Members

Question 75 : A system wherein items are added from one and removed from the other end.
1. Stack
2. Queue
3. Linked List
4. Array
View Answer   Discuss with Members

Question 76 : Any algorithm is a program.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 77 : When an algorithm is written in the form of a programming language, it becomes a _________
1. Flowchart
2. Program
3. Pseudo code
4. Syntax
View Answer   Discuss with Members

Question 78 : Which of the following is incorrect?
Algorithms can be represented:
1. as pseudo codes
2. as syntax
3. as programs
4. as flowcharts
View Answer   Discuss with Members

Question 79 : The time that depends on the input: an already sorted sequence that is easier to sort.
1. Process
2. Evaluation
3. Running
4. Input
View Answer   Discuss with Members

Question 80 : This characteristic often draws the line between what is feasible and what is impossible.
1. Performance
2. System Evaluation
3. Modularity
4. Reliability
View Answer   Discuss with Members