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

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

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

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

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

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

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

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

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

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

460.	Each node in a singly linked lists have ______ fields
A.	2
B.	3
C.	4
D.	5
Answer» A. 2

461.	Quotation marks are also called as ____________.
A.	string delimiters.
B.	period.
C.	stopper.
D.	string.
Answer» A. string delimiters.

463.	The length of the string can be listed as an additional item in _____________.
A.	base pointer.
B.	pointer array.
C.	node.
D.	record.
Answer» B. pointer array.

464.	Who invented Quick sort procedure?
A.	Hoare.
B.	Sedgewick.
C.	Mellroy.
D.	Coreman.
Answer» A. Hoare.

465.	For the heap sort, access to nodes involves simple _______________ operations.
A.	binary.
B.	arithmetic
C.	algebraic
D.	logarithmic
Answer» B. arithmetic

466.	The maximum number of nodes on level i of a binary tree is ___________.
A.	2i-1.
B.	3i-1.
C.	i+1.
D.	2i+1.
Answer» A. 2i-1.

462.	A string `s` consists of x, y and if x is an empty string then y is called as___________.
A.	initial substring.
B.	substring of s.
C.	node of the string.
D.	index.
Answer» A. initial substring.

467.	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.C
Answer» C. nd.

468.	Which of the following is useful in traversing a given graph by Breath first search?
A.	Stack.
B.	Set.
C.	List.
D.	Queue.
Answer» D. Queue.

469.	What is an external sorting algorithm?
A.	Algorithm that uses tape or disk during the sort
B.	Algorithm that uses main memory during the sort
C.	Algorithm that involves swapping
D.	Algorithm that are considered in place
Answer» A. Algorithm that uses tape or disk during the sort

470.	Allocating memory for arrays during program compilation is___________.
A.	dynamic memory allocation.
B.	memory allocation.
C.	static allocation.
D.	random allocation.
Answer» C. static allocation.

471.	The elements of an array are allocated in spaces________.
A.	successively.
B.	randomly.
C.	alternately.
D.	on any order.
Answer» A. successively.

472.	Accessing and processing each array elements is called __________.
A.	sorting.
B.	traversing.
C.	searching.
D.	merging.
Answer» B. traversing.

473.	An m*n array has _________number of elements.
A.	m.
B.	n.
C.	m2.
D.	m*n.
Answer» D. m*n.

474.	The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.
A.	row major order.
B.	column major order.
C.	random order.
D.	successive order.
Answer» B. column major order.

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

550+ Data Structures (DS) Solved MCQs

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

______ 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________.

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

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

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

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

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

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

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

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

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

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