Data Structure MCQ
Data Structure MCQ
Total Questions: 25
you'll have 30 second to answer each question.
Quiz Result
Total Questions:
Attempt:
Correct:
Wrong:
Percentage:
Quiz Answers
1. What is the time complexity of inserting at the end in dynamic arrays?
Either O(1) or O(n)
2. What is the time complexity to count the number of elements in the linked list?
O(n)
3. Which of the following is false about a doubly linked list?
Implementing a doubly linked list is easier than singly linked list
4. What is a memory efficient double linked list?
Each node has only one pointer to traverse the list back and forth
5. What is the time complexity of searching for an element in a circular linked list?
O(n)
6. Which of the following application makes use of a circular linked list?
Allocating CPU to resources
7. Which of the following is false about a circular linked list?
Time complexity of inserting a new node at the head of the list is O(1)
8. What is the time complexity of pop() operation when the stack is implemented using an array?
O(1)
9. Which of the following array position will be occupied by a new element being pushed for a stack of size N elements(capacity of stack > N)?
S[N]
10. Which of the following array element will return the top-of-the-stack-element for a stack of size N elements(capacity of stack > N)?
S[N-1]
11. What will be the output after performing these sequence of operations push(20); push(4); top(); pop(); pop(); push(5); top();
5
12. Minimum number of queues to implement stack is ___________
1
13. In a circular queue, how do you increment the rear end of the queue?
(rear+1) % CAPACITY
14. What is the time complexity of enqueue operation?
O(1)
15. In linked list implementation of a queue, where does a new element be inserted?
At the tail of the link list
16. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?
Only rear pointer
17. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?
Both front and rear pointer
18. How many stacks are required for applying evaluation of infix expression algorithm?
two
19. What is the other name for a postfix expression?
Reverse polish Notation
20. What would be the Prefix notation and Postfix notation for the given equation? A+B+C
++ABC and AB+C+
21. Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is _________
A, B, C, E, D
22. A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves?
3
23. What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?
26
24. Which one of the following data structures are preferred in database-system implementation?
B+ -tree
25. Which of the following is false about a binary search tree?
In order sequence gives decreasing order of elements
No comments:
Post a Comment