Data Structure MCQ SET-3

1. Now do you initialize an array in C ?

(A) int arr[3]=(1,2,3);
(B) int arr(3)={1,2,3};
(C) int arr[3]={1,2,3};
(D) int arr(3)=(1,2,3);

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

(A) Binary tree
(B) Scheduling of processes
(C) Catching
(D) Spatial locality

3. What is the order of a matrix ?

(A) Number of rows X number of columns
(B) Number of columns X number of rows
(C) Number or rows X number of rows
(D) Number of columns X number of columns

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

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

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

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

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

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

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

(A) Linked list
(B) Node list
(C) Primitive list
(D) None of the mentioned

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

(A) Queue
(B) Stack
(C) Tree
(D) Link list

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

(A) We can nevigate in both the directions
(B) It require more space than a singly linked list
(C) The insertion and deletion of a node take a bit longer
(D) None of the mentioned

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

(A) You cannot have the ‘next’ pointer point to null in a circular linked list
(B) It is faster to traverse the circular linked list
(C) You may or may not have the ‘next’ pointer point to null in a circular linked list
(D) All of the mentioned

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

(A) O(n)
(B) O(1)
(C) log n
(D) n log n

12. Binary trees can have how many children ?

(A) 2
(B) Any number of children
(C) 0 or 1 or 2
(D) 0 or 1

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

(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n log n)

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

(A) The left child is always lesser than its parent
(B) The right child is always greather than its parent
(C) The left and right subtree should also be binary search tree
(D) None of the mentioned

15. What is an external 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. Quick sort can be categorized into which of the following ?

(A) Brute force technique
(B) Divide and conquer
(C) Greedy algorithm
(D) Dynamics programming

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

(A) (n*(n+1))/2
(B) (n*(n-1))/2
(C) n
(D) Information gives in insufficient

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

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

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

(A) Pre-order traversal
(B) Post-order traversal
(C) Level-order traversal
(D) In-order traversal

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

(A) 10
(B) 6
(C) 16
(D) 0