Question 1

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 loopE) B) and D)
F) B) and C)

Question 2

A group of variables is often called a __ .

Accepted Answer

A)  Linked group
B)  Data structure
C)  Data object
D)  ModuleE) All of the above
F) A) and B)

Question 3

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)  RectangleE) All of the above
F) C) and D)

Question 4

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 allE) A) and B)
F) A) and C) A

Question 5

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 aboveE) A) and B)
F) C) and D)

Question 6

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 declarationE) A) and B)
F) B) and C)

Question 7

Algorithm halts in __________

Accepted Answer

A)  Finite time
B)  Infinite time
C)  Logarithmic time
D)  Exponential timeE) None of the above
F) A) and B)

Question 8

Which tool shows textual design solution?

Accepted Answer

A)  Flowchart
B)  Structure chart
C)  Pseudocode
D)  AlgorithmE) None of the above
F) A) and C)

Question 9

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 allE) A) and D)
F) None of the above D

Question 10

Which of the following case does not exist in complexity theory

Accepted Answer

A)  Best case
B)  Worst case
C)  Average case
D)  Null caseE) A) and B)
F) All of the above

Question 11

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

Accepted Answer

A)  Set
B)  Instantiated
C)  Defined
D)  DocumentedE) B) and C)
F) A) and D)

Question 12

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

Accepted Answer

A)  Processing
B)  Decision
C)  Terminal
D)  All aboveE) A) and D)
F) A) and C)

Question 13

Instructions in algorithms should be_____

Accepted Answer

A)  Precise
B)  Unambiguous
C)  Precise & Unambiguous
D)  None of aboveE) A) and C)
F) B) and D)

Question 14

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 algorithmE) C) and D)
F) None of the above

Question 15

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)  FlowchartE) None of the above
F) All of the above

Question 16

The normal flow of flowchart is from

Accepted Answer

A)  Left to Right
B)  Right to Left
C)  A & D
D)  Top to BottomE) C) and D)
F) B) and D)

Question 17

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.E) A) and C)
F) None of the above

Question 18

Declaring a variable involves selecting a name and a __

Accepted Answer

A)  Size
B)  Length
C)  Style
D)  TypeE) B) and D)
F) C) and D) D

Question 19

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 algorithmE) None of the above
F) B) and C)

Question 20

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 aboveE) All of the above
F) None of the above

Exam 4: Efficiency, Complexity Theory, and Algorithms

What is an infinite loop?

Correct AnswerverifiedShow Answer

A group of variables is often called a __ .

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The Average case occur in linear search algorithm

Correct AnswerverifiedA

Any program can be written using structures.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Algorithm halts in __________

Correct AnswerverifiedShow Answer

Which tool shows textual design solution?

Correct AnswerverifiedShow Answer

The Worst case occur in linear search algorithm when

Correct AnswerverifiedD

Which of the following case does not exist in complexity theory

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Instructions in algorithms should be_____

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The normal flow of flowchart is from

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Declaring a variable involves selecting a name and a __

Correct AnswerverifiedD

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

Correct AnswerverifiedShow Answer

Finiteness property of an Algorithm is

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
A

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
D

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
D

Correct Answer
verified

Correct Answer
verified