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

Accepted Answer

C

Question 2

Declaring a variable involves selecting a name and a __
A)Size
B)Length
C)Style
D)Type

Accepted Answer

Declaring a variable involves selecting a name and a type, which defines the kind of data the variable can hold (e.g., integer, float, string).

Question 3

A group of variables is often called a __ .
A)Linked group
B)Data structure
C)Data object
D)Module

Accepted Answer

A group of variables is often referred to as a "Data structure," which is a storage format that enables efficient access and modification.

Question 4

When a variable is __ it is both declared and initialized.
A)Set
B)Instantiated
C)Defined
D)Documented

Accepted Answer

The answer of When a variable is __ it is...

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

Accepted Answer

The efficiency of an algorithm is typically measured by counting the number of key operations (such as comparisons in sorting algorithms) because this count is independent of machine-specific time measurements and provides a more general measure of performance.

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

Accepted Answer

The space factor in the context of algorithm efficiency refers to the amount of memory an algorithm needs to run. This is typically measured by considering the maximum memory required by the algorithm during its execution, as it determines the worst-case scenario in terms of space usage.

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

Accepted Answer

The "null case" is not a recognized term in complexity theory, whereas best, worst, and average cases are standard concepts used to describe algorithm performance.

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

Accepted Answer

The worst-case scenario in a linear search occurs when the item is either the last element in the array or not present in the array at all. In both situations, the algorithm has to check each element until the end.

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

Accepted Answer

The average case for a linear search occurs when the item is somewhere in the middle of the array, as this represents the average scenario between the best case (first element) and the worst case (last element or not present).

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

Accepted Answer

The finiteness property of an algorithm ensures that for any given input, the algorithm must complete its execution in a finite number of steps, leading to a termination. This means it doesn't run indefinitely for any input combination.

Question 11

Instructions in algorithms should be_____
A)Precise
B)Unambiguous
C)Precise & Unambiguous
D)None of above

Accepted Answer

Instructions in algorithms should be both precise and unambiguous to ensure that they can be understood and executed correctly without any confusion or multiple interpretations.

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.

Accepted Answer

Pseudo code is easier to modify than a flowchart because it is a textual representation of algorithms, making it simpler to edit and understand changes in program logic.

Question 13

Algorithm halts in __________
A)Finite time
B)Infinite time
C)Logarithmic time
D)Exponential time

Accepted Answer

An algorithm halts in finite time, which means it completes its execution and stops after a certain number of steps.

Question 14

The __ flow chart symbol(s) represents one way flow of control.
A)Processing
B)Decision
C)Terminal
D)All above

Accepted Answer

The Processing symbol represents a single action or step in a process, indicating a one-way flow of control.

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

Accepted Answer

An infinite loop is a loop that runs endlessly, either due to a programming error or by design, without a terminating condition that stops its execution.

Question 16

The normal flow of flowchart is from
A)Left to Right
B)Right to Left
C)A & D
D)Top to Bottom

Accepted Answer

The answer of The normal flow of flowchart is from
A)Left...

Question 17

Which tool shows textual design solution?
A)Flowchart
B)Structure chart
C)Pseudocode
D)Algorithm

Accepted Answer

Pseudocode is a method used to describe algorithms or the flow of a program in a format that is similar to code but in plain language, making it a textual design solution.

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

Accepted Answer

An algorithm is a list of well-defined instructions for completing a task that starts from an initial state and ends at a final state, making choice B the correct answer.

Question 19

Diamond shape in flow chart denotes
A)Start
B)Decision
C)End
D)Input - Output task

Accepted Answer

The diamond shape in a flowchart represents a decision point, indicating a branching in the process where a yes/no question is asked or a decision is made.

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

Accepted Answer

A rhombus (or diamond) shape is used to represent a conditional statement or decision in flowcharts.

Quiz 4: Efficiency, Complexity Theory, and Algorithms

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

Declaring a variable involves selecting a name and a __

A group of variables is often called a __ .

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

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

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

Which of the following case does not exist in complexity theory

The Worst case occur in linear search algorithm when

The Average case occur in linear search algorithm

Finiteness property of an Algorithm is

Instructions in algorithms should be_____

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

Algorithm halts in __________

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

What is an infinite loop?

The normal flow of flowchart is from

Which tool shows textual design solution?

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

Diamond shape in flow chart denotes

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