[ NEW ] Data Structure MCQ Questions and Answers [ SET - 5 ] | Data Structure MCQ ebook

 

1. A graph G with n nodes bipartite if it contains 

A) n edges
B)  a cycle of odd length
C) no cycle of odd length
D) n² edges

ANSWER= (C)  no cycle of odd length

 

2. Which of the following data structure is the best for implementing a priority queue?

A)  Heap
B) Array
C) Stack
D) Linked list

ANSWER= (A) Heap

 

3. First link node of list is accessed from a pointer named

A)  tail
B) head
C) terminator
D) initiator

ANSWER= (B) head

 

4.  The vertex, removal of which makes a graph disconnected is called 

A) Pendant vertex 
B)  bridge 
C)  articulation point 
D) colored vertex

ANSWER= (C)  articulation point 

 

5. Data Structure that are created by user as per their requirement are known as

A) primitive data structure
B)  non-primitive data structure
C) both a & b
D) none of these

ANSWER= (A) primitive data structure

 

6. Which of the following is useful in implementing quick sort?

A) Stack
B) Set
C) List
D) Queue

ANSWER= (D) Queue

 

7. A vertex of in-degree zero in a directed graph is called 

A) articulation point 
B) sink 
C) isolated vertex
D) root vertex

ANSWER= (C)  isolated vertex

 

8.  The number of edges in a regular graph of degree d and n vertices is

A)  maximum of n,d
B) n + d
C)  nd
D) nd/2

ANSWER= (D) nd/2

 

9. A  ____ is a linear collection of self-referential structures, called nodes, connected by pointer links.

A) Queue
B) Linked list
C) Tree
D)Stack

ANSWER= (B)  Linked list

 

10. Adjacency matrix of a digraph is identity

A) identity
B) symmetric
C) asimmetric
D) none of these

ANSWER= (B) symmetric

 

11. Data structre is divided into _____ parts.

A) 4
B) 3
C) 2
D) 1

ANSWER= (A) 2

 

12. In ___ Data Structure data can be processed one by one sequentially

A)  array
B) linked list
C) tree
D)  none of these

ANSWER= (B) linked list

 

13. Which data structure is used for breadth first traversal of a graph? 

A) Stack 
B) Queue
C) Both stack and queue
D) none of these

ANSWER= (B) Queue

 

14. What is the number of nodes in a full binary tree with depth 3?

A) 4
B) 5
C) 6
D) 7

ANSWER= (D) 7

 

15. Which of the following operation is not supported by a queue?

A)  Inserting element at rear
B) Removing element from front
C) Removing element from middle
D) None of above

ANSWER= (C) Removing element from middle

 

16. BFS

A)  scans all incident edges before moving to the other vertex 
B) scans adjacent unvisited vertex as soon as possible
C) is same as backtracking
D) none of these

ANSWER= (B) scans adjacent unvisited vertex as soon as possible

 

17. What kind of list is best to answer many questions such as “what is the item at position n?”

A) Singly-linked lists
B) Doubly-linked lists
C) Lists implemented with an array
D) Circular- linked lists

ANSWER= (C) Lists implemented with an array

 

18.  Each Algorithm begins with a ___.

A) Condition
B) Parameter
C) Return Statement
D) Header

ANSWER= (D) Header

 

19. A non-planar graph with minimum number of vertices has

A) 9 edges, 6 vertices 
B) 6 edges, 4 vertices
C)10 edges, 5 vertices
D) 9 edges, 5 vertices

ANSWER= (C) 10 edges, 5 vertices

 

20. In top-down approach-

A) A problem is subdivided into subproblems; each one is attacked without worrying about others.
B) A problem is tackled from beginning to end in one go.
C) Subproblems are put together to solve the main problem.
D) None of these.

ANSWER= (A) A problem is subdivided into subproblems; each one is attacked without worrying about others.

 

21. What is the worst-case time for binary search finding a single item in an array?

A) Quadratic time
B) Linear time
C)  Logarithmic time
D) Constant time

ANSWER= (C) Logarithmic time

 

22. Any connected graph with x vertices must have at least

A) x+ 1 edges. 
B)  x-1 edges
C)  x edges
D) x/2 edges

ANSWER= (B)  x-1 edges

 

23. Which of the following name does not relate to stacks?

A) fifo lists
B) lifo list
C) piles
D) push-down lists

ANSWER= (A) fifo lists

 

24.What is sparsity of a matrix?

A) The fraction of non-zero elements over the total number of elements
B) The fraction of zero elements over the total number of elements
C) The fraction of total number of elements over the non-zero elements
D)  The fraction of total number of elements over the zero elements

ANSWER= (B) The fraction of zero elements over the total number of elements

 

25. Maximum number of edges in a n-node undirected graph without self loop is

A) n²
B) n(n-1)/2
C) n-2
D) (n+1)(n)/2

ANSWER= (B) n(n-1)/2

 

26. A data structure where elements can be added or removed at either end but not in the middle is called …

A) linked lists
B) stacks
C) queue
D) dequeue

ANSWER= (D) dequeue

 

27. Which of the following is false?

A) Suffix array is used in string matching problems
B) Suffix array is always sorted
C) Suffix array contains all the suffixes of the given string
D) Suffix array is always unsorted

ANSWER= (D) Suffix array is always unsorted

 

28. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

A) singly linked list
B)  circular linked list
C) doubly linked list
D)  linear linked list

ANSWER= (C) doubly linked list

 

29.  BFS constructs

A) a minimal cost spanning tree of a graph 
B) a depth first spanning tree of a graph
C) a breath first spanning tree of a graph 
D) none of these

ANSWER= (A) a minimal cost spanning tree of a graph 

 

30. Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.

A) pointer to class
B)  pointer to an integer
C)  pointer to character
D) pointer to node

ANSWER= (D) pointer to node

Friends if you like this post,kindly comment bellow and do share your responce.Thank You for Visiting.