This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Stack using Queues”. 1. To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need? a) 1 b) 2 c) 3 d) 4 2. Making the push operation costly, select the code snippet which implements the … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Queue using Stacks”. 1. A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Double Ended Queue (Dequeue)”. 1. What is a dequeue? 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 … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Priority Queue”. 1. With what data structure can a priority queue be implemented? a) Array b) List c) Heap d) Tree 2. Which of the following is not an application of priority queue? a) Huffman codes b) Interrupt handling in operating system … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Queue using Linked List”. 1. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time? a) Insertion b) Deletion c) To empty a queue d) Both Insertion and To empty … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Queue using Array”. 1. Which of the following properties is associated with a queue? a) First In Last Out b) First In First Out and Last in Last Out c) Last In First Out d) Last In Last Out Only 2. In … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Stack using Linked List”. 1. What is the best case time complexity of deleting a node in a Singly Linked list? a) O (n) b) O (n2) c) O (nlogn) d) O (1) 2. Which of the following statements are not correct … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Stack using Array”. 1. Which of the following real world scenarios would you associate with a stack data structure? a) piling up of chairs one above the other b) people standing in a line to be serviced at a counter c) offer … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Circular Linked List”. 1. What differentiates a circular linked list from a normal linked list? a) You cannot have the ‘next’ pointer point to null in a circular linked list b) It is faster to traverse the circular linked list c) In … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Doubly Linked List”. 1. Which of the following is false about a doubly linked list? a) We can navigate in both the directions b) It requires more space than a singly linked list c) The insertion and deletion of a node take … Read more
