Module 2

Question 1

It is a process in which a function calls itself directly or
indirectly.

Answer 1

Recursion

Question 2

It is a process which breaks a task into smaller subtasks.

Answer 2

Recursion
(smaller subtask)

Question 3

It is a powerful technique that can be used in place of
iterations.

Answer 3

Recursion
(powerful technique)

Question 4

True or False. A base case should be defined to avoid infinite loops.

Answer 4

True

Question 5

The ________ is when a loop repeatedly executes until the controlling condition becomes false.

Answer 5

Iteration
(loop repeatedly executes)

Question 6

True or False. Recursion and Iteration both repeatedly execute the set of instructions.

Answer 6

True

Question 7

True or False. Recursion is applied to the set of instructions which we want to get repeatedly executed.

Answer 7

False
(ITERATION is applied to the set of instructions which we want to get repeatedly executed)

Question 8

True or False. Recursion is a process, always applied to a function.

Answer 8

True

Question 9

Iteration uses _______ structure.

Answer 9

Repetition

Question 10

True or False. An infinite loop occurs with iteration if the loop condition test never becomes true and Infinite looping uses CPU cycles repeatedly.

Answer 10

False
(An infinite loop occurs with iteration if the loop condition test never becomes FALSE)

Question 11

True or False. An iteration does not use the stack so it’s faster than recursion.

Answer 11

True

Question 11

True or False. An iteration terminates when the loop condition is satisfied.

Answer 11

False
( An iteration terminates when the loop condition FAILS)

Question 11

Recursion uses ______ structure.

Answer 11

Selection

Question 12

True or False. Iteration consumes less memory but makes the code longer.

Answer 12

True

Question 12

True or False. Recursion terminates when a base case is recognized.

Answer 12

True

Question 13

True or False. Infinite recursion occurs if the recursion step does not reduce the problem in a manner that converges on some condition (base case) and Infinite recursion can crash the system.

Answer 13

True

Question 14

True or False. Recursion is usually faster than iteration despite the overhead of maintaining the stack.

Answer 14

False
(Recursion is usually SLOWER than iteration DUE TO the overhead of maintaining the stack)

Question 15

True or False. Recursion uses less memory than iteration.

Answer 15

False
(Recursion uses MORE memory than iteration)

Question 16

True or False. Recursion makes the code smaller.

Answer 16

True

Question 17

What are the 4 types of recursion?

Answer 17

(DINT)
- Direct Recursion
- Indirect Recursion
- Tail Recursion
- Non-Tail Recursion

Question 18

This type of recursion calls the same function again.

Answer 18

Direct Recursion

Question 19

This type of recursion calls another function which then calls the same function again.

Answer 19

Indirect Recursion

Question 20

This type of recursion has a recursive call as the last thing done by the function.

Answer 20

Tail Recursion
(recursive call is the last thing done)

Question 21

This type of recursion’s recursive call is not the last thing done by the recursion.

Answer 21

Non-Tail Recursion
(recursive call is not the las thing done)

Question 22

True or False. The efficiency of an algorithm can only be in terms of time.

Answer 22

False
(can be in terms of TIME AND SPACE)

Question 23

There is a systematic approach that has to be applied for
analyzing any given algorithm. This systematic approach is modelled by a framework called as _____________.

Answer 23

Analysis Framework

Question 24

The _________ of an algorithm can be decided by
measuring the performance of an algorithm.

Answer 24

Efficiency

Question 25

Analysis of algorithm is the process of investigation
of an algorithm’s efficiency respect to two resources. What are these two resources?

Answer 25

• Running Time
• Memory Space

Question 26

The reason for selecting the two criteria of analysis of algorithm are?

Answer 26

(SGSM)
- Simplicity
- Generality
- Speed
- Memory

Question 27

_________________ indicates
how fast an algorithm runs.

Answer 27

Time efficiency or /time complexity

Question 28

_________________ is the amount of memory units required by the
algorithm including the memory needed for the i/p & o/p.

Answer 28

Space Efficiency or Space complexity

Question 28

In mathematics, computer science, and related fields, _______________ describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions.

Answer 28

Big O Notation
(describes the limiting behavior of a function)

Question 29

True or False. When time complexity is expressed using big O notation, the time complexity is said to be described asymptotically, i.e., as the input size goes to infinity.

Answer 29

True

Question 30

The _________ of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem.

Answer 30

Time Complexity
(amount of time taken)

Question 31

True or False. Analysis of algorithms and data structure is the major force that drives the design of solutions.

Answer 31

True

Question 32

What are the scientific methods in the framework for predicting performance and comparing algorithms?

Answer 32

(OHPVV)
- OBSERVE the natural world
- HYPOTHESIZE a model that is consistent with observations
- PREDICT events using hypothesis
- VERIFY the predictions by making further observations
- VALIDATE by repeating until the hypothesis and observations agree

Question 33

What are the principles in the framework for predicting performance and comparing algorithms?

Answer 33

• Experiments must be REPRODUCIBLE
• Hypothesis must be FALSIFIABLE

Question 34

It refers to the amount of memory required by an algorithm
(including the input values to the algorithm) to run.

Answer 34

Space complexity

Question 35

It is the extra space or the temporary space used by the algorithm during it’s execution.

Answer 35

Auxiliary Space

Question 36

While executing, what are the three reasons that algorithms use memory space?

Answer 36

(DIE)
- Data Space
- Instruction Space
- Environmental Stack

Question 37

It is the amount of memory used to save the compiled version of instructions.

Answer 37

Instruction Space

Question 38

It is the amount of space used by the variables and constants.

Answer 38

Data Space

Question 39

It is a count denoting number of
times of execution of a statement.

Answer 39

Frequency Count