Minimum number of queues to implement stack is ___________
a) 3 b) 4 c) 1 d) 2
Which of the following statements are correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?
a) Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL b) SLL uses lesser memory per node than DLL c) DLL has more searching power than SLL d) All of the mentioned
What is the complexity of searching for a particular element in a Singly Linked List?
a) O(n) b) O(1) c) logn d) nlogn
Of the following data structures, which has a Last in First Out ordering? In other words, the one that came in last will be the first to be popped.
a) Queue b) Stack c) Vector d) Array List
Which of the following data structures can handle updates and queries in log(n) time on an array?
a) Linked list b) Stack c) Segment Tree d) Queue
If we have a tree of n nodes, how many edges will it have?
a) 1 b) (n*(n-1))/2 c) (n*(n-1)) d) n-1
What is the time complexity of pop () operation when the stack is implemented using an array?
a) O (1) b) O (n) c) O (logn) d) O (nlogn)
What does ‘stack underflow’ refer to?
a) Accessing item from an undefined stack b) Adding items to a full stack c) Removing items from an empty stack d) Index out of bounds exception
The process of accessing data stored in a serial access memory is similar to manipulating data on a ________
a) Heap b) Binary Tree c) Array d) Stack
The data structure required to check whether an expression contains balanced parenthesis is?
a) Stack b) Queue c) Array d) Tree
The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
a) S ingly linked list b) Doubly linked list c) Circular doubly linked list d) Array implementation of list
In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
a) Pointer to character b) Pointer to integer c) Pointer to node d) Node
Which of the following concepts make extensive use of arrays?
a) Binary trees b) Scheduling of processes c) Caching d) Spatial locality
Rotations in deletion have ______ cases for single rotations.
a) 3 b) 4 c) 2 d) 1
In AVL tree delete to delete will require you to go all the way back to the looking for imbalances.
a) Child b) First c) Root d) Parent