Scribd
Upload
3 views2 pages

Algorithms Set 1

Uploaded by

revathipugazhe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
3 views2 pages

Algorithms Set 1

Uploaded by

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

C.

Abdul Hakeem College of Engineering and Technology


Degree/Branch: BE/CSE Regulation: 2021
Academic Year: 2024-2025 Year / Sem / Sec:II/IV/A&B Date: 25-03-2025
Sub Code & Name: CS3401 & Algorithms Exam: CAT-I Marks: 50

Answer All the Questions SET-1


Part A (5 x 2 = 10)
Q. RBT
Questions CO
No. Level
1. List out the properties of Asymptotic Notations. 1 1
2. Define Time complexity of an algorithm. 1 1
3. Write an algorithm for Naïve String matching. 1 2
4. Differentiate DFS and BFS with examples. 2 4
5. What is Articulation Point? 2 1
Part B (2 x 13 = 26)
Q. RBT
Questions COs
No. Level
Write an algorithm to perform Insertion Sort on an array of ‘N’ numbers. Illustrate
6. a) the Best case , Average case and Worst case Complexity of the Insertion Sort 1 3,4
algorithm with an example.
OR
What is Pattern Search?Outline the steps in the Robin-Karp algorithm for Pattern
6. b) 1 3,4
Searching with an example.Find the time complexity.
Discuss about the algorithm to find the minimum spanning tree using Prim’s
algorithm for the graph shown below.

7. a) 2 3

OR
Solve all pair shortest path problem using Floyd’s algorithm for given graph.

7. b) 2 3
C. Abdul Hakeem College of Engineering and Technology
Degree/Branch: BE/CSE Regulation: 2021
Academic Year: 2024-2025 Year / Sem / Sec:II/IV/A&B Date: 25-03-2025
Sub Code & Name: CS3401 & Algorithms Exam: CAT-I Marks: 50

Part C (1 x 14 = 14)
Q. RBT
Questions COs
No. Level
Write an algorithm to perform Linear Search and Interpolation Search on array of
8. a) ‘N’ numbers. Illustrate the Best case , Average case and Worst case Complexity of 1 3,4
the these algorithms with examples.
OR
Outline the Breadth first search graph traversal algorithm and depth first search
8. b) 2 3,4
graph traversal algorithm and find the time complexity.
Level: Revised Bloom’s Taxonomy -Level No: 1-6
Level 1: Remember Level 2: Understand Level 3: Apply Level 4: Analyze Level 5: Evaluate Level 6: Create

OUTCOMES: At the end of the course the students would be able to


CO1 Analyze the efficiency of algorithms using various frameworks
CO2 Apply graph algorithms to solve problems and analyze their efficiency.

Course Handler Program Coordinator/QRC HOD/CSE

You might also like