Type Here to Get Search Results !

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

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

n edges
a cycle of odd length
no cycle of odd length
ANSWER= (C) no cycle of odd length

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

Heap
Array
Stack

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

tail
terminator

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

Pendant vertex
bridge
articulation point

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

primitive data structure
non-primitive data structure
both a & b

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

Stack
Set
List

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

articulation point
sink
isolated vertex

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

maximum of n,d
n + d
nd

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

Queue
Tree

10. Adjacency matrix of a digraph is identity

identity
symmetric
asimmetric

11. Data structre is divided into _____ parts.

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

array
tree

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

Stack
Queue
Both stack and queue

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

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

Inserting element at rear
Removing element from front
Removing element from middle
ANSWER= (C) Removing element from middle

16. BFS

scans all incident edges before moving to the other vertex
scans adjacent unvisited vertex as soon as possible
is same as backtracking

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

Lists implemented with an array
ANSWER= (C) Lists implemented with an array

18.  Each Algorithm begins with a ___.

Condition
Parameter
Return Statement

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

9 edges, 6 vertices
6 edges, 4 vertices
10 edges, 5 vertices
ANSWER= (C) 10 edges, 5 vertices

20. In top-down approach-

A problem is subdivided into subproblems; each one is attacked without worrying about others.
A problem is tackled from beginning to end in one go.
Subproblems are put together to solve the main problem.
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?

Linear time
Logarithmic time

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

x+ 1 edges.
x-1 edges
x edges

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

fifo lists
lifo list
piles

24.What is sparsity of a matrix?

The fraction of non-zero elements over the total number of elements
The fraction of zero elements over the total number of elements
The fraction of total number of elements over the non-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

n(n-1)/2
n-2

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

stacks
queue

27. Which of the following is false?

Suffix array is used in string matching problems
Suffix array is always sorted
Suffix array contains all the suffixes of the given string
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

29.  BFS constructs

a minimal cost spanning tree of a graph
a depth first spanning tree of a graph
a breath first spanning tree of a graph
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 _________.

pointer to class
pointer to an integer
pointer to character