Introduction To Data Structures - Practice Test

(A) Huffman codes

(B) Interrupt handling in operating system

(C) Undo operation in text editors

(D) Bayesian spam filter

(C) Undo operation in text editors

(A) A low priority process might have to wait indefinitely for the CPU

(B) If the system crashes, the low priority systems may be lost permanently

(C) Interrupt handling

(D) Indefinite blocking

(C) Interrupt handling

(A) A queue with insert/delete defined for both front and rear ends of the queue

(B) A queue implemented with a doubly linked list

(C) A queue implemented with both singly and doubly linked lists

(D) A queue with insert/delete defined for front side of the queue

(A) A queue with insert/delete defined for both front and rear ends of the queue

(A) Stack

(B) Linked List

(C) Queue

(D) Hash Table

(B) Linked List

(A) O(1)

(B) O(n)

(C) O(log n)

(D) O(n log n)

(A) O(1)

Introduction To Data Structures - Study Mode