CSC402: Analysis of Algorithms Syllabus for CS 4th Sem 2017 Pattern Mumbai University

Analysis of Algorithms 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 is as follows.

Analysis of Algorithms Syllabus for Computer Engineering SE 4th Sem 2017 Pattern Mumbai University

Course Objectives:

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.
.

Course Outcomes:

At the end of the course student will be able to

1. Analyze the running time and space complexity of algorithms.
2. Describe, apply and analyze the complexity of divide and conquer strategy.
3. Describe, apply and analyze the complexity of greedy strategy.
4. Describe, apply and analyze the complexity of dynamic programming strategy.
5. Explain and apply backtracking, branch and bound and string matching techniques to deal with some hard problems.
6. Describe the classes P, NP, and NP-Complete and be able to prove that a certain problem is NP-Complete.

Prerequisites:

Students should be familiar with concepts of Data structure and discrete structures.

Module 1

Introduction to analysis of algorithm Performance analysis , space and time complexity Growth of function – Big -Oh ,Omega , Theta notation Mathematical background for algorithm analysis, Analysis of selection sort , insertion sort. Recurrences: -The substitution method -Recursion tree method -Master method Divide and Conquer Approach: General method Analysis of Merge sort, Analysis of Quick sort, Analysis of Binary search, Finding minimum and maximum algorithm and analysis, Strassens matrix multiplication 12

Module 2

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.
.

Module 3

Greedy Method Approach: 06 General Method Single source shortest path Knapsack problem Job sequencing with deadlines Minimum cost spanning trees-Kruskal and prims algorithm Optimal storage on tapes

Module 4

Backtracking and Branch-and-bound: General Method 8 queen problem( N-queen problem) Sum of subsets Graph coloring 15 puzzle problem, Travelling salesman problem. 08

Module 5

String Matching Algorithms: The naive string matching Algorithms The Rabin Karp algorithm String matching with finite automata The knuth-Morris-Pratt algorithm 06

Module 6

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.
.

Text Books:

1. T.H.coreman , C.E. Leiserson,R.L. Rivest, and Stein, Introduction to algorithms, 2nd edition , PHI publication 2005.
2. Ellis horowitz , Sartaj Sahni , Rajsekaran. Fundamentals of computer algorithms University Press

Reference Books:

1. Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, Algorithms, Tata McGraw- Hill Edition.
2. K. Basu, Design Methods and Analysis of Algorithm, PHI.
3. John Kleinberg, Eva Tardos, Algorithm Design, Pearson.
4. Michael Goodrich, Roberto Tamassia, Algorithm Design, Wiley Publication.

Assessment:

Internal Assessment Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of each test shall be one hour. End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

For detail syllabus of all other subjects of Computer Engineering (CS) 4th Sem 2017 regulation, visit CS 4th Sem Subjects syllabus for 2017 regulation.