Data Structure MCQ
Data Structure MCQ
Total Questions: 25
you'll have 25 second to answer each question.
Quiz Result
Total Questions:
Attempt:
Correct:
Wrong:
Percentage:
Quiz Answers
1. What are the disadvantages of arrays?
There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size
2. Which of the following is not the application of stack?
Data Transfer between two asynchronous process
3. What is the value of the postfix expression 6 3 2 4 + – *?
-18
4. Which of the following statement(s) about stack data structure is/are NOT correct?
Stack is the FIFO data structure
5. The data structure required for Breadth First Traversal on a graph is?
Queue
6. The prefix form of A-B/ (C * D ^ E) is?
-A/B*C^DE
7. Which of the following points is/are not true about Linked List data structure when it is compared with an array?
Access of elements in linked list takes less time than compared to arrays
8. Which of the following application makes use of a circular linked list?
Allocating CPU to resources
9. What is a bit array?
Data structure that compactly stores bits
10. Which of the following tree data structures is not a balanced binary tree?
B-tree
11. Which of the following is not the type of queue?
Single ended queue
12. Which algorithm is used in the top tree data structure?
Divide and Conquer
13. What is the need for a circular queue?
effective usage of memory
14. Which of the following is the most widely used external memory data structure?
B-tree
15. Which of the following is also known as Rope data structure?
Cord
16. What will be the output of the following program? main() { char str[]="data structure"; int len = strlen(str); int i; for(i=0;i
erutcurts atad
17. What is an AVL tree?
a tree which is balanced and is a height balanced tree
18. What is the use of the bin data structure?
to have efficient region query
19. What is the advantage of a hash table as a data structure?
faster access of data
20. In simple chaining, what data structure is appropriate?
Doubly linked list
21. Which type of data structure is a ternary heap?
Priority Queue
22. What is a dequeue?
A queue with insert/delete defined for both front and rear ends of the queue
23. A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?
Dequeue
24. Which of the following is the simplest data structure that supports range searching?
K-d trees
25. In a stack, if a user tries to remove an element from an empty stack it is called _________
Underflow
No comments:
Post a Comment