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. The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
AB + CD* E – *F *G /
2. The postfix form of A*B+C/D is?
AB*CD/+
3. The prefix form of A-B/ (C * D ^ E) is?
-A/B*C^DE
4. The prefix form of an infix expression (p + q) – (r * t) is?
– +pq * rt
5. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
350
6. Convert the following infix expressions into its equivalent postfix expressions. (A + B ⋀D)/(E – F)+G
(A B D ⋀ + E F – / G +)
7. If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?
DCBA
8. The type of expression in which operator succeeds its operands is?
Postfix Expression
9. Which of the following is not an inherent application of stack?
Job scheduling
10. The postfix expression for the infix expression a + b x c – d ^ e ^ f is?
a b c x + d e f ^ ^ –
11. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
ABCD
12. A normal queue, if implemented using an array of size MAX_SIZE, gets full when?
Rear = MAX_SIZE – 1
13. What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
O(1)
14. What would be the asymptotic time complexity to find an element in the linked list?
O(n)
15. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
Both O(n) and θ(n)
16. The concatenation of two lists can be performed in O(1) time. Which of the following variation of the linked list can be used?
Circular doubly linked list
17. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
Merge sort
18. Linked list data structure offers considerable saving in _____________
Space Utilization and Computational Time
19. Linked lists are not suitable for the implementation of ___________
Binary search
20. 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?
Delete the last element of the list
21. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is?
n
22. What is the space complexity for deleting a linked list?
O(1)
23. B-tree of order n is a order-n multiway tree in which each non-root node contains __________
at least (n – 1)/2 keys
24. A B-tree of order 4 and of height 3 will have a maximum of _______ keys.
255
25. Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
11
No comments:
Post a Comment