0% found this document useful (0 votes)
41 views3 pages

Daa Lab

The document outlines the course handout for the subject of Design & Analysis of Algorithms lab. It details the topics, pre-requisites, outcomes, text books and mapping of course outcomes to program outcomes. The course aims to implement algorithms, analyze complexities and approximate solutions to NP-hard problems over 14 classes.

Uploaded by

srustishree sahu
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
0% found this document useful (0 votes)
41 views3 pages

Daa Lab

The document outlines the course handout for the subject of Design & Analysis of Algorithms lab. It details the topics, pre-requisites, outcomes, text books and mapping of course outcomes to program outcomes. The course aims to implement algorithms, analyze complexities and approximate solutions to NP-hard problems over 14 classes.

Uploaded by

srustishree sahu
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/ 3

Course Handout (2022-23 ODD SEMESTER)

: DESIGN & ANALYSIS OF ALGORITHMS


Subject Name/Code LAB(MCCS-P-PC-023)
Branch/Sem/Batch :

: Pradyumna Kumar Tripathy , Gadadhar Rautaray , Jiten Kumar Mohanty , Banaja Mishra ,
Name of Faculty Pratap Chandra Panigrahi , Dibakar Pradhan , Dusmanta Kumar Pradhan , Rasmita Sahoo ,
Jitendra Pradhan , Biswambar Pradhan
Scope & Objective -:

The objective of this course is To implement various algorithms under different categories, analyze algorithms & their
complexities, and implement approximation algorithms for NP hard problems.

Pre-Requisite -:

# Topic Module Chapter Course Coverage No of Classes

Design C programs using structure to


1 TRUE 1
implement insertion, deletion, BST.
Sort a given set of elements using the
Quick-sort method and determine the time
2 required to sort the elements. Repeat the TRUE 1
experiment for different values of n, the
number of elements in the list to be sorted.
Implement Merge Sort algorithm to sort a
given set of elements and determine the
3 time required to sort the elements. Repeat TRUE 1
the experiment for different values of n, the
number of elements in the list to be sorted.
Implement Heap Sort algorithm to sort a
4 given set of elements and determine the TRUE 1
time required to sort the elements.
Obtain the Topological ordering of vertices
5 TRUE 1
in a given digraph.
Implement 0/1 Knapsack problem using
6 TRUE 1
Dynamic Programming.
Implement BFS algorithm in a diagraph and
7 check whether a given graph is connected TRUE 1
or not using DFS method.
Implement Dijkstra’s algorithm to find the
8 TRUE 1
shortest path in weighted connected graph.
Find Minimum Cost Spanning Tree of a
9 given undirected graph using Kruskal’s TRUE 1
algorithm.
Find Minimum Cost Spanning Tree of a
10 given undirected graph using Prim’s TRUE 1
algorithm.
Implement All-Pairs Shortest Paths Problem
11 using Floyd’s algorithm. Parallelize this TRUE 1
Algorithm.
Implement N Queen’s problem using Back
12 TRUE 1
Tracking.
Design an algorithm to find the optimal
solution for the TSP and then solve the
13 same problem using any approximation FALSE 1
algorithm and determine the error in the
approximation.
Design an algorithm to find the optimal
14 FALSE 1
solution for the TSP using BB method

Total no. of classes : 14

Text Book
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Edition, PHI Learning, 2014, ., .
A. Levitin, Introduction to the Design and Analysis of Algorithms, 3rd Edition, Pearson, 2012., ., .
Reference Book
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, 3rd Edition, Pearson Education, 2006, ., .
D. E. Knuth, The Art of Computer Programming - Volumes 1 & 3, Pearson Education, 2009, ., .
S. S. Skiena, The Algorithm Design Manual, 2nd Edition, Springer, 2008, ., .
Online Reference Material(s):

1. https://nptel.ac.in/courses/106101060/
2. https://nptel.ac.in/courses/106106131/
3. http://www.cs.virginia.edu/robins/CS readings.html
4. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematicsfor-computer-science-fall-2010/video-
lectures/

Course Outcome:
CO1 Design C programs using structure to implement insertion, deletion, searching of a BST.
CO2 Implement comparison-based sorting algorithms and computing the time required.
Construct C programs for algorithms based on Divide & Conquer, Dynamic Programming and
CO3
Greedy techniques.
CO4 Design C program for Graph traversal algorithms.
CO5 Implement N-Queen using Backtracking.
CO6 Implement a scheme to find the solution of Travelling Salesman Problem.

Program Outcomes Relevent to the Course:


Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,
PO1
and an engineering specialization to the solution of complex engineering problems
Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences.
Design/development of solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet the specified needs with appropriate consideration for
the public health and safety, and the cultural, societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and research methods
PO4 including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.
The engineer and society: Apply reasoning informed by the contextual knowledge to assess
PO6 societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
Environment and sustainability: Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
PO8
the engineering practice.
Individual and team work: Function effectively as an individual, and as a member or leader in
PO9
diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with the engineering
PO10 community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of the engineering
PO11 and management principles and apply these to one’s own work, as a member and leader in a team,
to manage projects and in multidisciplinary environments.
Life-long learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and life-long learning in the broadest context of technological change.

Mapping of CO's to PO's: (1: Low, 2: Medium, 3: High)


PO1 PO2 PO3 PO4 PO5
CO1 3 3 2 1 2
CO2 3 3 3 3
CO3 3 2 3 3 3
CO4 3 3 2 2 2
CO5 3 3 3 3 3
CO6 2 2 2 1

You might also like