Scribd
Upload
20 views2 pages

Daa Lab Syllabus

The document outlines the course structure for the Design and Analysis of Algorithms Lab for B.Tech CSE II Year students at Geethanjali College of Engineering and Technology. It includes course objectives, outcomes, and a list of lab exercises focusing on various algorithmic strategies and data structures. Students will learn to analyze algorithm complexity, apply different algorithmic approaches, and implement various algorithms through practical exercises.

Uploaded by

bhaimodel20
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
20 views2 pages

Daa Lab Syllabus

The document outlines the course structure for the Design and Analysis of Algorithms Lab for B.Tech CSE II Year students at Geethanjali College of Engineering and Technology. It includes course objectives, outcomes, and a list of lab exercises focusing on various algorithmic strategies and data structures. Students will learn to analyze algorithm complexity, apply different algorithmic approaches, and implement various algorithms through practical exercises.

Uploaded by

bhaimodel20
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

B.

Tech CSE AR22

GEETHANJALI COLLEGE OF ENGINEERING AND TECHNOLOGY


(UGC Autonomous)
Cheeryal (V), Keesara (M), Medchal Dist., Telangana-501301

20CS22L01-DESIGN AND ANALYSIS OF ALGORITHMS LAB


B.Tech. CSE - II Year, II Sem.
L T P/D C
Prerequisite(s): - - 2/- 1
 20CS11001-PROGRAMMING FOR PROBLEM SOLVING-I LAB
 20CS21001-DATA STRUCTURES LAB

Course Objectives
Develop ability to
1. Learn the asymptotic notations and understand the performance of algorithms.
2. Learn the behavior of Greedy strategy, Divide and Conquer approach, Dynamic
3. Programming and branch and bound theory and apply them for several problem
solving techniques.
4. Explore various data structures and algorithm design methods together impacts the
performance of programs.
5. Distinguish between deterministic and non-deterministic algorithms and their
computational efficiency.

Course Outcomes (COs)


After completion of the course, student would be able to
CO1. Analyze time and space complexity of a given algorithm and use asymptotic
notation to represent the complexities.
CO2. Apply divide and conquer, greedy, dynamic programming, backtracking and
branch and bound algorithmic approaches to a given problem.
CO3. Prove that a given problem is NP-Complete by using the concepts of NP-
Completeness.
LIST OF LAB EXERCISES (R20)
1. Using OpenMP, implement a parallelized Merge Sort algorithm to sort a given set of
elements and determine the time required to sort the elements. Repeat the experiment
for different values of n, the number of elements in the list to be sorted and plot a
graph of the time taken versus n. The elements can be read from a file or can be
generated using the random number generator.
2. Write and implement an algorithm determining articulation points and the bi-
connected components in the given graph
3. Implement an algorithm to find the minimum cost spanning tree using
a) Prim‟s algorithm
b) Kruskal‟s Algorithm
4. From a given vertex in a weighted connected graph, find shortest paths to other
vertices using Dijkstra‟s algorithm.
5. Implement Job Sequencing with Deadlines algorithm and Fast Job Sequencing with
Deadlines
6. Implement Matrix Chain multiplication algorithm. Parallelize this algorithm,
implement it using Open and determine the speed-up achieved.
7. Implement 0/1 Knapsack problem using Dynamic Programming.
Department of Computer Science and Engineering 107
B.Tech CSE AR22

8. Implement an algorithm to find the optimal binary search tree for the given list of
identifiers.
9. Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose Sum is
equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there
are two solutions {1, 2, 6} and {1, 8}.A suitable message is to be displayed if the
given problem instance doesn't have a solution.
10. Implement n-Queens problem using Back Tracking.
11. Write a program for Hamiltonian Cycle Problem.
12. Implement the solution for TSP problem using Branch & Bound technique.

Department of Computer Science and Engineering 108

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