[go: up one dir, main page]
Scribd
Upload
215 views2 pages

DAA Lab Syllabus

This document describes a lab course on Design and Analysis of Algorithms. The course involves 2 hours per week and 1 credit. Students will complete programming assignments on sorting, searching, and other algorithms. They will analyze time complexity and select optimal algorithms. Some specific assignments involve sorting, string matching, matrix operations, graph problems, and dynamic programming. Students will be evaluated through lab experiments, assignments, viva exams, and an end semester practical exam. The course aims to help students understand algorithms, analyze time complexity, and solve problems using different approaches.

Uploaded by

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

DAA Lab Syllabus

This document describes a lab course on Design and Analysis of Algorithms. The course involves 2 hours per week and 1 credit. Students will complete programming assignments on sorting, searching, and other algorithms. They will analyze time complexity and select optimal algorithms. Some specific assignments involve sorting, string matching, matrix operations, graph problems, and dynamic programming. Students will be evaluated through lab experiments, assignments, viva exams, and an end semester practical exam. The course aims to help students understand algorithms, analyze time complexity, and solve problems using different approaches.

Uploaded by

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

MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES

(Deemed to be University under section 3 of the UGC Act 1956)


NAAC 'A' Grade University

BCS-DS-551: Design & Analysis of Algorithms Lab

Periods/week Credits Max. Marks : 100


P :2 1.0 Continuous Evaluation : 50
Duration of Exam: 2 Hrs End Sem Examination : 50

Pre-Requisite: Data Structures & Algorithms Lab (BCS-DS-351)


Course Type: Program Core

Course Outcomes: Students will be able to-


BCS-DS-551.1. Understand the programs, their working and code accordingly.
BCS-DS-551.2. Analyze the programs based on time complexity.
BCS-DS-551.3. Select algorithms on the basis of optimality.
BCS-DS-551.4. Learn different methods of solving similar problems.
BCS-DS-551.5. Solve any problem using different approaches.
BCS-DS-551.6. Learn how to correlate different techniques.

List of Practical’s:
1. WAP to sort a set of numbers into ascending/ Descending order using different sorting algorithms
and calculate the time complexity by step-count method. Take the input-set from a table and
repeat the operation several times 10,20,30,40 times and plot a graph.
Examine the best case, worst-case and average case by taking suitable input data.
2. WAP for string matching by (i) Naive-string matching method and (ii) Rabin-Karp algorithm and
compare number of operations done in these methods.
3. WAP for string matching using finite Automata method and Knuth-Morris-Pratt Algorithms.
4. WAP to find a number in an array by binary search method.
5. WAP to sort a set of numbers using (i) Merge sort and (ii) Quick-sort using divide and conquer
method.
6. WAP for multiplications of two Matrices using Strassen’s Multiplication Algorithms.
7. WAP to solve Knapsack problem using Greedy Algorithm.
8. WAP to solve Job Sequencing Problem with deadlines using Greedy algorithm.
9. Implement Graph on two-dimensional array and use Greedy method to obtain minimum-cost
spanning tree of the graph.
10. WAP for Matrix-Chain Multiplication using Dynamic programming.
11. WAP to find the Largest Common Subsequence of two sets using Dynamic programming.
12. WAP for optimal binary search of an element in a array using Dynamic programming.
13. WAP for 0/1 Knapsack problem using Dynamic programming.
14. WAP for solution space for 8 Queen Problem and solve the problem using Back-Tracking method.
15. WAP for Sum of subsets problem of a given set using back tracking method.

Note: At least 5 more exercises to be given by the teacher concerned.


Distribution of Continuous Evaluation:
Viva- I 30%
Viva- II 30%
File/Records 20%
Class Work/ Performance 10%
Attendance 10%

Batch 2021-25 CSE Page 176


Evaluation Tools:
Experiments in lab
File work/Class Performance
Viva (Question and answers in lab)
End Semester Practical Examination

COURSE ARTICULATION MATRIX:

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO


Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(BCS-DS-
551)
BCS-DS-551.1 1 1 3 1 2 - - - 1 2 - - - 3 3
BCS-DS-551.2 2 3 3 2 - - - - 1 2 - - - 3 3
BCS-DS-551.3 1 3 3 2 - - - - - - - - - 3 3
BCS-DS-551.4 1 3 3 2 - - - - - 1 - - - 3 3
BCS-DS-551.5 1 3 3 2 - - - - 1 1 - - - 3 3
BCS-DS-551.6 1 3 3 3 - - - - 1 1 - - - 3 3

Batch 2021-25 CSE Page 177

You might also like