INSY 3300- (Python) Final exam 2025
Questions and Answers
Each time a function is called in a recursive solution, the system incured overhead
that is not incurred with a loop - --Answer --True
When in a recursive solution, function A calls function B, which in turn, called
function A, this is known as an indirect recursion. - --Answer --True
Recursive algorithms are always more concise and efficient than iterative
algorithms. - --Answer --False
All the cases of a recursive solution other than the base case are called the
___________ case. - --Answer --Recursive
The base case does not require ___________, so it stops the chain of recursive
calls. - --Answer --Recursion
Recursive function calls are ______ efficient than loops. - --Answer --Less
Some problems are more _______ solved with recursion than with a loop. - --
Answer --Easily
....COPYRIGHT ©️ 2025 ALL RIGHTS RESERVED...TRUSTED & VERIFIED 1
, Each time a function is called, the system incurs _________ that is not necessary
with a loop. - --Answer --Overhead
A solution using a(n) _______ is usually more evident than a recursive solution. - -
-Answer --Loop
A function is called from the min function and then it calls itself five times. The
depth of the recursion is _________. - --Answer --Five
The majority of repetitive programming tasks are best done with - --
Answer --Loops
A recursion in which a function directly calls itself is known as ______ recursion. -
--Answer --Direct
Usually a problem solved by recursion is reduced by making the value of one or
more parameters _________ with each recursive call. - --Answer --Smaller
Python does not have GUI programming features built into the language itself. - --
Answer --True
A root widget's destroy method can be used as a callback function for a QUIT
button. - --Answer --True
Radio buttons can be used to allow the user to make multiple selections at one
time. - --Answer --False
....COPYRIGHT ©️ 2025 ALL RIGHTS RESERVED...TRUSTED & VERIFIED 2
Questions and Answers
Each time a function is called in a recursive solution, the system incured overhead
that is not incurred with a loop - --Answer --True
When in a recursive solution, function A calls function B, which in turn, called
function A, this is known as an indirect recursion. - --Answer --True
Recursive algorithms are always more concise and efficient than iterative
algorithms. - --Answer --False
All the cases of a recursive solution other than the base case are called the
___________ case. - --Answer --Recursive
The base case does not require ___________, so it stops the chain of recursive
calls. - --Answer --Recursion
Recursive function calls are ______ efficient than loops. - --Answer --Less
Some problems are more _______ solved with recursion than with a loop. - --
Answer --Easily
....COPYRIGHT ©️ 2025 ALL RIGHTS RESERVED...TRUSTED & VERIFIED 1
, Each time a function is called, the system incurs _________ that is not necessary
with a loop. - --Answer --Overhead
A solution using a(n) _______ is usually more evident than a recursive solution. - -
-Answer --Loop
A function is called from the min function and then it calls itself five times. The
depth of the recursion is _________. - --Answer --Five
The majority of repetitive programming tasks are best done with - --
Answer --Loops
A recursion in which a function directly calls itself is known as ______ recursion. -
--Answer --Direct
Usually a problem solved by recursion is reduced by making the value of one or
more parameters _________ with each recursive call. - --Answer --Smaller
Python does not have GUI programming features built into the language itself. - --
Answer --True
A root widget's destroy method can be used as a callback function for a QUIT
button. - --Answer --True
Radio buttons can be used to allow the user to make multiple selections at one
time. - --Answer --False
....COPYRIGHT ©️ 2025 ALL RIGHTS RESERVED...TRUSTED & VERIFIED 2
