YESHWANTRAO CHAVAN COLLEGE OF ENGINEERING, NAGPUR DEPARTMENT OF COMPUTER TECHNOLOGY . Design and Analysis of Algorithms Unit I Q.

1 What is asymptotic analysis? Explain the various asymptotic notations with examples. Q.2 What is amortized analysis? State the various methods for amortized analysis. Explain any one of them. Q.3 Explain the various methods (any two) of solving recurrences with examples.

Q.1 What is greedy strategy of problem solving. Explain the modus operandi of greedy strategy. Q.2 Give and explain Kruskals algorithm (and its analysis) with example. Q.3 Give and explain Dijakstras algorithm (and its analysis) with example. Q.4 Give and explain Job scheduling algorithm with example Unit II Q.1 Give the general template of divide and conquer strategy. Q.2 Explain the analysis of divide-and-conquer algorithms in general. Q.3 Give and explain Merge sort algorithm (and its analysis) with example. Q.4 Give and explain Heapsort algorithm (and its analysis) with example. Q.5 What is lower bound for comparison based sorting. Substantiate your answer/statement by giving formal proof for the same. Q.6 Give and explain Binary search algorithm (and its analysis) with example. Q.7 Give and explain Strassens algorithm (and its analysis) with example. Q.8 What are the drawbacks of Strassens algorithm (if any)? Q.9 Use Strassens algorithm to compute the matrix product 2 3 6 9 9 5 7 11 5 7 4 5

13

15

Q.10 Write a detail not on Exponentiation and its application in cryptography with reference to following points: i) Modular exponentiation (algorithm and analysis) ii) Application of modular exponentiation

Q.1 Give the general template of dynamic programming strategy. Q.2 State the similarities and differences between dynamic programming and divide-and-conquer strategy. Q.3 Give and explain All-pairs shortest paths (Floyd-Warshall) algorithm (and its analysis) with example. Q.4 Give and explain 0-1 Knapsack (and its analysis) with example. Q.5 Give and explain Matrix-chain multiplication algorithm (and its analysis) with example. Q.6 State the similarities and differences between bottom-up dynamic-programming algorithm and top-down memoized algorithm. Unit III Q.1 What is linear programming ? Explain how a graphical solution to linear programming problem can be found? Q.2 . A store sells three brands of of stereo systems, brands A, B, and C. It can sell a total of 100 stereo systems per month. Brands A, B, and C take up, respectively, 5, 4, and 4 cubic feet of warehouse space and a maximum of 480 cubic feet of warehouse space is available. Brands A, B, and C generate sales commissions of $40, $20, and $30, respectively, and $3200 is available to pay the sales commissions. The profit generated from the sale of each brand is $70, $210, and $140, respectively. How many of each brand of stereo system should be sold to maximize profit? Q.3. A school is preparing a trip for 400 students. The company who is providing the transportation has 10 buses of 50 seats each and 8 buses of 40 seats, but only has 9

drivers available. The rental cost for a large bus is $800 and $600 for the small bus. Calculate how many buses of each type should be used for the trip for the least possible cost. Q. 4. A transport company has two types of trucks, T ype A and Type B. Type A has a refrigerated capacity of 20 m 3 and a non-refrigerated capacity of 40 m 3 while Type B has the same overall volume with equal sections for refrigerated and non-refrigerated stock. A grocer needs to hire trucks for the transport of 3,000 m 3 of refrigerated stock and 4,000 m 3 of non-refrigerated stock. The cost per kilometer of a Type A is $30, and $40 for Type B. How many trucks of each type should the grocer rent to achieve the minimum total cost? Q.5. What is linear programming problem? Explain the

simplex method to solve linear programming problem.

Unit IV Q.1 Give the salient features of randomized (probabilistic algorithms). Explain the need for these types of algorithms. Q.2 What are the various classes of randomized (probabilistic algorithms)? Explain each class in detail with an example. Unit V Q.1 What is parallel algorithm? Give an example. Q.2 Give and explain Shortest paths algorithm (and its analysis) with example. Q.3 Give and explain Parallel evaluation of expressions algorithm (and its analysis) with example. Q.4 Explain parallel sorting networks in detail w.r.t. the following points: i) The zero-one principle ii) Parallel merging networks iii) Improved sorting networks. Q.5 State zero-one principle for sorting networks. Give the proof for this principle. Q.6 What is the output of the following sorting network?

12

7 2 3 2
1 2 1 2 1 2

9 2
1 2 1 2 1 2

Q.7 What is primality testing? Test the primality of integer 123. Q.8 Consider eight key values 34 27 85 55 21 44 75 65 Draw insertion sorting network for the above. Q.9 State and prove a zero-one principle for merging networks. Q.10 Write a short note on distributed computation. Unit VI Q.1 Q.2 Q.3 Q,4 Q.5 Q.6 Q.7 Q.8 Q.9 What is linear reduction? What is polynomial reduction? Explain the classes P and NP. Explain NP-complete problems. Explain NP-hard problems. What are nondeterministic algorithms? Illustrate the relationships between various classes. Prove the following theorem: HAM p T HAMD Prove the following theorem: HAMD p m TSPD

Q. 10 Prove the following theorem: SAT is NP-complete. (Cooks theorem) Q.11 Prove the following theorem: SAT-3-CNF is NP-complete.

Q.1 What are heuristic algorithms. Q.2 Give and explain heuristic algorithm with an example. Q.3 Give a heuristic algorithm for graph coloring. Q.4 Prove the following theorem: HAMD p T rel-TSP for any positive constant . Q.5 Prove the following theorem: MSTP p T c abs - MTSP for any positive constant c. Q.6 What are approximate algorithms? Q.7 Give and explain approximate algorithm with an example.