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

101.	A linked list is made up of a set of objects known as
A.	nodes
B.	arrays
C.	entities
D.	instances
Answer» A. nodes

102.	How do you calculate the pointer difference in a memory efficient double linked list?
A.	head xor tail
B.	pointer to previous node xor pointer to next node
C.	pointer to previous node – pointer to next node
D.	pointer to next node – pointer to previous node
Answer» B. pointer to previous node xor pointer to next node

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

104.	Which of the following name does not relate to stacks?
A.	fifo lists
B.	lifo list
C.	piles
D.	push-down lists
Answer» A. fifo lists

105.	A data structure where elements can be added or removed at either end but not in the middle is called …
A.	arrays
B.	stacks
C.	queues
D.	deque
Answer» D. deque

106.	The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is
A.	ab + cd∗e − fg /∗∗
B.	/ ab + cd ∗ e − f ∗∗g /
C.	ab + cd ∗ e − ∗f ∗ g /
D.	ab + cde ∗ − ∗ f ∗ g /
Answer» A. ab + cd∗e − fg /∗∗

107.	What is the postfix form of the following prefix expression -A/B*C$DE ?
A.	abcde$*/-
B.	a-bcde$*/-
C.	abc$ed*/-
D.	a-bcde$*/
Answer» A. abcde$*/-

108.	The data structure required to evaluate a postfix expression is
A.	queue
B.	stacks
C.	array
D.	linked-list
Answer» B. stacks

109.	What is the postfix form of the following prefix: *+ab–cd
A.	ab+cd–*
B.	abc+*–
C.	ab+*cd–
D.	ab+*cd–
Answer» A. ab+cd–*

110.	A queue is a,
A.	fifo (first in first out) list
B.	lifo (last in first out) list
C.	ordered array
D.	linear tree
Answer» A. fifo (first in first out) list

111.	In stack terminology, the __________operations are known as push and pop operations respectively.
A.	delete
B.	insert
C.	both (a) and (b)
D.	none of the above
Answer» C. both (a) and (b)

112.	A common example of a queue is people waiting in line at a__________.
A.	bus stop
B.	movie hall
C.	shopping mall
D.	none of the above
Answer» A. bus stop

113.	What is one of the common examples of a stack?
A.	a pile of books
B.	bus stop
C.	a basket of fruits
D.	a carat of eggs
Answer» A. a pile of books

114.	When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
A.	-1
B.	0
C.	1
D.	x
Answer» A. -1

115.	What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
A.	overflow
B.	underflow
C.	top
D.	none of the above
Answer» A. overflow

116.	The total number of elements in a stack at a given point of time can be calculated from the value of______.
A.	overflow
B.	top
C.	queues
D.	underflow
Answer» B. top

117.	When the push operation is performed on stack the value of TOS will be ______
A.	decrement
B.	increment
C.	one
D.	none of these
Answer» B. increment

118.	A double linked list contains reference to _____
A.	previous node
B.	next node
C.	current node
D.	both a & b
Answer» D. both a & b

119.	Data Structure that are created by user as per their requirement are known as
A.	primitive data structure
B.	non-primitive data structure
C.	both a & b
D.	none of these
Answer» A. primitive data structure

120.	To insert element at start, the previous pointer of newly added node would point to ______
A.	null
B.	next node
C.	new node
D.	head node
Answer» A. null

121.	In linked list implementation, a node carries information regarding
A.	the data
B.	the link
C.	both a & b
D.	none of these
Answer» C. both a & b

122.	Which of the following data structure is linear type?
A.	strings
B.	stack
C.	queue
D.	all of these
Answer» D. all of these

123.	Stack is ____ type of data structure.
A.	lifo
B.	fifo
C.	both a & b
D.	none of these
Answer» A. lifo

124.	In stack deletion operation is referred as _____
A.	push
B.	pop
C.	peek
D.	none of these
Answer» B. pop

125.	Queue is _____ type of data structure.
A.	lifo
B.	fifo
C.	both a & b
D.	none of these
Answer» B. fifo

310+ more mcqs Solved MCQs

A linked list is made up of a set of objects known as

How do you calculate the pointer difference in a memory efficient double linked list?

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

Which of the following name does not relate to stacks?

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

The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

What is the postfix form of the following prefix expression -A/B*C$DE ?

The data structure required to evaluate a postfix expression is

What is the postfix form of the following prefix: *+ab–cd

A queue is a,

In stack terminology, the __________operations are known as push and pop operations respectively.

A common example of a queue is people waiting in line at a__________.

What is one of the common examples of a stack?

When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.

What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

The total number of elements in a stack at a given point of time can be calculated from the value of______.

When the push operation is performed on stack the value of TOS will be ______

A double linked list contains reference to _____

Data Structure that are created by user as per their requirement are known as

To insert element at start, the previous pointer of newly added node would point to ______

In linked list implementation, a node carries information regarding

Which of the following data structure is linear type?

Stack is ____ type of data structure.

In stack deletion operation is referred as _____

Queue is _____ type of data structure.

Data structre is divided into _____ parts.

In ___ Data Structure data can be processed one by one sequentially

When we insert an element in Queue, which pointer is increased by one?

Which of the following is not the possible operation on stack?

Which of the following is a possible operation on queue?

In stack, to display the lastly inserted element without removing it, which function is used?

if there are no nodes in linked list then start pointer will point at which value?

Worst space complexity of queue data structure is

Worst space complexity of stack data structure is

A ___________refers to a single unit of values.

Data items that are divided into subitems are called ___________.

Which of these best describes an array?

In _______________all the records contain the same data items with the same amount of space.

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

Arrays are best data structures for _____________________________.

How do the nested calls of the function get managed?

__________is combining the records in two different sorted files in to a single sorted file.

In linear search algorithm the Worst case occurs when ____________.

The complexity of Binary search algorithm is ____________.

The complexity of Bubble sort algorithm is _________.

Inorder traversal of binary search tree will produce _______________.

Sub algorithms fall into two basic categories: function sub algorithms and ____________ sub algorithms.

Two main measures for the efficiency of an algorithm are____________.

New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.

Which of the following data structure is linear data structure?

126.	Data structre is divided into _____ parts.
A.	4
B.	3
C.	2
D.	1
Answer» C. 2

127.	In ___ Data Structure data can be processed one by one sequentially
A.	array
B.	linked list
C.	tree
D.	none of these
Answer» B. linked list

128.	When we insert an element in Queue, which pointer is increased by one?
A.	front
B.	rear
C.	both a & b
D.	none of these
Answer» B. rear

129.	Which of the following is not the possible operation on stack?
A.	push
B.	pop
C.	display
D.	enqueue
Answer» D. enqueue

130.	Which of the following is a possible operation on queue?
A.	push
B.	pop
C.	display
D.	enqueue
Answer» D. enqueue

131.	In stack, to display the lastly inserted element without removing it, which function is used?
A.	push
B.	pop
C.	display
D.	peek
Answer» D. peek

132.	if there are no nodes in linked list then start pointer will point at which value?
A.	null
B.	garbage
C.	1
D.	2
Answer» A. null

133.	Worst space complexity of queue data structure is
A.	o(n)
B.	o(log(n))
C.	o(1)
D.	n/a
Answer» A. o(n)

134.	Worst space complexity of stack data structure is
A.	o(log(n))
B.	o(1)
C.	n/a
D.	o(n)
Answer» D. o(n)

135.	A ___________refers to a single unit of values.
A.	data value.
B.	attribute value.
C.	data item.
D.	elementary.
Answer» C. data item.