Scribd
Upload
68 views2 pages

ADA Question Bank

This document outlines assignments for an algorithms analysis course. It includes 14 questions on topics like relations and functions, algorithm properties, complexity analysis, sorting algorithms, and dynamic programming. It also includes 16 questions on dynamic programming techniques like knapsack problem, matrix chain multiplication and longest common subsequence. Finally, it contains 9 questions on NP-complete problems, string matching algorithms, graph algorithms and the traveling salesman problem. Students are asked to explain algorithms, analyze time and space complexity, provide examples, and discuss algorithm techniques.

Uploaded by

Shyam Bihade
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
68 views2 pages

ADA Question Bank

This document outlines assignments for an algorithms analysis course. It includes 14 questions on topics like relations and functions, algorithm properties, complexity analysis, sorting algorithms, and dynamic programming. It also includes 16 questions on dynamic programming techniques like knapsack problem, matrix chain multiplication and longest common subsequence. Finally, it contains 9 questions on NP-complete problems, string matching algorithms, graph algorithms and the traveling salesman problem. Students are asked to explain algorithms, analyze time and space complexity, provide examples, and discuss algorithm techniques.

Uploaded by

Shyam Bihade
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
You are on page 1/ 2

Subject name: Analysis and Design of Algorithms (3150703)

Assignment 1 (1,2 &3 Unit)

1. Explain Relation and Function with Types of Relation. and Types of Function.
2. What is an algorithm? Explain the Properties Algorithm and
How it differ from flowchart?
3. Define Algorithm, Time Complexity and Space Complexity with Asymptotic notation.
4. What do you mean by Divide & Conquer approach? List advantages and disadvantages
of it. And Write Merge sort algorithm with Example
5. Why Analysis of Algorithm are required and explain different approaches for
analyse an algorithm and also Explain recursion Method.
6. Explain Insertion Sort Algorithm with Example.
7. Explain Bubble Sort Algorithm with Example.
8. Explain Quicksort Algorithm with Example.
9. Explain Selection Sort Algorithm with Example.
10. Explain Counting sort, Shell sort with Example.
11. Explain Bucket sort and Radix Sort with Example.
12. Explain Heap Sort, with time complexity.
13. Explain the use of Divide and Conquer Technique for Binary Search Method. What is
the complexity of Binary Search Method? Explain it with example
14. Explain Quick sort with Example.

Assignment 2 (4, 5 &6 Unit)

1. Explain Knapsack problem for Dynamic Programming


2. Explain General Characteristics of Dynamic algorithms and Explain principle of
Optimal Solution
3. Explain Assembly Line-Scheduling with Example.
4. Explain Longest Common Subsequence with Example.
5. Explain Matrix chain multiplication for Dynamic Programming
6. Explain Coin Change problem using Dynamic.
7. Explain All Pair Shortest Path Problem with Example.
8. Explain Binomial Coefficient with Example using Dynamic.
9. Explain General Characteristics of greedy algorithms and difference between Greedy
Algorithm and Dynamic Programming
10. Explain Kruskal’s and Prim’s algorithm with Example.
11. Explain Job Scheduling Problem for Greedy Algorithm
12. Explain Huffman code with Example.
13. The Knapsack Problem for Greedy Algorithm
14. Explain Single Source Shortest path Problem with Example( dijkstra algorithm and
bellman ford algorithm)
15. Define Graph and Discuss Undirected Graph, Directed Graph. Also Explain
Topological sort
16. What is difference between DFS & BFS. Explain with Example

Assignment 3 (7, 8 &9 Unit)

1. Explain The n queen’s problem with Example.


2. Explain Travelling Salesman problem
3. Explain The naive string matching algorithm with Example
4. Discuss The Rabin-Karp algorithm with Example
5. Discuss The Knuth-Morris-Pratt algorithm with Example
6. Explain string matching with finite automata.
7. Define the class P and NP and Explain Polynomial reduction
8. Explain NP- Completeness Problem, NP-Hard Problems.
9. Discuss Hamiltonian problem.

You might also like