DAA Question Bank

Unit 1 : Fundamentals

1. Explain different Characteristics of Algorithm? [4 Marks]

2. Why Correctness of the Algorithm is essential? [4 Marks]
3. Explain iterative Algorithm Design Issues? [4/6 Marks]
4. Explain different means of improving efficiency of Algorithm? [4 Marks]
5. Write short note on Algorithm as a technology? [4 Marks]
6. Write short note on Evolution of algorithm? [4 Marks]
7. What are the general rules followed while writing the algorithm? [4 Marks]
8. How to confirm correctness of algorithm? explain with example? [4 Marks]
9. Explain the concept of PMI and prove the correctness of an algorithm to find factorial of a number using PMI
[6 Marks]
10. Contrast and compare between iterative and recursive process with an example? [4/6 Marks]
11. Explain the importance of algorithm in computing with example? [4 Marks]
12. Explain the various algorithm design methodology to solve a problem? [6 Marks]
13. Explain Big O,Omega and Theta notations?Explain what are they used for? [4/6 Marks]
14. How do we analyze algorithms? Explain what is meant by space and time complexity? [4/6 Marks]
15. Discuss different ways of algorithm design with suitable example? [6 Marks]

Unit 2 : Models and Design

1. Write and explain Huffman Code Generation Algorithm? [4/6 Marks]

2. Give a linear time algorithm for fractional knapsack problem? [4/6 Marks]
3. Solve the following using Huffman's code generation algorithm [4 Marks]

4. Which are the features of Functional model? [4/6 Marks]

5. Explain recursive processes with example. [4 Marks]
6. Explain Tail recursion with suitable example? [4 Marks]
7. Explain the importance of Tail recursion with a suitable example? [4 Marks]
8. Differentiate between O(1) and O(n)? Is algorithm performance depends on input size (True/False) Justify
your answer with suitable example? [6 Marks]
 9. Write an algorithm to check a number is prime or not by using step refinement process, also prove the
correctness of the algorithm? [6 Marks]
10. What is an optimal Huffman code for the following set of frequencies.
a : 1, b:1, c:2, d:3, e:5, f:8,g:13,h : 21 [6 Marks]
11. Write an algorithm for Bubble sort and find its time complexity? [6 Marks]
12. What are the applications of greedy strategy? Explain the concept of optimal solution? [6 Marks]
13. Explain the concept of scheduling algorithm. Calculate the total profit for the following problem using Greedy
approach Tasks given (T1…….T9). Deadline (7, 2, 5, 3, 4, 5, 2, 7, 3) and Profit (15, 20, 30, 18, 18, 10, 23, 16,
25) respectively. [6 Marks]
14. Using Greedy approach for the instances of knapsack of item ,n=3 & capacity ,m=20 and having Profit (P1,
P2, P3) =( 25, 24, 15) & weight (W1, W2, W3) = (18, 15, 10) . Find out the Optimal Solution. [6 Marks]
15. Greedy approach- consider the following instances of knapsack problem n=5, w=100, W (10, 20, 30, 40, 50) ,
V(20, 30, 66, 40, 60 ), find the optimal solution. [6 Marks]

Unit 3 : Abstract Algorithms

1. Explain elements of Dynamic programming. [4 Marks]

2. Explain the Knapsack problem using mathematical notations. Solve the, above Knapsack problem using
Greedy approach. to get optimal solution with maximum profit Items given(I1, I2, I3, I4, I5,) Profit (10, 20,5, 7,
8) Weight (5, 6, 7,8,10) . Max weight = 15. [6 Marks]
3. Design a linear time algorithm for solving fractional Knapsack problem. Prove that the time complexity of
presented algorithm is indeed linear.
4. Find the correct sequence for jobs using following instances,
JobID Deadline Profit
1 4 20
2 1 10
3 1 40
4 1 30 [6 Marks]
5. Explain the concept of control abstraction in Dynamic Programming. What is the use of memorization table.
[6 Marks]
6. Find an optimal solution for following 0/1 knapsack problem using dynamic programming ,Number of objects
n=4, Knapsack capacity M=5, Weights (w1,w2,w3,w4)=(2,3,4,5) & Profit (p1,p2,p3,p4)= (3,4,5,6) [6 Marks]
7. Consider N=3, (w1,w2,w3) = ( 2,3,3), (p1,p2,p3) = (1,2,4) and M = 6. Solve 0/1 Knapsack Problem.
[6 Marks]
8. Write short notes on (Any Two) (each carry equal marks) [4 Marks]
a. Evolutionary Algorithm
b. Genetic Algorithm
c. Artificial Neural Network
9. Write short notes on (Any Two) (each carry equal marks) [4 Marks]
a. Evolutionary Computing
b. Simulated Annealing.
c. Tabu Search.
10. Draw a neat architecture of Artificial Neural Network. Explain the importance of weight, bias and target output.
[4 Marks]
11. Explain Genetic Algorithms with an example. [6 Marks]
12. Solve multiplication using Divide and Conquer strategy 12345678 * 21394276 [6 Marks]
13. Consider the chain matrix A1,A2 & A3 with dimensions given below. Give the optimal parentheses to get the
product.
 Matrix Dimensions
A1 5 X 10
A2 10 X 20
A3 20 X 25
14. Find minimum distance path from vertex 1 to 7 using dijkstra’s algorithm

30
35
25
10 20

12
15
7
20

5
15. Write an algorithm to compute the shortest distance between the source and destination vertices of a
connected graph? Will this algorithm work for negative weights? [6/8 Marks]

Unit 4 :Complexity Theory

1. Prove that vertex cover problem is NP-complete. [6 Marks]

2. Differentiate between (Any Two) (each carry equal marks)
a. deterministic and non deterministic algorithms
b. P class and NP class problem
c. polynomial and non deterministic polynomial [4 Marks]
3. Show that job sequencing problem is NP hard [4/6 Marks]
4. Explain NP and NP-hard problems [4 marks]
5. What is satisfiability problem [2 Marks]
6. What is sat and 3-sat problem ? Prove that 3-sat problem is np complete [6/8 Marks]
7. Define P , NP, NP-hard, NP-complete. [4 Marks]
8. State and explain NP hard (Any Two) (each carry equal marks)
a. Hamilton cycle
b. Scheduling problem [4 Marks]
9. What is NP complete problem? Explain steps to prove that problem is NP-complete. [6 Marks]
10. Explain vertex cover problem with example. [4/6 Marks]
11. Explain polynomial reduction problem. [4 marks]
12. Find the upper and lower bound for quick sort algorithm. [4 Marks]
13. Define Asymptotic Notations? Explain their significance in analyzing algorithms? [6 Marks]
14. Explain deterministic and non-deterministic Algorithms. [4/6 Marks]
15. Explain Class NP-Hard? Differentiate between NP-Hard & NP-Complete algorithms? [6/8 Marks]
Unit 5 : Amortized Analysis

1. What is amortised analysis? List different methods to do the same. [6 Marks]

2. Explain Amortized analysis. Explain Binary heap, Binomial heap and Fibonacci heap [6 Marks]
3. Discuss aggregate method for amortised analysis. [4/6 Marks]
4. Discuss amortised analysis operations on stack and counter. [4 Marks]
5. Do aggregate time complexity analysis for implementing K-bit binary counter. [4/6 Marks]
6. Discuss the accounting method for amortised analysis.Discuss it with operations on stack and counter.
[4/6 Marks]
7. Discuss the potential method for amortised analysis. Discuss it with operations on stack and counter.
[4/6 Marks]
8. Explain binary heap algorithm with its complexity analysis. [4/6 Marks]
9. Explain various heap operations. [4 Marks]
10. Explain Dijkstra’s algorithm with its complexity Dis [4/6 Marks]
11. Write a short note on time-space trade-off. [4 Marks]
12. Write a short note on randomised algorithms. [6 Marks]
13. Write & Explain sorting algorithm for embedded systems and state its time complexity? [6 Marks]
14. What is embedded system? Explain embedded system scheduling algorithms. [4/6 Marks]
15. Write a short note on splay trees. [4/6 Marks]

Unit 6 : Multithreaded and Distributed Algorithms

1. Explain multithreaded algorithms. [4/6 Marks]

2. Analyze multithreaded algorithms with suitable examples? [6 Marks]
3. Write a note on dynamic multithreading. [4 Marks]
4. Explain the performance measures: work, span, speedup, parallelism and slackness. [4/6 Marks]
5. Write the analysis of multithreaded algorithms with an example. [4/6 Marks]
6. Explain the concept of parallel loops. [6/8 Marks]
7. What are race conditions in multithreaded algorithms? Explain in detail. [4/6 Marks]
8. Write and explain the algorithm for multithreaded matrix multiplication. [4/6 Marks]
9. Write and explain the algorithm for multithreaded merge sort. [4/6 Marks]
10. What are distributed algorithms? [4 Marks]
11. Explain distributed breadth first search algorithm for 1D partitioning. [4/6 Marks]
12. Explain distributed breadth first search algorithm for 2D partitioning. [4/6 Marks]
13. Write a short note on distributed breadth first search algorithm? [6 Marks]
14. What is string matching? Explain with example. [4/6 Marks]
15. Write a detailed note on Rabin Karp String matching algorithm and discuss its complexity. [6/8 Marks]