Advance Algorithm detailed syllabus scheme for Computer Engineering (CS), 2018 regulation has been taken from the MU 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 5th Sem Scheme of Computer Engineering (CS), 2018 Pattern, do visit CS 5th Sem Scheme, 2018 Pattern. For the Department Level Optional Course-1 scheme of 5th Sem 2018 regulation, refer to CS 5th Sem Department Level Optional Course-1 Scheme 2018 Pattern. The detail syllabus for advance algorithm is as follows.
Advance Algorithm Syllabus for Computer Engineering TE 5th Sem 2018 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 pdfs platform to make students’s lives easier.
.
Course Outcomes:
At the end of the course student will be able to
- Describe analysis techniques for algorithms.
- Identify appropriate data structure and design techniques for different problems
- Identify appropriate algorithm to be applied for the various application like geometric modeling, robotics, networking, etc.
- Appreciate the role of probability and randomization in the analysis of algorithm
- Analyze various algorithms.
- Differentiate polynomial and non deterministic polynomial algorithms.
Prerequisites:
Data structures, Discrete mathematics and Analysis of Algorithm
Module 1
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 pdfs platform to make students’s lives easier..
Module 2
Probabilistic Analysis and Randomized Algorithm The hiring problem Indicator random variables Randomized algorithms Probabilistic analysis and further uses of indicator random variable 08
Module 3
Advanced Data Structure Introduction to trees and heap Red-Black Trees: properties of red-black trees , Operations on Red-black trees Binomial Heaps: Binomial trees and binomial heaps, Operation on Binomial heaps Analysis of all above operations 12
Module 4
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 pdfs platform to make students’s lives easier..
Module 5
Computational Geometry Line Segment properties, Determining whether any pair of segment intersects, finding the convex hull, Finding the closest pair of points. 08
Module 6
NP-Completeness And Approximation Algorithms NP-Completeness: NP-Completeness and reducibility, NP-Completeness proofs, NP-Complete problems-The vertexcover problem, The travelling salesman problem 08
Text 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 pdfs platform to make students’s lives easier..
Reference Books:
- Rajeev Motwani, Prabhakar Raghavan Randomized Algorithm, Cambridge University
- S. K. Basu, Design Methods and Analysis of Algorithm, PHI
- Vijay V. Vajirani, Approximation Algorithms,Springer.
Internal Assessment: Assessment consists of two tests out of which; one (T1) should be compulsory class test (on at least 02 Modules) and the other (T2) is either a class test or assignments on live problems or course project
Theory Examination:
- Question paper will comprise of total six questions.
- All question carry equal marks
- Questions will be mixed in nature (for example supposed Q.2 has part
- from module 3 then part
- will be from any module other than module 3)
- Only Four question need to be solved.
In question paper weightage of each module will be proportional to number of respective lecture hours as mentioned in the syllabus.
For detail Syllabus of all subjects of Computer Engineering (CS) 5th Sem 2018 regulation, visit CS 5th Sem Subjects of 2018 Pattern.