Here, we have compiled 1,000 multiple-choice questions (MCQs) with answers on Data Structures and Algorithms-2 (Design & Analysis of Algorithms), 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 2. Sorting 3. String Matching 4. Number Theory 5. Computational Geometry 6. Graph Search 7. Minimum Spanning Tree 8. Shortest Path 9. Flow Networks 10. Matching 11. Minimum Cut 12. Graph Coloring 13. Bipartite Graphs & Eulerian Tour 14. Recursion 15. Greedy Algorithms 16. Backtracking 17. Dynamic Programming Dynamic Programming Fibonacci using Dynamic Programming Coin Change Problem Maximum Sum of Continuous Subarray 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 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 Columnar Transposition Affine Cipher Coalesced Hashing
19. Checksum, Complexity Classes and NP Complete Problems 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 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 Topological Sorting Flooding Algorithm Quickselect Co-ordinate Compression Square Root Decomposition
