Introduction To Data Structures - Study Mode
[#21] Why is implementation of stack operations on queues not feasible for a large dataset (Asssume the number of elements in the stack to be n)?
Correct Answer
(A) Because of its time complexity O(n)
[#22] Which of the following statements are not correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?
Correct Answer
(D) Number of node fields in SLL is more than DLL
[#23] In a circular queue, how do you increment the rear end of the queue?
Correct Answer
(B) (rear+1) % CAPACITY
[#24] The process of accessing data stored in a serial access memory is similar to manipulating data on a . . . . . . . .
Correct Answer
(D) Stack
[#25] Linked list is considered as an example of . . . . . . . . type of memory allocation.
Correct Answer
(A) Dynamic