Data Structure MCQ set-2

1. Assuming int is of 4 bytes, what is the size of int arr[15]; ?

(A) 15
(B) 19
(C) 11
(D) 60

2. What are the advantages of Arrays ?

(A) Easier to store elements of some datatype
(B) Used to implement other data structures like stack and queue
(C) Convenient way to represent matrices as a 2D array
(D) All of the mentioned

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

(A) In solving linear equations
(B) Image Processing
(C) Graph Theory
(D) All of the mentioned

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

(A) Create
(B) Push
(C) Evaluation
(D) Pop

5. Which data structure is used for implementing recursion ?

(A) Queue
(B) Stack
(C) Array
(D) List

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

(A) Reversing a string
(B) Evaluation of postfix expression
(C) Implementation of recursion
(D) Job scheduling

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

(A) Stack
(B) Array
(C) Queue
(D) Tree

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

(A) Pointer to character
(B) Pointer to Integer
(C) Point to node
(D) Node

9. Which is memory efficient double linked list ?

(A) Each node has only one pointer to traverse the list back and forth
(B) The list has break points for fast traversal
(C) An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list
(D) None of the mentioned

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

(A) Every node has successor
(B) Time complexity of inserting a new node of the head of the list is 0(1)
(C) Time complexity for deleting the last node is 0(n)
(D) None of the above

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

(A) 0(n)
(B) 0(1)
(C) log(n)
(D) n Log n

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

(A) Yes just traverse through the array and form the tree
(B) No we need one more traversal to form a tree
(C) No in case of sparse trees
(D) None of the mentioned

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)

(A) 0(1)
(B) 0(n log d)
(C) 0(log d)
(D) 0(d)

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

(A) It traverses in a non-increasing order
(B) It traverses in an increasing order
(C) It traverses in a random fashion
(D) None of the mentioned

15. What is an internal sorting algorithm ?

(A) Algorithm that uses tape or disk during the sort
(B) Algorithm that uses main memory during the sort
(C) Algorithm that involves swapping
(D) Algorithm that are considered in place

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

(A) 0(n log n)
(B) 0(log n)
(C) 0(n)
(D) 0(n2)

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

(A) Every path is a trail
(B) Every trail is a path
(C) Every trail is a path as well as a every path is a trail
(D) None of the above

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

(A) 15
(B) 3
(C) 1
(D) 11

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

(A) Linked List
(B) Tree
(C) Graph with back edges
(D) None of the above

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

(A) 7
(B) 14
(C) 36
(D) 49