cse418
DESCRIPTION
IPTRANSCRIPT
Lovely Professional University, Punjab
Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
CSE418 ALGORITHMS LABORATORY 15691::Surmeet Kaur 0.0 0.0 2.0 1.0
Course Category Practical Course
TextBooks
Sr No Title Author Edition Year Publisher Name
T-1 Introduction to Algorithms C.E. Leiserson, R.L. Rivest and C. Stein,
3rd 2007 PHI Learning Pvt Ltd, New Delhi
Reference Books
Sr No Title Author Edition Year Publisher Name
R-1 Introduction to the Design and Analysis of Algorithm
Anany Levitin 3rd 2003 Pearson Education
R-2 The Design and Analysis Of Computer Algorithms
A.V.Aho, J.E. Hopcroft and J.D.Ullman
3rd 2007 Pearson Education
R-3 Computer Algorithms - Introduction to Design and Analysis
Sara Baase and Allen Van Gelder
3rd 2006 Pearson Education
Other Reading
Sr No Journals articles as Compulsary reading (specific articles, complete reference)
OR-1 http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Complexity/npComplete.htm (NP Completeness) ,
OR-2 http://delab.csd.auth.gr/~manolopo/Design/ch03.ppt (Brute Force String Matching) ,
Relevant Websites
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 http://courses.ncsu.edu/ma103/common/media/05/MA103Lct25.mp4 Prims and Kruskals Algorithm
RW-2 http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html Dijkstra's shortest path algorithm
RW-3 http://www.cse.yorku.ca/~aaw/Zambito/TSP_L/Web/TSPStart.html Travelling salesman problem
Scheme for CA:Component Frequency Out Of Each Marks Total Marks
Execution 8 10 5 40
Total :- 5 40
Detailed Plan For Practicals
Practical No Broad topic (Subtopic) Practical Description Learning Outcomes Equipment Used
Practical 1 Heaps(Sorting and Building)(Program for Building a Heap)
Program for building a heap using a given list of elements
Students will learn to convert a list into a tree
Turbo C/C++
Practical 2 Heaps(Sorting and Building)(Program for Heap Sort)
Program to insert and delete the elements in a heapProgram for Heap Sort
Students will learn a different sorting technique
Turbo C/C++
Practical 3 Linear time sorting(Program to implement any sorting technique having linear time equation)
Program to sort a list using any technique of linear time equation
Students will learn the basic concept of complexities of different sorting algorithms
Turbo C/C++
Practical 4 Greedy Algorithms(Program to implement activity selection problem)
Program for activity selection problem learn the basic concept of Greedy algoritms
Turbo C/C++
Practical 5 Approximation Algorithms(Program to implement Travelling Salesman Problem and vertex cover problem)
Program to implement Travelling Salesman ProblemProgram to implement Vertex Cover Problem
Learn the basic concept of NP complete problems
Turbo C/C++
Practical 6 Minimum Spanning Tree(Program to implement Kruskal and Prim)
Program to find the minimum spanning tree using Prim''s AlgorithmProgram to find a minimum spanning tree using Kruskal's Algorithm
Learn to convert a graph into a tree Turbo C/C++
Practical 7 All Pairs Shortest Path Algorithms(Program to implement The Floyd Warshall Algorithm)
Program to implement The Floyd Warshall Algorithm
Learn to distinguish between single source and all to all shortest path algorithms
Turbo C/C++
Practical 8 Single Source Shortest Path Algorithm(Program to implement The Bellman-Ford Algorithm)
Program to find the shortest path from a single source using Bellman ford Algorithm
Learn to distinguish between single source and all to all shortest path algorithms
Turbo C/C++
Single Source Shortest Path Algorithm(Program to implement Dijksta's Algorithm)
Program to find the shortest path from a single source using Dijkstra''s Algorithm
Learn to find the shortest path from a single source to a destination
Turbo C/C++
Practical 9 Maximum Flow(Program to implement The Ford-Fulkerson method)
Program to compute the maximum flow in a flow network using Ford Fulkerson method
Learn to calculate the maximum flow in a network flow graph
Turbo C/C++
Practical 10 String Matching(Program to implement The Robin-Karp algorithm and The Knuth Morris Pratt algorithm)
Program to match the two strings using Robin Karp algorithm Program to match the two strings using Knuth Morris Algorithm
Learn to match the two strings Turbo C/C++
*Each experiment of the lab will be evaluated using following relative scheme:
Component % of Marks
WR 20
J/E 50
VIVA 30
SPILL OVERPractical 11 Program to implement Knapstack
ProblemStudents will gain more knowledge about NP complete problems
Turbo C/C++