Scribd
Upload
11 views2 pages

Algorithm Important Questions

The document outlines important sessional questions related to algorithms, divided into three modules: Algorithm Development, Algorithm Design Techniques, and String Matching Algorithms. Each module includes short and long questions covering key concepts such as time complexity, various algorithm design strategies, and specific algorithms like Binary Search and KMP. Additionally, it highlights super important topics that are frequently asked in exams.

Uploaded by

mokaif2439
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

Algorithm Important Questions

The document outlines important sessional questions related to algorithms, divided into three modules: Algorithm Development, Algorithm Design Techniques, and String Matching Algorithms. Each module includes short and long questions covering key concepts such as time complexity, various algorithm design strategies, and specific algorithms like Binary Search and KMP. Additionally, it highlights super important topics that are frequently asked in exams.

Uploaded by

mokaif2439
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Important Sessional Questions – Algorithm

Modules (1 to 3)

Module 1 – Algorithm Development (4 Hours)

Short Questions:
1. Define an algorithm. What are the main characteristics of a good algorithm?
2. What are the different stages of algorithm development?
3. Differentiate between algorithm, pseudocode, and flowchart.
4. What is time complexity? Give an example.
5. What is space complexity?

Long Questions:
6. Explain the stages of algorithm development for solving a problem with a suitable example.
7. Prove the correctness of the Binary Search algorithm.
8. Explain the steps involved in designing an algorithm for sorting an array.
9. What are the advantages of algorithm analysis?
10. Write pseudocode for finding the largest element in an array and analyze its time complexity.

Module 2 – Algorithm Design Techniques (10 Hours)

A. Brute Force Techniques


1. Explain the brute-force solution for the Travelling Salesman Problem (TSP).
2. Write an algorithm for simple matrix multiplication.

B. Divide and Conquer


3. Explain the Divide and Conquer strategy. Give two examples.
4. Find the maximum and minimum element in an array using Divide and Conquer.
5. Explain Strassen’s matrix multiplication algorithm.

C. Greedy Techniques
6. What is the greedy approach?
7. Explain the Fractional Knapsack Problem with example.
8. Construct Huffman Codes for the following set of characters and frequencies: {A:10, B:15, C:30,
D:16, E:29}.

D. Dynamic Programming
9. What is dynamic programming? How does it differ from divide and conquer?
10. Explain the 0/1 Knapsack problem using dynamic programming.
11. Write the algorithm for Matrix Chain Multiplication.
12. Explain the Longest Common Subsequence (LCS) problem with example.

E. Backtracking
13. What is backtracking?
14. Solve the N-Queens problem for N = 4.
15. Explain the Knight’s Tour problem and its approach.
16. How can backtracking be applied to solve the Travelling Salesman Problem?

Module 3 – String Matching Algorithms (5 Hours)


Short Questions:
1. Define string matching.
2. What is the difference between pattern and text in string matching?
3. What are the limitations of the Naïve string matching algorithm?

Long Questions:
4. Explain the Naïve String Matching Algorithm with an example.
5. Explain the Rabin–Karp Algorithm. How does hashing help in this algorithm?
6. Explain the Knuth–Morris–Pratt (KMP) algorithm with example.
7. Compare Naïve, KMP, and Rabin–Karp algorithms in terms of time complexity.

Super Important (Most Asked in Exams):

1. Stages of algorithm development


2. Proof of correctness of Binary Search
3. Strassen’s Algorithm
4. Huffman Coding
5. Fractional & 0/1 Knapsack
6. N-Queens Problem
7. Matrix Chain Multiplication
8. KMP Algorithm

You might also like