550+ Data Structures (DS) Solved MCQs

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.	What will be the value of top, if there is a size of stack STACK_SIZE is 5
A.	5
B.	6
C.	4
D.	none
Answer» C. 4

252.	………… is not the operation that can be performed on queue.
A.	insertion
B.	deletion
C.	retrieval
D.	traversal
Answer» D. traversal

253.	There is an extra element at the head of the list called a ……….
A.	antinel
B.	sentinel
C.	list header
D.	list head
Answer» B. sentinel

254.	A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
A.	vertices, edges
B.	edges, vertices
C.	vertices, paths
D.	graph node, edges
Answer» A. vertices, edges

255.	A ……….. is a graph that has weights of costs associated with its edges.
A.	network
B.	weighted graph
C.	both a and b
D.	none a and b
Answer» C. both a and b

256.	In general, the binary search method needs no more than ……………. comparisons.
A.	[log2n]-1
B.	[logn]+1
C.	[log2n]
D.	[log2n]+1
Answer» D. [log2n]+1

257.	Which of the following is not the type of queue?
A.	ordinary queue
B.	single ended queue
C.	circular queue
D.	priority queue
Answer» B. single ended queue

258.	The property of binary tree is
A.	the first subset is called left subtree
B.	the second subtree is called right subtree
C.	the root cannot contain null
D.	the right subtree can be empty
Answer» D. the right subtree can be empty

259.	Any node is the path from the root to the node is called
A.	successor node
B.	ancestor node
C.	internal node
D.	none of the above
Answer» B. ancestor node

260.	Which is/are the application(s) of stack
A.	function calls
B.	large number arithmetic
C.	evaluation of arithmetic expressions
D.	all of the above
Answer» D. all of the above

261.	A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
A.	directed tree
B.	undirected tree
C.	dis-joint tree
D.	direction oriented tree
Answer» A. directed tree

263.	Which of the following data structure is non-linear type?
A.	strings
B.	lists
C.	stacks
D.	tree
Answer» D. tree

264.	Which of the following data structure is linear type?
A.	array
B.	tree
C.	graphs
D.	hierarchy
Answer» A. array

265.	The logical or mathematical model of a particular organization of data is called a ………
A.	data structure
B.	data arrangement
C.	data configuration
D.	data formation
Answer» A. data structure

266.	The simplest type of data structure is ………………
A.	multidimensional array
B.	linear array
C.	two dimensional array
D.	three dimensional array
Answer» B. linear array

262.	…………………. Is a directed tree in which outdegree of each node is less than or equal to two.
A.	unary tree
B.	binary tree
C.	trinary tree
D.	both b and c
Answer» B. binary tree

267.	Linear arrays are also called ……………….
A.	straight line array
B.	one-dimensional array
C.	vertical array
D.	horizontal array
Answer» B. one-dimensional array

268.	Arrays are best data structures …………
A.	for relatively permanent collections of data
B.	for the size of the structure and the data in the structure are constantly changing
C.	for both of above situation
D.	for none of the above
Answer» A. for relatively permanent collections of data

269.	Which of the following data structures are indexed structures?
A.	linear arrays
B.	linked lists
C.	graphs
D.	trees
Answer» A. linear arrays

270.	Each node in a linked list has two pairs of ………….. and ……………….
A.	link field and information field
B.	link field and avail field
C.	avail field and information field
D.	address field and link field
Answer» A. link field and information field

271.	A …………………… does not keep track of address of every element in the list.
A.	stack
B.	string
C.	linear array
D.	queue
Answer» C. linear array

272.	When does top value of the stack changes?
A.	before deletion
B.	while checking underflow
C.	at the time of deletion
D.	after deletion
Answer» D. after deletion

273.	Arrays are best data structures …………
A.	for relatively permanent collections of data.
B.	for the size of the structure and the data in the structure are constantly changing
C.	for both of above situation
D.	for none of the above
Answer» A. for relatively permanent collections of data.

274.	Arrays are best data structures
A.	for relatively permanent collections of data
B.	for the size of the structure and the data in the structure are constantly changing
C.	for both of above situation
D.	for none of above situation
Answer» A. for relatively permanent collections of data

275.	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

550+ Data Structures (DS) Solved MCQs

What will be the value of top, if there is a size of stack STACK_SIZE is 5

………… is not the operation that can be performed on queue.

There is an extra element at the head of the list called a ……….

A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.

A ……….. is a graph that has weights of costs associated with its edges.

In general, the binary search method needs no more than ……………. comparisons.

Which of the following is not the type of queue?

The property of binary tree is

Any node is the path from the root to the node is called

Which is/are the application(s) of stack

A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

…………………. Is a directed tree in which outdegree of each node is less than or equal to two.

Which of the following data structure is non-linear type?

Which of the following data structure is linear type?

The logical or mathematical model of a particular organization of data is called a ………

The simplest type of data structure is ………………

Linear arrays are also called ……………….

Arrays are best data structures …………

Which of the following data structures are indexed structures?

Each node in a linked list has two pairs of ………….. and ……………….

A …………………… does not keep track of address of every element in the list.

When does top value of the stack changes?

Arrays are best data structures …………

Arrays are best data structures

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

A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

In a priority queue, insertion and deletion takes place at ………………

The time complexity of quick sort is …………..

Which of the following is an application of stack?

The data structure which is one ended is ………………

A list which displays the relationship of adjacency between elements is said to be

……………….. level is where the model becomes compatible executable code

Which of the following data structure is not linear data structure?

Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

Each array declaration need not give, implicitly or explicitly, the information about

The elements of an array are stored successively in memory cells because

Linked lists are best suited

Finding the location of the element with a given value is:

The operation of processing each element in the list is known as

Arrays are best data structures

Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

What will be the value of top, if there is a size of stack STACK_SIZE is 5

………… is not the operation that can be performed on queue.

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

Which of the following name does not relate to stacks?

The term "push" and "pop" is related to the

Which data structure allows deleting data elements from front and inserting at rear?

node.next -> node.next.next; will make

A circular linked list can be used for

In doubly linked lists

Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

276.	A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
A.	circular queue
B.	random of queue
C.	priority
D.	dequeue
Answer» D. dequeue

277.	In a priority queue, insertion and deletion takes place at ………………
A.	front, rear end
B.	only at rear end
C.	only at front end
D.	any position
Answer» D. any position

278.	The time complexity of quick sort is …………..
A.	o(n)
B.	o(n2)
C.	o(n log n)
D.	o(log n)
Answer» C. o(n log n)

279.	Which of the following is an application of stack?
A.	finding factorial
B.	tower of hanoi
C.	infix to postfix conversion
D.	all of the above
Answer» B. tower of hanoi

280.	The data structure which is one ended is ………………
A.	queue
B.	stack
C.	tree
D.	graph
Answer» B. stack

281.	A list which displays the relationship of adjacency between elements is said to be
A.	linear
B.	non linear
C.	linked list
D.	trees
Answer» A. linear

282.	……………….. level is where the model becomes compatible executable code
A.	abstract level
B.	application level
C.	implementation level
D.	all of the above
Answer» C. implementation level

283.	Which of the following data structure is not linear data structure?
A.	arrays
B.	linked lists
C.	both of the above
D.	none of the above
Answer» D. none of the above

284.	Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
A.	push, pop
B.	pop, push
C.	insert, delete
D.	delete, insert
Answer» A. push, pop

285.	Each array declaration need not give, implicitly or explicitly, the information about
A.	the name of array
B.	the data type of array
C.	the first data from the set to be stored
D.	the index set of the array
Answer» C. the first data from the set to be stored