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

401.	A linked list whose last node points back to the list node instead of containing the null pointer________.
A.	circular list.
B.	linked list.
C.	circular doubly linked list.
D.	doubly linked list.
Answer» A. circular list.

402.	__________________ is a header list where the last node contains the null pointer.
A.	Circular Header linked list
B.	Grounded Header Linked list
C.	Linked list
D.	Linear Array
Answer» B. Grounded Header Linked list

403.	Which of the following case does not exist in complexity theory
A.	Best case
B.	Worst case
C.	Average case
D.	Null case
Answer» D. Null case

404.	The _________ for a linked list is a pointer variable that locates the beginning of the list.
A.	anchor.
B.	base.
C.	footer.
D.	header.
Answer» D. header.

405.	The time factor when determining the efficiency of algorithm is measured by____________.
A.	counting microseconds.
B.	counting the number of key operations.
C.	counting the number of statements.
D.	counting the kilobytes of algorithm.
Answer» B. counting the number of key operations.

406.	The space factor when determining the efficiency of algorithm is measured by___________.
A.	counting the maximum memory needed by the algorithm.
B.	counting the minimum memory needed by the algorithm.
C.	counting the average memory needed by the algorithm.
D.	counting the maximum disk space needed by the algorithm.
Answer» A. counting the maximum memory needed by the algorithm.

407.	The Worst case occur in linear search algorithm when_____________.
A.	item is somewhere in the middle of the array.
B.	item is not in the array at all.
C.	item is the last element in the array.
D.	item is the last element in the array or is not there at all.
Answer» D. item is the last element in the array or is not there at all.

408.	The complexity of linear search algorithm is____________.
A.	O(log n).
B.	O(n).
C.	O(n2).
D.	O(n log n).
Answer» B. O(n).

409.	The time required in best case for search operation in binary tree is ____________.
A.	O(n).
B.	O(2n).
C.	O(log n).
D.	O( log 2n).
Answer» C. O(log n).

410.	Which of the following way follows in Post order traversal?
A.	Root -> Left sub tree -> Right sub tree.
B.	Root -> Right sub tree -> Left sub tree.
C.	Left sub tree -> Root -> Right sub tree.
D.	Left sub tree -> Right sub tree -> Root.
Answer» D. Left sub tree -> Right sub tree -> Root.

411.	A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
A.	Doubly Linked List.
B.	Circular List.
C.	Header Linked List.
D.	None.
Answer» C. Header Linked List.

415.	The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________.
A.	buffering.
B.	garbage collection.
C.	deal location.
D.	buffer collection.
Answer» B. garbage collection.

416.	Important part of any compiler is the construction and maintenances of a dictionary, this types of dictionary are called______________.
A.	symbol table.
B.	index table.
C.	grammar table.
D.	pointer table.
Answer» A. symbol table.

417.	The data structure required to check whether an expression contains balanced parenthesis is?
A.	queue
B.	stack
C.	linked list
D.	file
Answer» B. stack

418.	What are the advantages of arrays?
A.	Easier to store elements of same data type
B.	Used to implement other data structures like stack and queue
C.	Convenient way to represent matrices as a 2D array
D.	All of the mentioned
Answer» D. All of the mentioned

412.	_______________is a header list where the last node points back to the header node.
A.	Doubly header List.
B.	Singly header List.
C.	Grounder Header List.
D.	Circular Header List.
Answer» D. Circular Header List.

413.	The advantage of a two-way list and a circular header list is combined into a ________.
A.	two-way circular header list.
B.	two-way circular list.
C.	two-way header circular list.
D.	None.
Answer» A. two-way circular header list.

414.	The pointer of the last node contains a special value called_____________.
A.	null pointer.
B.	index pointer.
C.	pointer link.
D.	address pointer.
Answer» B. index pointer.

419.	The number of possible ordered trees with three nodes A,B,C is?
A.	16
B.	12.
C.	10
D.	6
Answer» B. 12.

420.	The earliest use of__________ sorting was in conjunction with network analysis.
A.	topological.
B.	bubble.
C.	radix.
D.	heap.
Answer» A. topological.

421.	_________is not the operation that can be performed on Queue.
A.	Traversal.
B.	Insertion.
C.	Deletion.
D.	Retrieval.
Answer» A. Traversal.

422.	A tree is a finite set of_________.
A.	loops.
B.	domains.
C.	functions.
D.	nodes.
Answer» D. nodes.

423.	Stack can be represented by means of ____________.
A.	Tree.
B.	Graph.
C.	One-way List.
D.	None.
Answer» C. One-way List.

424.	The hashing file space is divided into_______________.
A.	nodes and roots.
B.	roots and slots.
C.	buckets and slots.
D.	slots and nodes.
Answer» C. buckets and slots.

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

550+ Data Structures (DS) Solved MCQs

A linked list whose last node points back to the list node instead of containing the null pointer________.

__________________ is a header list where the last node contains the null pointer.

Which of the following case does not exist in complexity theory

The _________ for a linked list is a pointer variable that locates the beginning of the list.

The time factor when determining the efficiency of algorithm is measured by____________.

The space factor when determining the efficiency of algorithm is measured by___________.

The Worst case occur in linear search algorithm when_____________.

The complexity of linear search algorithm is____________.

The time required in best case for search operation in binary tree is ____________.

Which of the following way follows in Post order traversal?

A _________is a linked list which always contains a special node called the header node, at the beginning of the list.

_______________is a header list where the last node points back to the header node.

The advantage of a two-way list and a circular header list is combined into a ________.

The pointer of the last node contains a special value called_____________.

The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________.

Important part of any compiler is the construction and maintenances of a dictionary, this types of dictionary are called______________.

The data structure required to check whether an expression contains balanced parenthesis is?

What are the advantages of arrays?

The number of possible ordered trees with three nodes A,B,C is?

The earliest use of__________ sorting was in conjunction with network analysis.

_________is not the operation that can be performed on Queue.

A tree is a finite set of_________.

Stack can be represented by means of ____________.

The hashing file space is divided into_______________.

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?

426.	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 - *

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

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

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

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

431.	______________ 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.

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

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

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

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