Deck 4: Efficiency, Complexity Theory, and Algorithms

Question 1

The------- can be a useful tool when a program must be modified months or years after the original writing.

A)Flowchart
B)Hierarchy chart
C)Pseudo code
D)Variable declaration

Answer 1

Pseudo code

Question 2

Declaring a variable involves selecting a name and a __

A)Size
B)Length
C)Style
D)Type

Answer 2

Type

Question 3

A group of variables is often called a __ .

A)Linked group
B)Data structure
C)Data object
D)Module

Answer 3

Data structure

Question 4

When a variable is __ it is both declared and initialized.

A)Set
B)Instantiated
C)Defined
D)Documented

Question 5

The time factor when determining the efficiency of algorithm is measured by

A)counting microseconds
B)Counting the number of key operations
C)Counting the number of statements
D)Counting the kilobytes of algorithm

Question 6

The space factor when determining the efficiency of algorithm is measured by

A)Counting The Maximum Memory Needed By The Algorithm
B)Counting The Minimum Memory Needed By The Algorithm
C)Counting The Average Memory Needed By The (A)lgorithm
D)Counting the maximum disk space needed by the algorithm

Question 7

Which of the following case does not exist in complexity theory

A)Best case
B)Worst case
C)Average case
D)Null case

Question 8

The Worst case occur in linear search algorithm when

A)Item is somewhere in the middle of the array
B)Item is not in the array at all
C)Item is the last element in the array
D)Item is the last element in the array or is not there at all

Question 9

The Average case occur in linear search algorithm

A)When Item is somewhere in the middle of the array
B)When Item is not in the array at all
C)When Item is the last element in the array
D)When Item is the last element in the array or is not there at all

Question 10

Finiteness property of an Algorithm is

A)The number of steps in the algorithm should be finite.
B)The algorithm should terminate after a finite no. of times.
C)For all possible combinations of input data, the algorithm terminates after a finite no. of steps.
D)None of above

Question 11

Instructions in algorithms should be_____

A)Precise
B)Unambiguous
C)Precise & Unambiguous
D)None of above

Question 12

As compared to a flowchart, it is easier to modify the_________of a program logic when program modifications are necessary.

A)Macro flowchart
B)Micro flowchart
C)Terminal
D)Pseudo code.

Question 13

Algorithm halts in __________

A)Finite time
B)Infinite time
C)Logarithmic time
D)Exponential time

Question 14

The __ flow chart symbol(s) represents one way flow of control.

A)Processing
B)Decision
C)Terminal
D)All above

Question 15

What is an infinite loop?

A)It is an endless loop
B)It means multiple loops
C)It is a nested loop
D)It is an unclosed loop

Question 16

The normal flow of flowchart is from

A)Left to Right
B)Right to Left
C)A & D
D)Top to Bottom

Question 17

Which tool shows textual design solution?

A)Flowchart
B)Structure chart
C)Pseudocode
D)Algorithm

Question 18

Method which uses a list of well-defined instructions to complete a task, starting from a given initial state to end state, is called

A)Program
B)Algorithm
C)High level Language
D)Flowchart

Question 19

Diamond shape in flow chart denotes

A)Start
B)Decision
C)End
D)Input - Output task

Question 20

Which of the following shape is used for representing a Conditional Statement in a Flow chart?

A)Parallelogram
B)Rhombus
C)Trapezoid
D)Rectangle

Question 21

Any program can be written using structures.

A)Sequence logic, Merge logic, Insertion logic
B)Sequence logic, Selection logic, Iteration logic
C)Sequence logic, Branch logic, Iteration logic
D)None of the above