Scribd
Upload
2 views

set a algo

The document outlines the model examination details for the CS3401 - Algorithm course at Madha Engineering College, scheduled for March 2025. It includes course objectives, outcomes mapped to Bloom's Taxonomy, and examination structure with specific questions for Parts A, B, and C. The examination covers topics such as algorithm analysis, graph algorithms, and various algorithm design techniques.

Uploaded by

kalai mugill
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

set a algo

The document outlines the model examination details for the CS3401 - Algorithm course at Madha Engineering College, scheduled for March 2025. It includes course objectives, outcomes mapped to Bloom's Taxonomy, and examination structure with specific questions for Parts A, B, and C. The examination covers topics such as algorithm analysis, graph algorithms, and various algorithm design techniques.

Uploaded by

kalai mugill
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

BReg. No.

Madha Engineering College


Madha Nagar, Kundrathur, Chennai– 600 069.
Model Examination March 2025
Date / Time 05-03-2025 Max. Marks 50 Marks
Subject with Code CS3401- Algorithm Time 11/2 Hours
Branch Computer Science & Engineering Year/Semester II / 04

Course Objectives
The student should be made
1 To understand and apply the algorithm analysis techniques on searching and sorting algorithm.
2 To critically analyze the efficiency of graph algorithms.
3 To understand different algorithm design techniques.
4 To solve programming problems using state space tree.
5 To understand the concept behind NP completeness,Approximation algorithm and randomizied
algorithm
Course Outcomes BT
Upon completion of the course, students will be able to: Level
CO1 Analyze the efficiency of algorithms using various framework K2
CO2 Apply graph algorithm to solve problems and analyze their efficiency K3
CO3 Make use of algorithm design techniques like divide and conquer, dynamic programming and K4
greedy techniques to solve problem.
CO4 Use the state space tree method for solving problems K1
CO5 Solve problems using approximation algorithm and randomized algorithm. K5

Blooms Taxonomy(BT) Level


K1-Remembering; K2-Understanding; K3-Applying; K4-Analyzing; K5-Evaluating; K6-Creating
Year of
Part A-(10x2=20 marks) BT CO
Univ.
(Answer all the questions) level Mapping
Exam
1 Define time complexity of an algorithm? K1 CO1 A/M 23
2 List the types of asymptotic notations in analyzing complexity of K2 CO3 A/M 23
algorithms?
3 Define big omega notation? K1 CO1 M/D 16
4 What is meant by substitution method? K1 CO1 A/D 14
5 State masters theorem? K3 CO2
M/J 18
Year of
Part B-(2x13=26 marks) Mark BT CO
Univ.
(Answer all the questions) Allotted Level Mapping
Exam
What is pattern searching? Outline the steps in the Rabin-
6 A karp algorithm for pattern searching with an example? (13) K3 CO1 A/P 23

Or
B Write an algorithm to perform linear search on an array of (13) K1 CO3 A/P 23
‘N’ numbers. Illustrate the best case ,average case and
worst case complexity of the linear search algorithm with
an example.
Explain in detail about various asymptotic notations and
7 A i (8) K1 CO1 AM2023
its properties.
Solve the following recurrence relation T(n)= 4T (n/2)+n.
ii (5) K3 CO2 D 10
Or
N/D 14
B Explain rabin -karp algorithm with example. (13) K2 CO3

Part C-(1x15=15 marks)


Explain insertion sort with example?
8 A (14) K2 CO3 A/M 16
Or
Sort the elements of a given array in ascending order using
B (14) K5 CO4
heap sort.The elements are 48,0,-1,82,108,72,54

Prepared Verified by Approved by

~* All the Best*~

You might also like