0% found this document useful (0 votes)
22 views2 pages

Apr - May 23

Uploaded by

keerthika.cse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views2 pages

Apr - May 23

Uploaded by

keerthika.cse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Reg. No.

Question P'aper Code :30121

B.E.B.T'ech. DEGREE EXAMINA'TIONS, APRILMAY 2023.


Fourth Semester

Computer Science and Engineering


CS 3401- ALGORITHMS

(Regulations 2021)
Time:Three hours Maximum: 100 marks

Answer ALL questions.


PART A (10 >x 2 = 20 marks)

1. Define time complexity of an algorithm.


algorithms.
2. List the types of asymptotic notations in analysing complexity of
3. Outline a directed graph with an example.
4. What is minimum spanning tree?
5. Outline divide-and conquer algorithm design paradigm.
6. Define a multistage graph.
7. What is backtracking?
8. State the travelling salesman problem.
an intractable
9. Outline the difference between a tractable problem and
problem.
10. State the bin packing problem.
PART B- (5 x 13 = 65 marks)
N' numbers.
11. (a) Write an algorithm to perform Iinear search on an array of the
complexity of
Illustrate the best case, average case and worst case
example. (13)
linear search algorithm with an
Or

What is pattern searching? Outline the steps in the Rabin-Karp


(b) with an example.
algorithm for pattern searching (13)
12. (a) Outline the breadth first search graph traversal algorithm and dont
first search graph traversal algorithm with an example
(13)
Or

(b) Explain the Dijkstra'sshortest path algorithm with an example. (13)

13. (a) Outline the merge sort algorithm with an example.


(13)
Or

(b) What is aHuffman tree? Outline the steps to build a Huffman tree usin.
greedy algorithm design paradigm with an example. (13)
14. (a) State the Hamiltonian circuit problem. Outline the steps to find the
Hamiltonian circuit using backtracking algorithm design paradigm with
an example. (13)
Or

(b) State the Knapsack problem. Outline how Knapsack problem can be
solved using branch and bound algorithm design paradigm with an
example. (13)

15. (a) Elaborate NP-complete problem and NP-hard problem with an example.
(13)
Or
(b) Outine the randomized quick sort algorithm with an example. (13)

PART C-(1x 15 =15 marks)

16. (a) Apply the insertion sort algorithm to sort the following sequence of
n numbers stored in an array A.

15,9, 1,22,26,19,55,43, 99,2


(15)
Illustrate each step of the sorting process.
Or
(b) What is dynamic programming? Explain the dynamic programmin8
solution for matrix chain multiplication with an example. (15)

30121
2

You might also like