SRI RAAJA RAAJAN COLLEGE OF ENGINEERING & TECHNOLOGY

Amaravathipudur Post, Karaikudi Tk

MODEL2 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. What is travelling salesman problem? Give an example..(AU-APR/MAY2023)
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. Differentiate tractable and intractable problems.
7. State the bin packing problem..(AU-APR/MAY2023)
8. Define NP hard and NP completeness.
9. Outline the directed graph with suitable exampe
10. What is minimum spanning tree?

PART B – (5*13 = 65 Marks)

11.a)Write an algorithm to perform linear and binary search with suitable example
(or)
b)What is Asymptotic notation?what are the various notations of asymptotic notation?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)Explain Dijkstras shortest path algorithm with an example.

(or)
b)Outline randomized quick sort algorithm with an 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)Describe the backtracking solution to solve 8 queens problem.

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

Prepared by Approved by : D.Sujatha AP/CSE