Scribd
Upload
2 views

set b algo

The document outlines the model examination for the CS3401 - Algorithm course at Madha Engineering College, scheduled for March 2025. It details course objectives, outcomes, and the structure of the exam, including types of questions and their respective marks. The examination covers algorithm analysis, graph algorithms, design techniques, and problem-solving methods.

Uploaded by

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

set b algo

The document outlines the model examination for the CS3401 - Algorithm course at Madha Engineering College, scheduled for March 2025. It details course objectives, outcomes, and the structure of the exam, including types of questions and their respective marks. The examination covers algorithm analysis, graph algorithms, design techniques, and problem-solving methods.

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 Hours
Branch Computer Science & Engineering Year/Semester III / 06

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 Give the diagram representation of Notion of algorithm K1 CO4 A/M 23
2 What are the types of algorithm efficiencies? K2 CO4 A/M 24
3 Define big oh notation? K1 CO3 M/D 16
4 What is recurrence equation? K1 CO3 A/D 16
5 Define Linear Search. K2 CO3M/J 12
Year of
Part B-(2x13=26 marks) Mark BT CO
Univ.
(Answer all the questions) Allotted Level Mapping
Exam
What is meant by recurrence? Give one example to solve
6 A recurrence equation (13) K2 CO4 A/P 23

Or
B Explain naïve string matching algorithm with example (13) K1 CO2 A/P 23

Apply binary search method to search 60 from the list


7 A i (9) K2 CO2 AM2023
10,20,30,40,50,60,70
Solve the recurrence relation T(n) = 2T(n/2)+n
ii (4) K1 CO3 D 10
Or
N/D 14
B Explain heap sort algorithm with example (13) K2 CO2

Part C-(1x15=15 marks)


Define Asymptotic notations and its properties?
8 A (14) K3 CO3 A/M 16
Or
Sort the following numbers using insertion sort .show all
B (14) K4 C04
passes 50,10,78,40,30,02,04,15

Prepared Verified by Approved by

~* All the Best*~

You might also like