2027) Questions & Answers {Grade A}
100% Correct
Recursion - correct answer Function that calls itself. Also referred to as self-
referential
Direct recursion - correct answer When a function invokes itself
Mutual recursion - correct answer A function that invokes a secondary function, which
in tern invokes the first function. Also referred to as indirect.
Any recursive function can be written in a non-recursive manner using an iterative
solution - correct answer True
,Recursion is used when the problem space gets smaller overtime - correct answer
True
An address of a variable can be passed into a function - correct answer True
A function cannot access the respective calling function's variable if it receives an
address - correct answer False
A recursive solution should always be used if the problem can be expressed
recursively - correct answer False
Iteration is faster than recursion - correct answer True
An array name and pointer can be used interchangeably - correct answer True
, A pointer constructed as a variable or function parameter contains a(n) _______ -
correct answer address
Adding and subtracting numbers from pointers results in ___________ addresses -
correct answer different
Pointers can be initialized when declared - correct answer True
Addresses in pointers cannot be compared using any relational operator - correct
answer False
This declaration is correct:
calc(int *pt[3]) - correct answer False. This refers to an array of three pointers, each
one pointing to a single integer.