# Data Structure MCQ SET-3

Data Structure MCQ Questions with Answer In this set we cover all the topic of Data structure like Array, Linked List, Stack, Queue, Tree ,Graph , Time complexity and Space complex complexity of different data structure, Sorting, Searching, Heap etc.

1. Now do you initialize an array in C ?

2. which of the following concepts make extensive use of arrays ?

3. What is the order of a matrix ?

4. Process of inserting an element in stack is called ______

5. The data structure required to check whether an expression contains balanced parenthesis is ?

##### Data Structure MCQ

6. Which data structure is needed to convert infix notation to postfix notation ?

7. A linear collection of data elements where the linear node is given by means of pointer is called ?

8. A linear list of elements in which deletion can be done from one end(front) and insertion can take place only at the other end(rear) is known as a

9. Which of the following is false about a doubly linked list ?

10. What differentiates a circular linked list from normal liked list ?

##### Data Structure MCQ

11. What is the complexity of searching for a particular element in a singly linked list ?

12. Binary trees can have how many children ?

13. What is the time complexity of pre-order traversal in the iterative fashion ?

14. Which of the following is false about a binary search tree ?

15. What is an external sorting algorithm ?

##### Data Structure MCQ

16. Quick sort can be categorized into which of the following ?

17. What is the number of edges present in a complete graph having n vertices ?

18. A connected planer graph having 6 vertices 7 edge contains ______ regions.

19. Depth first search is equivalent to which of the traversal in the Binary Tree ?

20. What would be the number of zero’s in the adjacency matrix of the given graph ?