# Data Structure MCQ set-2

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. Assuming int is of 4 bytes, what is the size of int arr[15]; ?

2. What are the advantages of Arrays ?

3. Which of the following are the uses of matrices ?

4. Process of removing an element from Stack is called _____

5. Which data structure is used for implementing recursion ?

##### Data Structure MCQ

6. Which of the following is not an inherent application of stack ?

7. The data structure required for Breadth First Traversal on a graph is ?

8.In linked list each node contain minimum of two fields. One field is data field to store the data second field is ?

9. Which is memory efficient double linked list ?

10. Which of the following is false about a circular linked list ?

##### Data Structure MCQ

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

12. Can a tree stored in an array using either one of inorder or postorder or preorder traversal be again reformed ?

13. What is the space complexity of the postorder traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

14. What is the spaciality about the inorder traversal of a binary search tree ?

15. What is an internal sorting algorithm ?

##### Data Structure MCQ

16. What is the worst case complexity of Quick Sort ?

17. Which of the following statements for a simple graph is correct ?

18. A connected planner graph having 6 vertices, 7 edges contains _____ regions.

19. The depth first search traversal of a graph will result into ?

20. The number of elements in the adjaccncy natrix of a graph having 7 vertices ?