Question 1

The Worst case occur in linear search algorithm when

Accepted Answer

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 D

Question 2

Declaring a variable involves selecting a name and a __

Accepted Answer

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

Question 3

The Average case occur in linear search algorithm

Accepted Answer

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 A

Question 4

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

Accepted Answer

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 5

Which of the following case does not exist in complexity theory

Accepted Answer

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

Question 6

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

Accepted Answer

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

Question 7

Which tool shows textual design solution?

Accepted Answer

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

Question 8

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

Accepted Answer

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

Question 9

The normal flow of flowchart is from

Accepted Answer

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

Question 10

Any program can be written using structures.

Accepted Answer

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

Question 11

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

Accepted Answer

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

Question 12

Algorithm halts in __________

Accepted Answer

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

Question 13

What is an infinite loop?

Accepted Answer

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

Question 14

A group of variables is often called a __ .

Accepted Answer

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

Question 15

Finiteness property of an Algorithm is

Accepted Answer

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 16

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

Accepted Answer

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

Question 17

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

Accepted Answer

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

Question 18

Instructions in algorithms should be_____

Accepted Answer

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

Question 19

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

Accepted Answer

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

Question 20

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

Accepted Answer

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

Exam 4: Efficiency, Complexity Theory, and Algorithms