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

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

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

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

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

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

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

357.	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)

358.	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)

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

360.	Data items that are divided into subitems are called ___________.
A.	single items.
B.	group items.
C.	elementary items.
D.	entity items.
Answer» B. group items.

361.	Which of these best describes an array?
A.	A data structure that shows a hierarchical behavior
B.	Container of objects of similar types
C.	Container of objects of mixed types
D.	All of the mentioned
Answer» B. Container of objects of similar types

362.	In _______________all the records contain the same data items with the same amount of space.
A.	variable-length records.
B.	fixed-length records.
C.	subscripted variable.
D.	superscripted variable.
Answer» B. fixed-length records.

363.	The logical or mathematical model of a particular organization of data is called a _______________.
A.	data structure.
B.	algorithms.
C.	structure.
D.	logic structure.
Answer» A. data structure.

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

365.	How do the nested calls of the function get managed?
A.	Through Queues.
B.	Through Stacks.
C.	Through Trees.
D.	Through Graphs.
Answer» B. Through Stacks.

366.	__________is combining the records in two different sorted files in to a single sorted file.
A.	Sorting.
B.	Searching.
C.	Listing.
D.	Merging.
Answer» D. Merging.

367.	In linear search algorithm the Worst case occurs when ____________.
A.	The item is somewhere in the middle of the array.
B.	The item is not in the array at all.
C.	The item is the last element in the array.
D.	The item is the last element in the array or is not there at all.
Answer» D. The item is the last element in the array or is not there at all.

368.	The complexity of Binary search algorithm is ____________.
A.	O(n).
B.	O(log n ).
C.	O(n2).
D.	O(n log n).
Answer» B. O(log n ).

369.	The complexity of Bubble sort algorithm is _________.
A.	O(n).
B.	O(log n).
C.	O(n2).
D.	O(n log n).
Answer» C. O(n2).

370.	Inorder traversal of binary search tree will produce _______________.
A.	unsorted list.
B.	sorted list.
C.	reverse of input.
D.	none of these.
Answer» B. sorted list.

371.	Sub algorithms fall into two basic categories: function sub algorithms and ____________ sub algorithms.
A.	procedure.
B.	argument.
C.	processor.
D.	methods.
Answer» A. procedure.

372.	Two main measures for the efficiency of an algorithm are____________.
A.	Processor and memory.
B.	Complexity and capacity.
C.	Time and space.
D.	Data and space.
Answer» C. Time and space.

373.	New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
A.	Underflow.
B.	Overflow.
C.	Houseful.
D.	Saturated.
Answer» B. Overflow.

374.	Which of the following data structure is linear data structure?
A.	Tree.
B.	Graph.
C.	Array.
D.	Linked list.
Answer» C. Array.

375.	Which of the following is an example of dynamic programming approach?
A.	Fibonacci Series
B.	Tower of Hanoi
C.	Dijkstra Shortest Path
D.	All of the above
Answer» D. All of the above

550+ Data Structures (DS) Solved MCQs

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?

Which of the following is an example of dynamic programming approach?

The memory address of the first element of an array is called_________.

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

Binary search algorithm cannot be applied to________ concept.

Graph traversal is different from a tree traversal, because

Linked lists are suitable for which of the following problems?

Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________.

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

To represent hierarchical relationship between elements, which data structure is suitable?

When does the ArrayIndexOutOfBoundsException occur?

The depth of a complete binary tree is given by__________.

When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.

Which of the following conditions checks available free space in avail list?

Which of the following sorting algorithm is of divide-and-conquer type?

STACK is also called as ______________.

Collection of related data items is called _______.

Breadth First search is used in____________.

A variable whose size is determined at compile time and cannot be changed at run time is_________.

Process of inserting an element in stack is called ____________.

Length of linear array can be found by using the formula_________

The average number of key comparisons done in a successful sequential search in a list of length n is___________.

A technique for direct search is _______________.

Base address is the address of __________.

A _____________ list is a list where the last node contains null pointer.

___________are used to facilitate the processing of information in an array.

The comparison tree is also called as________.

376.	The memory address of the first element of an array is called_________.
A.	floor address.
B.	foundation address.
C.	first address.
D.	base address.
Answer» D. base address.

377.	Which data structure allows deleting data elements from front and inserting at rear?
A.	Stacks.
B.	Queues.
C.	Dequeues.
D.	Binary search tree.
Answer» B. Queues.

378.	Binary search algorithm cannot be applied to________ concept.
A.	unsorted linked list.
B.	sorted binary trees.
C.	sorted linear array.
D.	pointer array.
Answer» A. unsorted linked list.

379.	Graph traversal is different from a tree traversal, because
A.	trees are not connected.
B.	graphs may have loops.
C.	trees have root.
D.	None is true as tree is a subset of graph.
Answer» C. trees have root.

380.	Linked lists are suitable for which of the following problems?
A.	Insertion sort
B.	Binary search
C.	Radix sort
D.	dequeue.
Answer» B. Binary search

381.	Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________.
A.	Input-restricted dequeue.
B.	Output-restricted dequeue.
C.	Priority queues.
D.	Data structure.
Answer» A. Input-restricted dequeue.

382.	Which of the following data structure is non-linear type?
A.	Strings.
B.	Lists.
C.	Stacks.
D.	Hierarchical.
Answer» D. Hierarchical.

383.	To represent hierarchical relationship between elements, which data structure is suitable?
A.	Dequeue.
B.	Priority.
C.	Tree.
D.	Binary tree.
Answer» C. Tree.

384.	When does the ArrayIndexOutOfBoundsException occur?
A.	Compile-time
B.	Run-time
C.	Not an error
D.	None of the mentioned
Answer» B. Run-time

385.	The depth of a complete binary tree is given by__________.
A.	Dn = n log2n.
B.	Dn = n log2n+1.
C.	Dn = log2n.
D.	Dn = log2n+1.
Answer» D. Dn = log2n+1.