Advanced Algorithms detail syllabus for Computer Science & Engineering (CSE), 2017 scheme is taken from VTU official website and presented for VTU students. The course code (17CS554), and for exam duration, Teaching Hr/week, Practical Hr/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below.
For all other cse 5th sem syllabus for be 2017 scheme vtu you can visit CSE 5th Sem syllabus for BE 2017 Scheme VTU Subjects. For all other Professional Elective-1 subjects do refer to Professional Elective-1. The detail syllabus for advanced algorithms is as follows.
Module 1
Analysis Techniques: Growth functions, Recurrences and solution of recurrence equations; Amortized analysis: Aggregate, Accounting, and Potential methods, String Matching Algorithms: Naive Algorithm; Robin-Karp Algorithm, String matching with Finite Automata, Knuth-Morris-Pratt and Boyer-Moore Algorithms
Module 2
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Module 3
DFT and FFT efficient implementation of FFT, Graph Algorithms, Bellman-Ford Algorithm Shortest paths in a DAG, Johnson’s Algorithm for sparse graphs, Flow networks and the Ford-Fulkerson Algorithm, Maximum bipartite matching.
Module 4
Computational Geometry-I: Geometric data structures using, C, Vectors, Points, Polygons, Edges Geometric objects in space; Finding the intersection of a line and a triangle, Finding star-shaped polygons using incremental insertion.
Module 5
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Course Outcomes:
The students should be able to:
- Explain the principles of algorithms analysis approaches Apply different theoretic based strategies to solve problems Illustrate the complex signals and data flow in networks with usage of tools Describe the computational geometry criteria.
Question paper pattern:
- The question paper will have TEN questions.
- There will be TWO questions from each module.
- Each question will have questions covering all the topics under a module.
- The students will have to answer FIVE full questions, selecting ONE full question from each module.
Text Books:
- Thomas H. Cormen et al: Introduction to Algorithms, Prentice Hall India, 1990
- Michael J. Laszlo: Computational Geometry and Computer Graphics in C’ Prentice Hall India, 1996
Reference Books:
- E. Horowitz, S. Sahni and S. Rajasekaran, Fundamentals of Computer Algorithms, University Press, Second edition, 2007
- Kenneth A Berman & Jerome L Paul, Algorithms, Cengage Learning, First Indian reprint, 2008
For detail syllabus of all other subjects of BE Cse, 2017 regulation do visit Cse 5th Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.