DATA STRUCTURES AND ALGORITHMS
EXAM QUESTIONS WITH 100%
CORRECT ANSWERS L LATEST
VERSION 2025/2026.
The hiding of implementation details is referred to as abstraction. - ANS False
A type is a collection of values. - ANS True
What typically drives the data structure selection process? - ANS Resource constraints
Determine big Theta for the following code fragments in the average case. Assume that all
variables are of type int. - ANS theta(n), Theta(n^2)
What is the Big-Oh value for the following formula: - ANS O(n^6)
What is the running time in big-Oh notation for the following code:
sum = 0; for(i = 0; i < n; i++) for(j = 0; j < n; j++) for(k = 0;k < j; k++) sum++;
for (l = 0; l < n/2; l++) sum++; - ANS O(n^3)
Recursion is implemented using stacks. - ANS True
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
EXAM QUESTIONS WITH 100%
CORRECT ANSWERS L LATEST
VERSION 2025/2026.
The hiding of implementation details is referred to as abstraction. - ANS False
A type is a collection of values. - ANS True
What typically drives the data structure selection process? - ANS Resource constraints
Determine big Theta for the following code fragments in the average case. Assume that all
variables are of type int. - ANS theta(n), Theta(n^2)
What is the Big-Oh value for the following formula: - ANS O(n^6)
What is the running time in big-Oh notation for the following code:
sum = 0; for(i = 0; i < n; i++) for(j = 0; j < n; j++) for(k = 0;k < j; k++) sum++;
for (l = 0; l < n/2; l++) sum++; - ANS O(n^3)
Recursion is implemented using stacks. - ANS True
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
