A full binary tree with 2n+1 nodes contain
a) n leaf nodes b) n non-leaf nodes c) (n-1) leaf nodes d) (n-1) non-leaf nodes
Data Structures
The worst case time complexity of AVL tree is better in comparison to binary search tree for
a) Search and Insert Operations b) Search and Delete Operations c) Insert and Delete Operations d) Search, Insert and Delete Operations
What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?
a) O(nlogn) b) O(logn) c) O(n) d) O(n2)
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 linked lists d) None of the mentioned
You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ and there are ‘m’ number of variables in this stack. The time complexity of performing dequeue operation is (Using only stack operations like push and pop)(Tightly bound)
a) O(m) b) O(n) c) O(m*n) d) Data is insufficient
What is the need for a circular queue?
a) effective usage of memory b) easier computations c) all of the mentioned d) none of the mentioned
What is the term for inserting into a full queue known as?
a) overflow b) underflow c) null pointer exception d) all of the mentioned
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