DATA STRUCTURES AND ALGORITHMS EXAM QUESTIONS WITH 100% CORRECT ANSWERS L LATEST VERSION 2025/2026.

DATA STRUCTURES AND ALGORITHMS
EXAM QUESTIONS WITH 100%
CORRECT ANSWERS L LATEST
VERSION 2025/2026.




A linked-list implementation of a stack guarantees constant time performance but requires
more space than an array implementation. - ANS TRUE
Both implementations of pop and push guarantee constant time performance. Linked lists
require additional memory (space) for storing a reference to the next node.


An algorithm that uses 12n2 + 4n log n operations is a ∼n2 algorithm. - ANS FALSE
It is a ∼ 12n2 algorithm.


Big-Oh notation is more precise than tilde notation at describing the growth of a function. -
ANS FALSE
Big-Oh notation only provides an upper bound on the growth rate of a function. Tilde
approximation approaches the original function as N grows.


When implementing the Comparable interface, you should make sure that your implementation
of the compareTo() method specifies a total order over the objects. - ANS TRUE
When implementing the Comparable interface, you should make sure that your implementation
of the compareTo() method specifies a total order over the objects.


Mergesort - ANS Stable and fast

1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.