Scribd
Upload
106 views

Cse 418

This document outlines the course details and practical assignments for an Algorithms Laboratory course. It includes 10 practical assignments covering topics like heaps, sorting, greedy algorithms, minimum spanning trees, shortest path algorithms, maximum flow, and string matching. Students will implement algorithms for these topics in C/C++ to learn their applications and analyze their time complexities.

Uploaded by

Kislay Singh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
106 views

Cse 418

This document outlines the course details and practical assignments for an Algorithms Laboratory course. It includes 10 practical assignments covering topics like heaps, sorting, greedy algorithms, minimum spanning trees, shortest path algorithms, maximum flow, and string matching. Students will implement algorithms for these topics in C/C++ to learn their applications and analyze their time complexities.

Uploaded by

Kislay Singh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Lovely Professional University, Punjab

Course Code CSE418 Course Category Course Title ALGORITHMS LABORATORY Practical Course Course Planner 15691::Surmeet Kaur Lectures 0.0 Tutorials Practicals Credits 0.0 2.0 1.0

TextBooks Sr No T-1 Title Introduction to Algorithms Reference Books Sr No R-1 R-2 R-3 Other Reading Sr No OR-1 OR-2 Journals articles as Compulsary reading (specific articles, complete reference) http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Complexity/npComplete.htm (NP Completeness) , http://delab.csd.auth.gr/~manolopo/Design/ch03.ppt (Brute Force String Matching) , Title Introduction to the Design and Analysis of Algorithm The Design and Analysis Of Computer Algorithms Computer Algorithms - Introduction to Design and Analysis Author Anany Levitin A.V.Aho, J.E. Hopcroft and J.D.Ullman Sara Baase and Allen Van Gelder Edition 3rd 3rd 3rd Year 2003 2007 2006 Publisher Name Pearson Education Pearson Education Pearson Education Author Edition Year 2007 Publisher Name PHI Learning Pvt Ltd, New Delhi C.E. Leiserson, R.L. Rivest 3rd and C. Stein,

Relevant Websites Sr No RW-1 RW-2 RW-3 (Web address) (only if relevant to the course) http://courses.ncsu.edu/ma103/common/media/05/MA103Lct25.mp4 http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html http://www.cse.yorku.ca/~aaw/Zambito/TSP_L/Web/TSPStart.html Salient Features Prims and Kruskals Algorithm Dijkstra's shortest path algorithm Travelling salesman problem

Scheme for CA:


Component Execution Frequency 8 Out Of 10 Total :Each Marks Total Marks 5 5 40 40

*Each experiment of the lab will be evaluated using following relative scheme:
Component WR J/E VIVA % of Marks 20 50 30

Detailed Plan For Practicals


Practical No Practical 1 Practical 2 Broad topic (Subtopic) Practical Description Learning Outcomes Equipment Used Heaps(Sorting and Building)(Program for Program for building a heap using a given Students will learn to convert a list into Turbo C/C++ Building a Heap) list of elements a tree Heaps(Sorting and Building)(Program for Program to insert and delete the elements Students will learn a different sorting Heap Sort) in a heap technique Program for Heap Sort Linear time sorting(Program to implement any sorting technique having linear time equation) Greedy Algorithms(Program to implement activity selection problem) Turbo C/C++

Practical 3

Program to sort a list using any technique Students will learn the basic concept of Turbo C/C++ of linear time equation complexities of different sorting algorithms Program for activity selection problem learn the basic concept of Greedy algoritms Turbo C/C++

Practical 4 Practical 5

Approximation Algorithms(Program to Program to implement Travelling implement Travelling Salesman Problem Salesman Problem and vertex cover problem) Program to implement Vertex Cover Problem Minimum Spanning Tree(Program to implement Kruskal and Prim)

Learn the basic concept of NP complete Turbo C/C++ problems

Practical 6

Program to find the minimum spanning Learn to convert a graph into a tree tree using Prim''s Algorithm Program to find a minimum spanning tree using Kruskal's Algorithm Program to implement The Floyd Warshall Algorithm Program to find the shortest path from a single source using Bellman ford Algorithm Program to find the shortest path from a single source using Dijkstra''s Algorithm Program to compute the maximum flow in a flow network using Ford Fulkerson method Program to match the two strings using Robin Karp algorithm Program to match the two strings using Knuth Morris Algorithm Learn to distinguish between single source and all to all shortest path algorithms Learn to distinguish between single source and all to all shortest path algorithms Learn to find the shortest path from a single source to a destination

Turbo C/C++

Practical 7

All Pairs Shortest Path Algorithms (Program to implement The Floyd Warshall Algorithm) Single Source Shortest Path Algorithm (Program to implement The BellmanFord Algorithm) Single Source Shortest Path Algorithm (Program to implement Dijksta's Algorithm)

Turbo C/C++

Practical 8

Turbo C/C++

Turbo C/C++

Practical 9

Maximum Flow(Program to implement The Ford-Fulkerson method) String Matching(Program to implement The Robin-Karp algorithm and The Knuth Morris Pratt algorithm)

Learn to calculate the maximum flow in Turbo C/C++ a network flow graph Learn to match the two strings Turbo C/C++

Practical 10

SPILL OVER
Practical 11 Program to implement Knapstack Problem Students will gain more knowledge about NP complete problems Turbo C/C++

You might also like