Data Structure and Algorithms 2 MCQs Practice Tests

Here, we have compiled 1,000 multiple-choice questions (MCQs) with answers on Data Structures and Algorithms-2, covering 100 key topics. Our subject matter experts have hand-picked important and frequently asked questions from various past exams, test papers, and interviews. These practice tests are designed to help you prepare for competitive exams, job assessments, online tests, quizzes, interviews, and certifications, so you can achieve high scores.

1. Searching

Searching
Linear Search Iterative
Linear Search Recursive
Binary Search Iterative
Jump Search
Exponential Search
Interpolation Searching Algorithm
Substring Searching Algorithm

2. Sorting

Sorting
Insertion Sort
Selection Sort
Bubble Sort
Merge Sort
In-place Merge Sort
Bottom-Up Mergesort
Quick Sort
Quicksort using Random Sampling
Quicksort using Median-of-Three Partitioning
Shell Sort
Heap Sort
Introsort
Timsort
Cubesort
Binary Tree Sort
Cycle Sort
Library Sort
Strand Sort
Cocktail Sort
Comb Sort
Gnome Sort
Bogosort
Sleep Sort
Pigeonhole Sort
LSD Radix Sort
MSD Radix Sort
Counting Sort
Bucket Sort (Uniform Keys)
Bead Sort
Pancake Sort
Odd-Even Sort
Stooge Sort
Permutation Sort
Recursive Bubble Sort
Binary Insertion Sort
Recursive Insertion Sort
Tree Sort

3. String Matching

Rabin-Karp Algorithm
Quick Search Algorithm

4. Number Theory

Euclid’s Algorithm
Euler’s Totient Function
Strassen’s Algorithm
Pseudorandom Number Generators
Generating Permutations
Generating Combinations
Generating Partitions
Generating Subsets
Floyd’s cycle-finding Algorithm
Inclusion-Exclusion Principle

5. Computational Geometry

Line Point Distance
Closest Pair Problem
Cross Product
Quickhull
Chan’s Algorithm

6. Graph Search

Depth First Search
Breadth First Search
Best First Search
Branch and Bound

7. Minimum Spanning Tree

Minimum Spanning Tree
Kruskal’s Algorithm
Prim’s Algorithm

8. Shortest Path

Shortest Paths
Dijkstra’s Algorithm
Bellman-Ford Algorithm
Floyd-Warshall Algorithm

9. Flow Networks

Maximum Flow Problem

10. Matching

Matching
Stable Marriage Problem
Maximum Bipartite Matching

11. Minimum Cut

Cut Vertices
Minimum Cut
Karger’s Algorithm

12. Graph Coloring

Vertex Coloring
Chromatic Number
Edge Coloring

13. Bipartite Graphs & Eulerian Tour

Bipartite Graph
Properties of Bipartite Graphs
Complete Bipartite Graph
Eulerian Tour
Fleury’s Algorithm

14. Recursion

Recursion
Factorial using Recursion
Fibonacci using Recursion
Catalan Numbers
Sum of n Natural Numbers using Recursion
GCD and LCM using Recursion
Sum of Digits of a Number using Recursion
String Reversal using Recursion
Decimal to Binary Conversion using Recursion
Length of a Linked List using Recursion
Length of a String using Recursion
Matrix Multiplication using Recursion
Stack Reversal using Recursion
Recursive Selection Sort
Largest and Smallest Number in an Array using Recursion
Largest and Smallest Number in a Linked List using Recursion
Search an Element in an Array using Recursion
Search an Element in a Linked List using Recursion
Power of a Number using Recursion in Logn Time
Towers of Hanoi using Recursion
Master’s Theorem