SRI RAAJA RAAJAN COLLEGE OF ENGINEERING & TECHNOLOGY

Amaravathipudur Post, Karaikudi Tk

MODEL1 EXAM – MAY 2024

Reg. No: Yr/Sem/Dept: II/IV/CSE Date:

CS3401 ALGORITHM 100 Marks

Answer ALL Questions

PART A – (10*2 = 20 Marks)

1. Outline divide and conquer algorithm design paradigm
2. Define a multistage graph.(AU-APR/MAY2023)
3. What is meant by principles of optimality?
4. What are the elements of dynamic Programming?
5. What is backtracking?
6. Write a recurrence equation for divide and conquer algorithm.
7. Give some of the difference between divide and conquer and dynamic programming
8. List some application of greedy method.
9. What is feasible solution?.
10. What is optimal solution?\

PART B – (5*13 = 65 Marks)

11.a)writea an algorithm for divide and conquer strategy

ii) find the maximum and minimum element from the given set of elements using divide and conquer strategy.-50,40,-5,-9,45,90,65,25,75
(or)
b)Explain quick sort with suitable example.

12 a)Explain merge sort with suitable example .(AU-NOV/DEC2023)

(or)
b)Explain the dynamic programming approach of matrix chain multiplication with suitable example.(AU-NOV/DEC2023)

13a)Describe multistage graph with suitable example.

(or)
b)what is optimal binary search tree?Explain optimal binary search tree with suitable example.

14a)What is meant by activity selection problem?Explain

(or)
b)i)What is optimal merge pattern ? Explain with suitable example..

15.a)What is Huffman tree?Explain with suitable example. .(AU-APR/MAY2023)

(or)
b)Explain in detail Hamiltonian circuit problem with suitable example.(AU-APR/MAY2023)
Part-C(1X15=15Marks)

15 a)i)Explain n –queens problem with suitable example.

(or)
b)State the knapsack problem. Outline how knapsack problem with suitable example(AU-APR/MAY2023)

Prepared by Approved by : D.Sujatha AP/CSE