Chapter:

310+ more mcqs Solved MCQs

in Data Structures (DS)

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Information Technology FY (BSc IT) , Bachelor of Computer Applications (BCA) .

Chapters

Take a Test

251.	______ is not a technique of tree traversal.
A.	pre-order
B.	post-order
C.	prefix
D.	in-order
Answer» C. prefix

252.	Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.
A.	O(n log n) sorts.
B.	Divide-and-conquer sorts.
C.	Interchange sorts.
D.	Average time is quadratic.
Answer» C. Interchange sorts.

253.	The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
A.	merge.
B.	obstacle.
C.	overlapping.
D.	collision.
Answer» C. overlapping.

254.	Uniform distribution of the hash address throughout the given set L is __________.
A.	reduce the number of collision.
B.	increase the number of collision.
C.	totally avoid collision.
D.	manage address.
Answer» A. reduce the number of collision.

255.	An edge E is called _________ if it has identical endpoints.
A.	multiple edges.
B.	loops.
C.	finite.
D.	digraph.
Answer» B. loops.

256.	__________involves maintaining two tables in memory.
A.	Arranging.
B.	Bonding.
C.	Combing.
D.	Chaining.
Answer» D. Chaining.

257.	An _________ is a well defined list of steps for solving a problem.
A.	Algorithm.
B.	Program.
C.	Procedure.
D.	Process.
Answer» A. Algorithm.

258.	The data items in a record form a ________ structure which can be described by means of level numbers.
A.	hierarchical.
B.	procedural.
C.	indexed.
D.	leveled.
Answer» A. hierarchical.

259.	A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
A.	n.
B.	n+1.
C.	n+2.
D.	n-1.
Answer» B. n+1.

260.	A vertex of degree one is called __________.
A.	padent
B.	isolated vertex
C.	null vertex
D.	colored vertex
Answer» A. padent

261.	A connected graph T without any cycles is called _____________.
A.	a tree graph.
B.	free tree.
C.	a tree.
D.	all of the above.
Answer» D. all of the above.

262.	If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
A.	isolate.
B.	complete.
C.	finite.
D.	Strongly connected.
Answer» B. complete.

264.	Which of the following is true while inserting a new node in the list?
A.	Check there is node in the list.
B.	Check in the free node in the pool.
C.	There is no node.
D.	Underflow.
Answer» B. Check in the free node in the pool.

265.	Which of the following data structures are indexed structures?
A.	Linear arrays.
B.	Linked lists.
C.	Arrays.
D.	First address.
Answer» A. Linear arrays.

266.	The efficiency of a BFS algorithm is dependent on _______.
A.	Algorithm.
B.	Tree.
C.	Problem.
D.	Graph.
Answer» D. Graph.

263.	In a graph G if e=(u,v), then u and v are called ___________.
A.	endpoints.
B.	adjacent nodes.
C.	neighbours.
D.	all of the above.
Answer» D. all of the above.

267.	The average number of key comparisons done in a successful sequential search in a list of length n is ____________.
A.	log n.
B.	n-1/2.
C.	n/2.
D.	n+1/2.
Answer» D. n+1/2.

268.	Divide and conquer is an important algorithm design paradigm based on _______.
A.	multi-branched recursion.
B.	single-branched recursion.
C.	two-way recursion.
D.	None.
Answer» A. multi-branched recursion.

269.	The correctness of a divide and conquer algorithm is usually proved by _________.
A.	mathematical theorem.
B.	de-Morgan `s law.
C.	mathematical induction.
D.	none.
Answer» C. mathematical induction.

270.	The ____________ is used in an elegant sorting algorithm.
A.	Heap sort.
B.	Quick sort.
C.	Merge sort.
D.	Radix sort.
Answer» A. Heap sort.

271.	____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
A.	Travelling Salesman tour.
B.	Eulerian tour.
C.	Hamiltonian tour.
D.	None.
Answer» C. Hamiltonian tour.

272.	____________ data structure is used to implement Depth First search.
A.	Array.
B.	Linked list.
C.	Queue.
D.	Stack.
Answer» D. Stack.

273.	The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
A.	log2N
B.	n-1
C.	n
D.	None of the above
Answer» B. n-1

274.	Each entry in a linked list is a called a_______________.
A.	Link.
B.	Node.
C.	Data Structure.
D.	Avail.
Answer» B. Node.

275.	Which of the following is two way lists?
A.	Grounded header list.
B.	Circular header list.
C.	Linked list with header and trailer nodes.
D.	List traversed in two directions.
Answer» D. List traversed in two directions.

310+ more mcqs Solved MCQs

______ is not a technique of tree traversal.

Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.

The possibility of two different keys k1 & k2 yielding the same hash address is called__________.

Uniform distribution of the hash address throughout the given set L is __________.

An edge E is called _________ if it has identical endpoints.

__________involves maintaining two tables in memory.

An _________ is a well defined list of steps for solving a problem.

The data items in a record form a ________ structure which can be described by means of level numbers.

A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.

A vertex of degree one is called __________.

A connected graph T without any cycles is called _____________.

If every node u in G is adjacent to every other node v in G, A graph is said to be _______.

In a graph G if e=(u,v), then u and v are called ___________.

Which of the following is true while inserting a new node in the list?

Which of the following data structures are indexed structures?

The efficiency of a BFS algorithm is dependent on _______.

The average number of key comparisons done in a successful sequential search in a list of length n is ____________.

Divide and conquer is an important algorithm design paradigm based on _______.

The correctness of a divide and conquer algorithm is usually proved by _________.

The ____________ is used in an elegant sorting algorithm.

____________ is finding a path/tour through the graph such that every vertex is visited exactly once.

____________ data structure is used to implement Depth First search.

The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is

Each entry in a linked list is a called a_______________.

Which of the following is two way lists?

A list that has no nodes is called________.

The special list which consists of unused memory space is called __________.

To insert a new node in linked list free node will be available in ___________.

A ______________ list is a header list where the node points back to the header node.

How many pointers are necessarily changed for the insertion in a Linked List?

An algorithm that calls itself directly or indirectly is known as ____________.

Minimum number of fields in each node of a doubly linked list is____

A graph in which all vertices have equal degree is known as ____

A vertex of in-degree zero in a directed graph is called a/an

A graph is a tree if and only if graph is

The elements of a linked list are stored

A parentheses checker program would be best implemented using

To perform level-order traversal on a binary tree, which of the following data structure will be required?

Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?

A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

Which of following data structure is more appropriate for implementing quick sort iteratively?

The number of edges in a complete graph of n vertices is

If two trees have same structure and but different node content, then they are called ___

If two trees have same structure and node content, then they are called ____

Finding the location of a given item in a collection of items is called ……

Quick sort is also known as ……..

………. sorting is good to use when alphabetizing a large list of names.

The total number of comparisons in a bubble sort is ….

……… form of access is used to add and remove nodes from a queue.

New nodes are added to the ……… of the queue.

276.	A list that has no nodes is called________.
A.	End list.
B.	Zero list.
C.	Null list.
D.	Sentinel list.
Answer» C. Null list.

277.	The special list which consists of unused memory space is called __________.
A.	Free space.
B.	Empty space.
C.	Available space.
D.	Free storage list.
Answer» D. Free storage list.

278.	To insert a new node in linked list free node will be available in ___________.
A.	Available list.
B.	Avail list.
C.	Free node list.
D.	Memory space list.
Answer» B. Avail list.

279.	A ______________ list is a header list where the node points back to the header node.
A.	Circular header.
B.	Grounded header.
C.	Two way header.
D.	One way header.
Answer» A. Circular header.

280.	How many pointers are necessarily changed for the insertion in a Linked List?
A.	1.
B.	2.
C.	3.
D.	5.
Answer» B. 2.

281.	An algorithm that calls itself directly or indirectly is known as ____________.
A.	Sub algorithm. .
B.	Recursion.
C.	Polish notation.
D.	Traversal algorithm.
Answer» B. Recursion.

282.	Minimum number of fields in each node of a doubly linked list is____
A.	2
B.	3
C.	4
D.	None of the above
Answer» B. 3

283.	A graph in which all vertices have equal degree is known as ____
A.	Complete graph
B.	Regular graph
C.	Multi graph
D.	Simple graph
Answer» A. Complete graph

284.	A vertex of in-degree zero in a directed graph is called a/an
A.	Root vertex
B.	Isolated vertex
C.	Sink
D.	Articulation point
Answer» C. Sink

285.	A graph is a tree if and only if graph is
A.	Directed graph
B.	Contains no cycles
C.	Planar
D.	Completely connected
Answer» B. Contains no cycles