C949 DATA STRUCTURES AND ALGORITHMS I 138
QUESTIONS & CORRECT ANSWERS LATEST 2025
typically measured by the algorithm's computational complexity - ANSWER-
Algorithm efficiency
the amount of resources used by the algorithm. The most common resources
considered are the runtime and memory usage. - ANSWER-Computational
complexity
a function, T(N), that represents the number of constant time operations
performed by the algorithm on an input of size N - ANSWER-runtime complexity
a function, S(N), that represents the number of fixed-size memory units used by
the algorithm for an input of size N. Ex: an algorithm that duplicates a list of
numbers is S(N) = N + k, where k is a constant representing memory used for
things like the loop counter and list pointers. - ANSWER-Space-complexity (of an
algorithm)
The space complexity not including the input data. Ex: An algorithm to find the
maximum number in a list will have a space complexity of S(N) = N + k, but an
______ of S(N) = k, where k is a constant. - ANSWER-auxiliary space complexity
A function f(N) that is ≤ the best case T(N), for all values of N ≥ 1 - ANSWER-Lower
bound
,A function f(N) that is ≥ the worst case T(N), for all values of N ≥ 1 - ANSWER-
Upper bound
the classification of runtime complexity that uses functions that indicate only the
growth rate of a bounding function - ANSWER-Asymptotic Notation
a growth rate for an algorithm's upper bound - ANSWER-O notation
a growth rate for an algorithm's lower bound - ANSWER-Ω notation
a growth rate that is both an upper and lower bound - ANSWER-Θ notation
A mathematical way of describing how a function (running time of an algorithm)
generally behaves in relation to the input size. - ANSWER-Big O notation
A selection sort has a _____ runtime complexity - ANSWER-O(N^2)
A linear search has a _____ runtime complexity - ANSWER-O(N)
O(5) has a _____ runtime complexity - ANSWER-Constant
O(N + N^2) has a _____ runtime complexity. - ANSWER-Quadratic
The ______ of an algorithm is the runtime complexity for an input that results in
the longest execution. - ANSWER-worst-case runtime
, An algorithm that breaks the problem into smaller subproblems and applies the
algorithm itself to solve the smaller subproblems - ANSWER-recursive algorithm
Because a problem cannot be endlessly divided into smaller subproblems, a
recursive algorithm must have a _________: where a recursive algorithm
completes without applying itself to a smaller subproblem. The ______ is what
ensures that a recursive algorithm eventually terminates - ANSWER-base case
A _____ is a function that calls itself. Commonly used to implement recursive
algorithms. - ANSWER-recursive function
A numerical sequence where each term is the sum of the previous 2 terms in the
sequence, except the first 2 terms, which are 0 and 1. - ANSWER-Fibonacci
sequence
An algorithm that searches a sorted list for a key by first comparing the key to the
middle element in the list and recursively searching half of the remaining list so
long as the key is not found. - ANSWER-Binary search
A function f(N) that is defined in terms of the same function operating on a value
< N. - ANSWER-recurrence relation
A visual diagram of a operations done by a recursive function, that separates
operations done directly by the function and operations done by recursive calls -
ANSWER-recursion tree
an operation that, for a given processor, always operates in the same amount of
time, regardless of input values - ANSWER-constant time operation
QUESTIONS & CORRECT ANSWERS LATEST 2025
typically measured by the algorithm's computational complexity - ANSWER-
Algorithm efficiency
the amount of resources used by the algorithm. The most common resources
considered are the runtime and memory usage. - ANSWER-Computational
complexity
a function, T(N), that represents the number of constant time operations
performed by the algorithm on an input of size N - ANSWER-runtime complexity
a function, S(N), that represents the number of fixed-size memory units used by
the algorithm for an input of size N. Ex: an algorithm that duplicates a list of
numbers is S(N) = N + k, where k is a constant representing memory used for
things like the loop counter and list pointers. - ANSWER-Space-complexity (of an
algorithm)
The space complexity not including the input data. Ex: An algorithm to find the
maximum number in a list will have a space complexity of S(N) = N + k, but an
______ of S(N) = k, where k is a constant. - ANSWER-auxiliary space complexity
A function f(N) that is ≤ the best case T(N), for all values of N ≥ 1 - ANSWER-Lower
bound
,A function f(N) that is ≥ the worst case T(N), for all values of N ≥ 1 - ANSWER-
Upper bound
the classification of runtime complexity that uses functions that indicate only the
growth rate of a bounding function - ANSWER-Asymptotic Notation
a growth rate for an algorithm's upper bound - ANSWER-O notation
a growth rate for an algorithm's lower bound - ANSWER-Ω notation
a growth rate that is both an upper and lower bound - ANSWER-Θ notation
A mathematical way of describing how a function (running time of an algorithm)
generally behaves in relation to the input size. - ANSWER-Big O notation
A selection sort has a _____ runtime complexity - ANSWER-O(N^2)
A linear search has a _____ runtime complexity - ANSWER-O(N)
O(5) has a _____ runtime complexity - ANSWER-Constant
O(N + N^2) has a _____ runtime complexity. - ANSWER-Quadratic
The ______ of an algorithm is the runtime complexity for an input that results in
the longest execution. - ANSWER-worst-case runtime
, An algorithm that breaks the problem into smaller subproblems and applies the
algorithm itself to solve the smaller subproblems - ANSWER-recursive algorithm
Because a problem cannot be endlessly divided into smaller subproblems, a
recursive algorithm must have a _________: where a recursive algorithm
completes without applying itself to a smaller subproblem. The ______ is what
ensures that a recursive algorithm eventually terminates - ANSWER-base case
A _____ is a function that calls itself. Commonly used to implement recursive
algorithms. - ANSWER-recursive function
A numerical sequence where each term is the sum of the previous 2 terms in the
sequence, except the first 2 terms, which are 0 and 1. - ANSWER-Fibonacci
sequence
An algorithm that searches a sorted list for a key by first comparing the key to the
middle element in the list and recursively searching half of the remaining list so
long as the key is not found. - ANSWER-Binary search
A function f(N) that is defined in terms of the same function operating on a value
< N. - ANSWER-recurrence relation
A visual diagram of a operations done by a recursive function, that separates
operations done directly by the function and operations done by recursive calls -
ANSWER-recursion tree
an operation that, for a given processor, always operates in the same amount of
time, regardless of input values - ANSWER-constant time operation
