CNIT 315 - EXAM 2 newest actual with complete QUESTIONS
WITH answers/ verified/graded a+/VERIFIED SOLUTIONS | 100
% PASS
Iteration is faster than recursion
True
An array name and pointer can be used interchangeably
True
A pointer constructed as a variable or function parameter
contains a(n) _______
address
Adding and subtracting numbers from pointers results in
___________ addresses
different
Pointers can be initialized when declared
Page 1 of 18
,True
Addresses in pointers cannot be compared using any
relational operator
False
This declaration is correct:
calc(int *pt[3])
False. This refers to an array of three pointers, each one
pointing to a single integer.
A function cannot return a pointer
False
Recursion
Function that calls itself. Also referred to as self-referential
Direct recursion
When a function invokes itself
Page 2 of 18
, Mutual recursion
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
True
Recursion is used when the problem space gets smaller
overtime
True
An address of a variable can be passed into a function
True
A function cannot access the respective calling function's
variable if it receives an address
False
A recursive solution should always be used if the problem can
be expressed recursively
Page 3 of 18
WITH answers/ verified/graded a+/VERIFIED SOLUTIONS | 100
% PASS
Iteration is faster than recursion
True
An array name and pointer can be used interchangeably
True
A pointer constructed as a variable or function parameter
contains a(n) _______
address
Adding and subtracting numbers from pointers results in
___________ addresses
different
Pointers can be initialized when declared
Page 1 of 18
,True
Addresses in pointers cannot be compared using any
relational operator
False
This declaration is correct:
calc(int *pt[3])
False. This refers to an array of three pointers, each one
pointing to a single integer.
A function cannot return a pointer
False
Recursion
Function that calls itself. Also referred to as self-referential
Direct recursion
When a function invokes itself
Page 2 of 18
, Mutual recursion
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
True
Recursion is used when the problem space gets smaller
overtime
True
An address of a variable can be passed into a function
True
A function cannot access the respective calling function's
variable if it receives an address
False
A recursive solution should always be used if the problem can
be expressed recursively
Page 3 of 18
