Scribd
Upload
2 views

CSP350_Design and Analysis of Algorithm Lab

The syllabus outlines the Design and Analysis of Algorithm lab course (CSP 350), focusing on algorithm design concepts, strategies, and important algorithms. Students will learn to analyze time and space complexity and implement various algorithms through practical assignments. The course includes topics such as searching, sorting, dynamic programming, greedy programming, advanced data structures, and string matching algorithms.

Uploaded by

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

CSP350_Design and Analysis of Algorithm Lab

The syllabus outlines the Design and Analysis of Algorithm lab course (CSP 350), focusing on algorithm design concepts, strategies, and important algorithms. Students will learn to analyze time and space complexity and implement various algorithms through practical assignments. The course includes topics such as searching, sorting, dynamic programming, greedy programming, advanced data structures, and string matching algorithms.

Uploaded by

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

Syllabus: Design and Analysis of Algorithm lab

School: Batch:
Program: Current Academic Year:
Branch: Semester:
1 Course Code CSP 350
2 Course Title Design and Analysis of Algorithm lab
3 Credits
4 Contact 0-0-2
Hours
(L-T-P)
Course Status Compulsory/Elective
5 Course Objective of this course is to
Objective 1. Reinforce basic design concepts (e.g., pseudocode, specifications,
top-down design)
2. Knowledge of algorithm design strategies
3. Familiarity with an assortment of important algorithms.
 Enable students to analyze time and space complexity
6 Course Students will be able to:
Outcomes CO1: calculate time complexity of searching algorithm
CO2: Write program based on dynamic programming.
(same as CO3: apply greedy algorithm to any problem
theory course) CO4: develop program based on advanced data structure
CO5: design a program based on different string matching algorithm
CO6: implement real world problem based on greedy and dynamic
algorithm
7 Course This course introduces concepts related to the design and analysis of
Description algorithms. Specifically, it discusses recurrence relations, and illustrates
their role in asymptotic and probabilistic analysis of algorithms. It covers in
detail greedy strategies divide and conquer techniques, dynamic
programming and max flow - min cut theory for designing algorithms, and
illustrates them using a number of well-known problems and applications.
8 Outline syllabus CO Mapping
Unit 1 Practical based on Searching and sorting
1. WAP to demonstrate the concept CO1
of Linear and Binary Search
2. WAP to implement Merge sort
3. WAP to implement Quick Sort

Unit 2 Practical based on Dynamic Programming


1. WAP to implement Matrix Chain CO2, CO6
Multiplication problem
2. WAP to demonstrate the concept
of Longest Common
Subsequence(LCS)
3. WAP to demonstrate concept of 0
– 1 Knapsack Problem

Unit 3 Practical based on Greedy Programming


1. WAP to demonstrate concept of CO3, CO6
Minimum Spanning Tree(Prim’s
Algorithm)
2. WAP to demonstrate concept of
Fractional Knapsack Problem
3. WAP to implement single source
shortest problem using Dijkstra’s
Algorithm

Unit 4 Practical based on Advance concepts


WAP to demonstrate concept of Red Black Tree CO4
insertion and Deletion
Unit 5 Practical based on String Matching
1. WAP to demonstrate the concept of Naïve CO5
String matching algorithm.
2. WAP to demonstrate the concept of Robin
Karp Algorithm.

Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* -
Other
References

PO and PSO mapping with level of strength for Course Name Design and Analysis of
Algorithms Lab. Course Code CSP 350)

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO


Cos
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO
3 3 2 3 1 -- -- - 2 - - - 2 3 3
1
CO
2 3 3 2 2 -- -- - 2 - - - 3 2 2
2
CO
3 2 2 - 3 -- -- - 1 - - - 2 1 -
3
CO
2 3 3 3 1 -- -- - 3 - - - 3 3 1
4
CO
3 2 2 3 2 - - - 2 - - - 2 3 2
5
CO
2 3 3 1 3 - - -- 1 - - - 3 2 3
6
Average of non-zeros entry in following table (should be auto calculated).

Cou
Cours P P P P P P P P P
rse PO PO PO PS PS PS
e O O O O O O O O O
Cod 10 11 12 O1 O2 O3
Name 1 2 3 4 5 6 7 8 9
e

Design
and
CSP Analys 2. 2. 2. 2. 1.
2 - - - - - - 2.5 2.3 2.2
350 is of 5 7 5 4 8
Algori
thms
Lab

Strength of Correlation

1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent


3. Addressed to Substantial (High=3) extent

You might also like