Analysis of Algorithms Lab detailed syllabus scheme for Computer Engineering (CS), 2017 regulation has been taken from the University of Mumbai official website and presented for the Bachelor of Engineering students. For Course Code, Course Title, Test 1, Test 2, Avg, End Sem Exam, Team Work, Practical, Oral, Total, and other information, do visit full semester subjects post given below.
For all other Mumbai University Computer Engineering 4th Sem Syllabus 2017 Pattern, do visit CS 4th Sem 2017 Pattern Scheme. The detailed syllabus scheme for analysis of algorithms lab is as follows.
Analysis of Algorithms Lab Syllabus for Computer Engineering SE 4th Sem 2017 Pattern Mumbai University
Lab outcomes:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.
Prerequisites:
Students should be familiar with concepts of Data structure and Discrete structures. Description: Minimum 2 experiments should be implemented using any language on each algorithm design strategy (Divide and conquer, dynamic programming, Greedy method, backtracking and branch & bound, string matching).
Suggested Laboratory Experiments:
- Introduction to analysis of algorithm Divide and Conquer Approach Selection sort , insertion sort. Merge sort, Quick sort, Binary search.
- Dynamic Programming Approach Multistage graphs, single source shortest path, all pair shortest path, 0/1 knapsack, Travelling salesman problem, Longest common subsequence.
- Greedy Method Approach Single source shortest path, Knapsack problem, Job sequencing with deadlines, Minimum cost spanning trees-Kruskal and prims algorithm, Optimal storage on tapes.
- Backtracking and Branch-and-bound 8 queen problem ( N-queen problem), Sum of subsets, Graph coloring, 15 puzzle problem, Travelling salesman problem.
- String Matching Algorithms The naive string matching Algorithms, The Rabin Karp algorithm, String matching with finite automata, The knuth-Morris-Pratt algorithm.
- Any two Experiments This will involve implementation of two algorithms for problems beyond the scope of syllabus. The exact set of algorithms to implement is to be decided by the course instructor.
Text Books:
- T.H.Coreman , C.E. Leiserson,R.L. Rivest, and C. Stein, Introduction to algorithms, 2nd edition , PHI publication 2005.
- Ellis horowitz , sartaj Sahni , Rajsekaran. Fundamentals of computer algorithms University Press
Reference Books:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
For detail syllabus of all other subjects of Computer Engineering (CS) 4th Sem 2017 regulation, visit CS 4th Sem Subjects syllabus for 2017 regulation.