Daa Lab
Daa Lab
: 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 -:
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.