Introduction To Data Structures - Practice Test

(A) O(1)

(B) O(n)

(C) Either O(1) or O(n)

(D) O(logn)

(A) O(1)

(A) Ordinary queue

(B) Single ended queue

(C) Circular queue

(D) Priority queue

(B) Single ended queue

(A) Keep one node as head and traverse another temp node till the end to check if its 'next points to head

(B) Have fast and slow pointers with the fast pointer advancing two nodes at a time and slow pointer advancing by one node at a time

(C) Cannot determine, you have to pre-define if the list contains cycles

(D) Circular linked list itself represents a cycle. So no new cycles cannot be generated

(B) Have fast and slow pointers with the fast pointer advancing two nodes at a time and slow pointer advancing by one node at a time

(A) ABCD

(B) DCBA

(C) DCAB

(D) ABDC

(B) DCBA

(A) Insertion Sort

(B) Quick Sort

(C) Heap Sort

(D) Merge Sort

(D) Merge Sort

Introduction To Data Structures - Study Mode