Top 50+ Solved Linear Data Structures -Stacks and Queues MCQ Questions Answer

a. Rear = MAX_SIZE – 1

b. Front = (rear + 1)mod MAX_SIZE

c. Front = rear + 1

d. Rear = front

a. Simulation of recursion

b. Simulation of arbitrary linked list

c. Simulation of limited resource allocation

d. Simulation of heap sort

a. Array

b. List

c. Heap

d. Tree

a. Huffman codes

b. Interrupt handling in operating system

c. Undo operation in text editors

d. Bayesian spam filter

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(n2)

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

a. Easy to implement

b. Processes with different priority can be efficiently handled

c. Applications with differing requirements

d. Easy to delete elements in any case

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(n2)

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-Steal job scheduling algorithm

b. Can be used as both stack and queue

c. To find the maximum of all sub arrays of size k

d. To avoid collision in hash tables

a. First In Last Out

b. First In First Out

c. Last In First Out

d. Last In Last Out

a. rear++

b. (rear+1) % CAPACITY

c. (rear % CAPACITY)+1

d. rear–

a. overflow

b. underflow

c. null pointer exception

d. program won’t be compiled

a. O(logn)

b. O(nlogn)

c. O(n)

d. O(1)

a. effective usage of memory

b. easier computations

c. to delete elements based on priority

d. implement LIFO principle in queues