Introduction To Data Structures - Study Mode
[#6] 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 the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)
Correct Answer
(B) 2
[#7] You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?
Correct Answer
(C) Delete the last element of the list
[#8] Which of the following points is/are not true about Linked List data structure when it is compared with an array?
Correct Answer
(D) Access of elements in linked list takes less time than compared to arrays
[#9] Entries in a stack are "ordered". What is the meaning of this statement?
Correct Answer
(D) There is a Sequential entry that is one by one
[#10] In linked list implementation of a queue, from where is the item deleted?
Correct Answer
(A) At the head of link list