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

201.	Matrices with a relatively high proportion of zero entries are called _______ matrices.
A.	sparse.
B.	Null.
C.	Zero.
D.	worse.
Answer» A. sparse.

202.	The Postfix equivalent of the Prefix Notation * + ab - cd is
A.	ab + cd - *
B.	abcd +-*
C.	ab+cd*-
D.	ab+-cd*
Answer» A. ab + cd - *

203.	Data structure which is capable of expressing more complex relationship than that of physical adjacency is called______________.
A.	linear data structure.
B.	linked list.
C.	non linear data Structure
D.	data structure.
Answer» C. non linear data Structure

204.	A tree is a data structure which represents hierarchical relationship between individual _________.
A.	data items.
B.	fields.
C.	nodes.
D.	linked list.
Answer» A. data items.

205.	In a directed tree any node which has out degree 0 is called a terminal node or__________.
A.	a tree.
B.	a list.
C.	a node.
D.	a leaf.
Answer» D. a leaf.

206.	In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
A.	directed.
B.	structure.
C.	ordered.
D.	degree of.
Answer» C. ordered.

207.	______________ a tree means processing it in such a way that each node is visited only once.
A.	Traversing.
B.	Implement.
C.	Partition.
D.	Node.
Answer» A. Traversing.

208.	The length of the path is the number of_____________ on the path.
A.	nodes.
B.	fields.
C.	data.
D.	edges.
Answer» D. edges.

209.	The children node of same parent is called____________.
A.	binary tree.
B.	tree.
C.	sibling.
D.	list.
Answer» C. sibling.

210.	The situation in linked list START = NULL is called_________
A.	Overflow
B.	Underflow
C.	Zero
D.	None of the above
Answer» B. Underflow

211.	A code which deals about short form of a program is called __________ code.
A.	program.
B.	data.
C.	pseudo.
D.	derived.
Answer» C. pseudo.

212.	Which of the application may use a stack?
A.	Expression Evaluation
B.	Keeping track of local variables at run time.
C.	Syntax analyzer for a compiler
D.	All of the above.
Answer» A. Expression Evaluation

213.	The queue which wraps around upon reaching the end of the array is called as____________.
A.	circular queue.
B.	linked queue.
C.	doubly linked list.
D.	representation of queue.
Answer» A. circular queue.

214.	A _______________ is a reference to a memory location, which is used to store data that is described in a data type.
A.	element.
B.	variable.
C.	pointer.
D.	memory.
Answer» B. variable.

215.	If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
A.	ABCD
B.	DCBA
C.	DCAB
D.	ABDC
Answer» B. DCBA

216.	____________ has certain attributes or properties which may be assigned values.
A.	field system.
B.	record.
C.	entity.
D.	files.
Answer» C. entity.

217.	The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________.
A.	6
B.	5
C.	7
D.	8
Answer» B. 5

218.	Maximum degree in any vector in a graph with n vertices is ________.
A.	n.
B.	n-1.
C.	n+1.
D.	2n+1.
Answer» B. n-1.

219.	If FRONT = NULL then _________.
A.	queue full
B.	queue empty
C.	dequeue
D.	priority queue
Answer» B. queue empty

220.	_______________ is a solution to a problem independent of programming language.
A.	Efficient.
B.	Linked list.
C.	Data structure.
D.	Algorithm.
Answer» D. Algorithm.

221.	________ is the situation where data-structure is empty.
A.	Overflow.
B.	Underflow.
C.	Null.
D.	Empty.
Answer» B. Underflow.

222.	When elements are deleted the nodes go to_________.
A.	registers.
B.	free pool.
C.	recycle bin.
D.	gets deleted permanently.
Answer» B. free pool.

223.	Expression into postfix expression: (A - B) * (D / E)
A.	ABDE - * /
B.	- * / ABDE
C.	A B - D E * /
D.	* - A B / D E
Answer» D. * - A B / D E

224.	Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called ________
A.	elementary items.
B.	atoms.
C.	scalars.
D.	structure.
Answer» D. structure.

225.	Quick sort uses ____ for implementation.
A.	recursion.
B.	traversal.
C.	heaps.
D.	queues.
Answer» A. recursion.

310+ more mcqs Solved MCQs

Matrices with a relatively high proportion of zero entries are called _______ matrices.

The Postfix equivalent of the Prefix Notation * + ab - cd is

Data structure which is capable of expressing more complex relationship than that of physical adjacency is called______________.

A tree is a data structure which represents hierarchical relationship between individual _________.

In a directed tree any node which has out degree 0 is called a terminal node or__________.

In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.

______________ a tree means processing it in such a way that each node is visited only once.

The length of the path is the number of_____________ on the path.

The children node of same parent is called____________.

The situation in linked list START = NULL is called_________

A code which deals about short form of a program is called __________ code.

Which of the application may use a stack?

The queue which wraps around upon reaching the end of the array is called as____________.

A _______________ is a reference to a memory location, which is used to store data that is described in a data type.

If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?

____________ has certain attributes or properties which may be assigned values.

The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________.

Maximum degree in any vector in a graph with n vertices is ________.

If FRONT = NULL then _________.

_______________ is a solution to a problem independent of programming language.

________ is the situation where data-structure is empty.

When elements are deleted the nodes go to_________.

Expression into postfix expression: (A - B) * (D / E)

Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called ________

Quick sort uses ____ for implementation.

What is the worst-case time for heap sort to sort an array of n elements?

The __________________ denotes the greatest integer.

A binary tree of depth "d" is an almost complete binary tree if __________.

Program module contains its own list of variables called ____________.

The number of nodes in a complete binary tree of level 5 is__________.

The string with zero characters is called___________.

The unit equal to the number of bits needed to represent a character is called a ________.

The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?

In variable length storage two dollar signs are used to signal the __________.

The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

Each node in a singly linked lists have ______ fields

Quotation marks are also called as ____________.

A string `s` consists of x, y and if x is an empty string then y is called as___________.

The length of the string can be listed as an additional item in _____________.

Who invented Quick sort procedure?

For the heap sort, access to nodes involves simple _______________ operations.

The maximum number of nodes on level i of a binary tree is ___________.

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

Which of the following is useful in traversing a given graph by Breath first search?

What is an external sorting algorithm?

Allocating memory for arrays during program compilation is___________.

The elements of an array are allocated in spaces________.

Accessing and processing each array elements is called __________.

An m*n array has _________number of elements.

The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.

226.	What is the worst-case time for heap sort to sort an array of n elements?
A.	O(log n).
B.	O(n).
C.	O(n log n).
D.	O(nÂ²).
Answer» C. O(n log n).

227.	The __________________ denotes the greatest integer.
A.	ceiling.
B.	time.
C.	space.
D.	floor.
Answer» A. ceiling.

228.	A binary tree of depth "d" is an almost complete binary tree if __________.
A.	each leaf in the tree is either at level.
B.	for any node.
C.	both a and b.
D.	None.
Answer» C. both a and b.

229.	Program module contains its own list of variables called ____________.
A.	global.
B.	scope.
C.	local.
D.	external.
Answer» C. local.

230.	The number of nodes in a complete binary tree of level 5 is__________.
A.	15.
B.	20.
C.	63.
D.	31.
Answer» D. 31.

231.	The string with zero characters is called___________.
A.	null string.
B.	zero string.
C.	one string.
D.	empty string.
Answer» D. empty string.

232.	The unit equal to the number of bits needed to represent a character is called a ________.
A.	byte.
B.	bit.
C.	mega bytes.
D.	kilo bytes.
Answer» A. byte.

233.	The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
A.	11
B.	12
C.	13
D.	14
Answer» D. 14

234.	In variable length storage two dollar signs are used to signal the __________.
A.	end of the string.
B.	beginning of the string.
C.	mid-level of the string.
D.	index.
Answer» A. end of the string.

235.	The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
A.	2 deletions and 3 additions
B.	3 additions and 2 deletions
C.	3 deletions and 3 additions
D.	3 deletions and 4 additions
Answer» C. 3 deletions and 3 additions