Chapter-1

Basics ofAlgorithms and Mathematics

> Ql)Define algorithm. Discuss key characteristics / properties of algorithms. (M- 3)
>Q2) Explain Quantifiers with it's types. (M- 3)
> Q3) Explain why analysis of algorithms is important? (M- 3)
 Chapter-2
Analysis of Algorithm
> Ql) Explain: Worst Case, Best Case and Average Case Complexity with suitable example. (M- 4)
Q2) Write an algorithm of Selection Sort Method. (M- 3)
> Q3) What is Asymptotic Notations? Explain with it's 3 different types? (M- 4/7)
> Q4) Write & analyze an insertion sort algorithm to arrange n items into ascending order. (M- 7)
Q5) Explain Bubble sort with example. (M- 4) {Otherwise they give you l example}
> Q6) Explain Insertion sort with example. (M- 4) {Otherwise they give you 1 example}
> Q7) Prepared Heapsort, Shell sort, Bucket sort, Radix sort, Counting sort they asked it's
Examples. (M- 4/7)
> Q8) Solve following recurrence relation using iterative method T(n) = T(n - 1) + Iwith T(0) = 0
as initial condition. Also find big oh notation (M- 7)
 Chapter-3
Divide and Conquer Algorithm
>Ql)Explain Merge sort with example. What is time complexity of merge sort in worst case? (M- 7)
(Either u write yours example Or they givenlexample to solved by u}
Q2) Explain Quick sortwith example. Also write Worst and Best case and Average case of quick
sort algorithm. (M- 7) {Either u write yours example Or they given 1 example to solved by u)
Q3) Define: Divide & Conquer Technique. (M- 3)
Q4) Explain Recurrence & it's various methods to solve recurrence. (M- 4/7)
 Chapter-4
Dynamic Programming
> QI)What is Principle of Optimality? Explain its use in Dynamic Programming Method. (M-3)
> Q2)Explain Binomial Coefficient algorithm using dynamic programming. (M- 4)
> Q3)Compare: Dynamic Programming Vs Greedy Algorithms. (M- 3)
ºQ4) Discuss Assembly Line Scheduling problem using dynamic programming with example. (M- 7)
> Q5) Explain 0/1knapsack Problem with appropriate example by using dynamic programming. (M-7)
 Chapter-5
Greedy Algorithm
> Ql)Give the characteristics of Greedy Algorithms. (M- 4)
> Q2) Explain Kruskal's algorithm with example.(M-4/7) (it's possible they asked their own example}
> Q3) Explain Prim's algorithm with example.(M- 4/7) (it's possible they asked their own example}
Q4) Explain Knapsack'sproblem with example.(M- 7) {it's possible they asked their own example}
> Q5) Explain Job Scheduling with example.(M- 7) {it's possible they asked their own example}
> Q6)Explain Huffiman Codes with example.(M- 4/7) {it's possible they asked their own example}
 Chapter-6
Exploring Graphs
>Ql))Define: Articulation Point, Back Edge, Acyclic Directed Graph. (M- 3)
> Q2) Explain in brief Breadth First Search & Depth First Search Traversal techniques of Graph
with example. (M-7)
> Q3) Explain Breath First Traversal Method for Graph with algorithm with example. (M- 7)
> Q4)Compare: DFS Vs BFS. (M- 3/4)
> Q5)Explain Topological sort with example. (M- 4) {OR they give uexample}
 Chapter-7
Backtracking and Branch and Bound
>Ql)Compare: Branch &Bound Vs Backtracking. (M- 4)
> Q2) Explain Backtracking Method. What is N-Queen Problem? Give solution of 4-Queens Problem
ing Backtracking Method. (M- 7)
> Q3) Explain Minimax principal. (M- 4)
> Q4) Prepared Travelling Salesman Problem using Branch & Bound. (They asked Example} (M-4/7)
 Chapter-8
String Matching
> Q1) What is Finite Automata? Explain use of finite automata for string matching with suitable
example. (M- 7)
Q2) What is string-matching problem? Define valid shift and invalid shift. (M- 3)
> Q3) Explain Rabin-Karp algorithm with example. (M- 4/7) {Or theyu example}
 Chapter-9
Introduction to NP-Completeness
>Ql) Explain polynomial reduction. (M- 3)
> Q2) Explain P, NP, NP complete &NP Hard problems. Give examples of each. (M
Q3) Explain P-NP?" problem. (M- 3)
> Q4) Explain Hamiltonian Problem with example. (M- 4)
00:02
Chapter: Basic of Algorith ms &
Mathematics
1. Define the term Algorithm(3 mark)
2. What is Algorithm Strategy? (3 mark)
3. Name five Algorithm Design technique (4 mark)
4. What is Pseudo Code? (3 mark)
5. List out Operations on the Set (3 mark)
6. What is Equivalent Relation (3 mark)
7. What is Vector (3 mark)
8. What is ldentify Matrix (3 mark)
9. What is Linear Equation (3 mark)
00.03
Chapter: Analysis of Algorithm
1. What is Frequency Count (3 mark)
2. What is Best case/Worst Case Complexity (4 mark)
3. What is Asymptotic Notation (3 mark)
4. What is Omega/Big Oh notation represent? (4 mark)
List out Problems which can solve by Algorithm (3 mark)
6. Explain Heap Sort with Example (7 mark)
7. Explains Sorting Algorithm with Examples (7 mark)
8. Write Order of Growth in Asymptotic Notations (3 mark)
00:03
Chapter: Divide & Conquer
1. Explain what is divide &conquer method? (3 mark)
2. What is the basic Problem of Divide &Conquer Algorithm (4
mark)
3. Explain Merge Sort/Quick Sort (4 mark)
Write Algorithm for Matrix Multiplication (7 mark)
How the Binary Search Work (3 mark)
6. Discuss Best, Worst time complexity of Quick Sort (7 mark)
7. Multiply 981 with 1234 with Divide &Conquer Method (4
mark)
00-04
Chapter: Dynamic Programming
1. Define: Principle of Optimality (4 mark)
Describe Assembly Line Scheduling Problem with Example (7
mark)
3. Difference Between Dynamic programming & Divide/
Conquer(4mark)
Explain Matrix Multiplication With Example (4 mark)
5. Discuss 0/1 Knapsack Problem using Dynamic Programming (7
mark)
6. Find Allpair Shortest path with Floyd's Algorithm (4 mark)
7. What is the Complexity of Binomial Coefficient. (3 mark)
 8. State the LCS proDrem(5 marky
9. Solve Example of Assembly line scheduling (4 mark)
10. Solve question of LCS Problem (7 mark)
11. Calculate Binomial Coefficient (4 mark)
00-03
Chapter: Greedy Algorithm
1. Difference between Dynamic Programming & Greedy Algo (4 mark)
2. Minimum Spanning Tree sum (4 mark)
3. What is Feasible/Optimal Solution (4 mark)
4. Solve sum of Prim's/Kruskal's Algorithm (4/7 mark)
5. Write Algorithm of Graph Traversing (4/7 mark)
6. Solve Knapsack Problem with greedy programming (4 mark)
7. Solve job scheduling problem (3 mark)
8. Huffman code problem (4 mark)
9. Explain Dijkstra's Algorithm (7 mark)
(00:11
Chapter: Exploring Graph
1. Traversing a Graph with BSF,DSF (4 mark)
2. Algorithm of BSF,DSF (3 mark)
Define Graph. Describe strongly connected graph (4
mark)
4. Differentiate between BSF,DSF (4 mark)
5. Explain DSF in brief (3 mark)
00:01
Chapter: Exploring Graph
1. Traversing aGraph with BSF,DSF (4 mark)
2. Algorithm of BSE,DSF (3 mark)
3. Define Graph. Describe strongly connected graph (4
mark)
4. Differentiate between BSF,DSF (4 mark)
5. Explain DSF in brief (3 mark)
00.04 Chapter: Backtracking and
Branch& Bound

Explain minimax principle with its use. (3 mark)

2. Discuss 8 queen problem can be solve with backtracking
(7 mark)
3. Explain backtracking with knapsack problem (4 mark)
4. Explain 4 queen problem with one of the solution (4
mark)
5. What is state space tree? (3 mark)
What is advantages of backtracking algorithm (3 mark)
7. Difference between live &dead node? (3 mark)
O0.04
Chapter: String Matching
1. Explain robin-karp string matching problem also give the
algorithm (7 mark)
2. Explain string matching with finite automata (4 mark)
3. What is finite automata (3 mark)
Write naive string matching algorithm (3 mar
5. Name few string matching algorithm (4 mark)

Like. Comment Sharo

(00-06 Chapter: Introduction to NP
Completeness
1. Explain P and NP problem (4 mark)
2. Define P,NP,NP complete (4 mark)
3. Explain polynomial reduction (3 mark)
4. What is polynomially Turing reducible problem (3 mark)
5. Explain Brief:NP Hard problem (4 mark)
6. Explain travelling salesmen problem with example (7
mark)