Scribd
Upload
15 views1 page

Algorithms Set 2

This document outlines the exam structure for the Algorithms course at C. Abdul Hakeem College of Engineering and Technology for the academic year 2024-2025. It includes details on the questions divided into three parts, covering topics such as algorithm complexity, graph theory, and specific algorithms like Binary Search and Bellman Ford. The document also lists course outcomes related to analyzing and applying graph algorithms.

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
15 views1 page

Algorithms Set 2

This document outlines the exam structure for the Algorithms course at C. Abdul Hakeem College of Engineering and Technology for the academic year 2024-2025. It includes details on the questions divided into three parts, covering topics such as algorithm complexity, graph theory, and specific algorithms like Binary Search and Bellman Ford. The document also lists course outcomes related to analyzing and applying graph algorithms.

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/ 1

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-2


Part A (5 x 2 = 10)
Q. RBT
Questions CO
No. Level
1. State how the running time of an algorithm is measured. 1 1
2. What is Recurrence Relation? List out the four methods for solving Recurrence. 1 1
3. What are the Time and Space Complexity of Insertion Sort? 1 1
4. Define Bipartite Graph. 2 1
5. What is Minimum Spanning Tree? 2 1
Part B (2 x 13 = 26)
Q. RBT
Questions COs
No. Level
Write an algorithm to perform Binary Search on an array of ‘N’ numbers. Illustrate
6. a) the Best case , Average case and Worst case Complexity of the Binary Search 1 3,4
algorithm with an example.
OR
Discuss the working of Knuth-Morris-Pratt algorithm with T=ababcabcabababd
6. b) 1 3,4
and P=ababd. Analyse the time complexity.
Outline the Breadth first search graph traversal algorithm and depth first search
7. a) 2 3,4
graph traversal algorithm and find the time complexity.
OR
7. b) Explain in detail about Bellman Ford Algorithm with an example. 2 2,3
Part C (1 x 14 = 14)
Q. RBT
Questions COs
No. Level
Write the Asymptotic notations used for Best case ,average case and worst case
analysis of algorithms.Also write an algorithm for finding maximum elements of an
8. a) 1 4,5
array and perform best ,worst and average case complexity with appropriate order
notations
OR
What is Heap Sort? Explain its algorithm.Sort the array in ascending order using
8. b) 2 3,4
using Heap sort with suitable example and also 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

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy