Design & Analysis of Algorithms MCQ (Multiple Choice Questions)

Our 1000+ multiple choice questions and answers (MCQs) on "Data Structure - II (Algorithms)" (along with 1000+ MCQs on "Data Structure - I") focuses on all chapters of Data Structure covering 200+ topics. One can read MCQs on Data Structure - I here. You should practice these MCQs for 1 hour daily for 2-3 months. This way of systematic learning will prepare you easily for Data Structure - II (Algorithms) exams, contests, online tests, quizzes, MCQ-tests, viva-voce, interviews, and certifications.

Data Structure - II Multiple Choice Questions Highlights

- 1000+ Multiple Choice Questions & Answers (MCQs) in Data Structure - II with a detailed explanation of every question.
- These MCQs cover theoretical concepts, true-false(T/F) statements, fill-in-the-blanks and match the following style statements.
- These MCQs also cover lots of code, code snippets and/or complete programs.
- These MCQs are organized chapterwise and each Chapter is futher organized topicwise.
- Every MCQ set focuses on a specific topic of a given Chapter in Data Structure - II Subject.

Who should Practice Data Structure - II MCQs?

– Students who are preparing for college tests and exams such as mid-term tests and semester tests on Data Structure - II.
- Students who are preparing for Online/Offline Tests/Contests in Data Structure - II.
– Students who wish to sharpen their knowledge of Data Structure Subject.
- Anyone preparing for Aptitude test in Data Structure.
- Anyone preparing for interviews (campus/off-campus interviews, walk-in interview and company interviews).
- Anyone preparing for entrance examinations and other competitive examinations.
- All - Experienced, Freshers and College / School Students.

Data Structure - II Chapters

Here's the list of chapters on the "Data Structure - II" subject covering 100+ topics. You can practice the MCQs chapter by chapter starting from the 1st chapter or you can jump to any chapter of your choice.

1. Searching

The section contains multiple choice questions and answers on linear and binary search iteratives, linear search recursive, jump search, exponential search, uniform binary search and fibonacci search, interpolation and substring searching algorithms.

Searching Linear Search Iterative Linear Search Recursive Binary Search Iterative Uniform Binary Search

Jump Search Fibonacci Search Exponential Search Interpolation Searching Algorithm Substring Searching Algorithm

2. Sorting

The section contains questions and answers on sorting techniques like selection sort, bubble sort, merge sort, pancake sort, insertion sort, quicksort, shellsort, heapsort, introsort, timsort, binary tree sort, comb sort, cube sort, cycle sort, library sort, strand sort, cpcktail sort, gnome sort, pigeonhole sort, bogosort, bucket sort, bead sort, stooge sort, recursive bubble sort, tree sort, binary and recursive insertion sort, sleep sort, lsd and msd radix sort, inplace merge sort, bottom-up mergesort, counting sort, odd even and permutation sort.

Sorting Insertion Sort – 1 Insertion Sort – 2 Selection Sort Bubble Sort Merge Sort In-place Merge Sort Bottom-Up Mergesort Quicksort – 1 Quicksort – 2 Quicksort – 3 Quicksort using Random Sampling Quicksort using Median-of-Three Partitioning Shell Sort – 1 Shell Sort – 2 Heapsort – 1 Heapsort – 2 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

The sections contains MCQs on rabin-karp and quick search algorithms.

Rabin-Karp Algorithm

Quick Search Algorithm

4. Number Theory

The section contains multiple choice questions and answers on euclids algorithm, strassens algorithm, permutations and combinations generation, partitions and subsets generation, inclusion and exclusion principles.

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

The sections contains questions and answers on line point distance, cross product, closest pair problem, quickhull and chan’s algorithm.

Line Point Distance Closest Pair Problem Cross Product

Quickhull Chan’s Algorithm

6. Graph Search

The sections contains MCQs on depth first search, non recursive dfs, branch and bound, breadth first search and best first search.

Depth First Search Non-recursive Depth First Search Breadth First Search

Best First Search Branch and Bound

7. Minimum Spanning Tree

The section contains multiple choice questions and answers on minimum spanning tree, kruskal’s and prim’s algorithm.

Minimum Spanning Tree Kruskal’s Algorithm

Prim’s Algorithm

8. Shortest Path

The section contains questions and answers on dijkstra’s algorithm, bellman ford and floyd warshall algorithms.

Shortest Paths Dijkstra’s Algorithm

Bellman-Ford Algorithm Floyd-Warshall Algorithm

9. Flow Networks

The sections contains MCQs on maximum flow problem.

Maximum Flow Problem

10. Matching

The section contains multiple choice questions and answers on stable marriage problem and maximum bipartite matching.

Matching Stable Marriage Problem

Maximum Bipartite Matching

11. Minimum Cut

The sections contains questions and answers on minimum cut.

Cut Vertices Minimum Cut

Karger’s Algorithm

12. Graph Coloring

The sections contains MCQs on chromatic number, vertex and edge coloring.

Vertex Coloring Chromatic Number

Edge Coloring Edge Coloring – 2

13. Bipartite Graphs & Eulerian Tour

The section contains multiple choice questions and answers on complete bipartite graph, bipartite graphs and its properties.

Bipartite Graph Properties of Bipartite Graphs Complete Bipartite Graph

Eulerian Tour Fleury’s Algorithm

14. Recursion

The section contains questions and answers on recursion, factorial using recursion, fibonacci using recursion, sting reversal using recursion, matrix multiplication, gcd and lcm using recursion, decimal to binary conversions, length of a string, array, linked list using recursion, recursive selection sort, master’s theorem, searching element in array and linkedlist by using recursion.

Recursion Factorial using Recursion Fibonacci using Recursion Catalan Numbers Sum of n Natural Numbers using Recursion GCD and LCM using Recursion – 1 GCD and LCM using Recursion – 2 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 – 1 Search an Element in an Array using Recursion – 2 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 – 1 Master’s Theorem – 2

15. Greedy Algorithms

The sections contains MCQs on fractional knapsack problem, activity selection problem and huffman code.

Greedy Algorithms Fractional Knapsack Problem

Activity Selection Problem Huffman Code

16. Backtracking

The section contains multiple choice questions and answers on backtracking, eight queens and n queens problem.

Backtracking Eight Queens Problem

N Queens Problem

17. Dynamic Programming

The sections contains questions and answers on dynamic programming, fibonacci using dynamic programming, coin change problem, kadane algorithm, longest increasing subsequence, rod cutting, minimum no of jumps, 0/1 knapsack problem, matrix chain multiplication, longest common subsequence, edit distance problem, wagner-fischer algorithm, balanced partition, dice throw problem and counting boolean parenthesizations.

Dynamic Programming Fibonacci using Dynamic Programming Coin Change Problem Maximum Sum of Continuous Subarray – 1 Maximum Sum of Continuous Subarray – 2 Kadane’s Algorithm Longest Increasing Subsequence Rod Cutting Minimum Number of Jumps 0/1 Knapsack Problem Matrix-chain Multiplication

Longest Common Subsequence Longest Palindromic Subsequence Edit Distance Problem Wagner-Fischer Algorithm Catalan Number using Dynamic Programming Assembly Line Scheduling Minimum Insertions to form a Palindrome Maximum Sum Rectangle in a 2D Matrix Balanced Partition Dice Throw Problem Counting Boolean Parenthesizations

18. Cryptography

The sections contains MCQs on monoalphabetic cipher, morse code, polyalphabetic and vigenere cipher, transposition and columnar transposition, pigpen cipher, atbash and gronsfeld cipher, beaufort cipher, autokey and playfair cipher, hill cipher, railfence and route cipher, trithemius cipher, polybius square, running key cipher, bifid and affine cipher.

Monoalphabetic Cipher Polyalphabetic Cipher Transposition Pigpen Cipher Vigenère Cipher Atbash Cipher Gronsfeld Cipher Beaufort Cipher Autokey Cipher Playfair Cipher Hill Cipher

Rail Fence Cipher Route Cipher Trithemius Cipher Polybius Square Running Key Cipher Bifid Cipher Morse Code – 1 Morse Code – 2 Columnar Transposition Affine Cipher Coalesced Hashing

19. Checksum, Complexity Classes & NP Complete Problems

The section contains multiple choice questions and answers on hamming code, hamiltonian path problem, subset sum and set partition problems, p, np, np-hard and np-complete complexity classes.

Hamming Code P, NP, NP-hard, NP-complete Complexity Classes Hamiltonian Path Problem Subset Sum Problem

Vertex Cover Problem Independent Set Problem Dominating Set Problem Set Partition Problem

20. Page Replacement Algorithms

The section contains questions and answers on optimal page replacement and first in first out algorithm.

Optimal Page Replacement Algorithm Not Recently Used Algorithm (NRU) First-in, First-out Algorithm (FIFO)

Least Recently Used Algorithm (LRU) Random Page Replacement Algorithm

21. Miscellaneous

The sections contains MCQs on topological sorting, quickselect, coordinate compression and square root decomposition.

Topological Sorting Flooding Algorithm Quickselect

Co-ordinate Compression Square Root Decomposition

If you would like to learn "Design and Analysis of Algorithms" thoroughly, you should attempt to work on the complete set of 1000+ MCQs - multiple choice questions and answers mentioned above. It will immensely help anyone trying to crack an exam or an interview.

Wish you the best in your endeavor to learn and master Design and Analysis of Algorithms!