Advanced Algorithms Detailed Syllabus for Web Technology M.Tech first year first sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.
The detailed syllabus for Advanced Algorithms M.Tech 2017-2018 (R17) first year first sem is as follows.
M.Tech. I Year I Sem.
Course Objectives:
- The fundamental design, analysis, and implementation of basic data structures.
- Basic concepts in the specification and analysis of programs.
- Principles for good program design, especially the uses of data abstraction.
- Significance of algorithms in the computer field
- Various aspects of algorithm development
- Qualities of a good solution
Unit – I : Introduction – Role of algorithms in computing, Analyzing algorithms, Designing Algorithms, Growth of Functions, Divide and Conquer- The maximum-subarray problem, Strassen’s algorithms for matrix multiplication, The substitution method for solving recurrences, The recurrence-tree method for solving recurrence, The master method for solving recursions, Probabilistic analysis and random analysis.
Unit – II: Review of Data Structures- Elementary Data Structures, Hash Tables, Binary Search Trees, Red-Black Trees.
Unit – III: Dynamic Programming – Matrix-chain multiplication, Elements of dynamic programming, Longest common subsequence, Greedy Algorithms – Elements of the greedy strategy, Huffman codes, Amortized Analysis – Aggregate analysis, The accounting method, The potential method, Dynamic tables.
Unit – IV: Graph Algorithms – Elementary Graph Algorithms, Minimal spanning trees, Single-Source Shortest Paths, Maximum flow.
Unit – V: NP-Complete & Approximate Algorithms-Polynomial time, Polynomial-time verification, NP-completeness and reducibility, NP-complete & approximation problems – Clique problem, Vertexcover problem, formula satisfiability, 3 CNF Satisfiabilty, The vertex-cover problem, The travelingsalesman problem, The subset-sum problem.
TEXT BOOKS:
- “Introduction to Algorithms”, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Third Edition, PHI Publication.
- “Data Structures and Algorithms in C++”, M.T. Goodrich, R. Tamassia and D.Mount, Wiley India.
REFERENCES:
- Fundamentals of Computer Algorithms, Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Second Edition, Galgotia Publication
- Data structures with C++, J. Hubbard, Schaum’s outlines, TMH.
- Data structures and Algorithm Analysis in C++, 3rd edition, M. A. Weiss, Pearson.
- Classic Data Structures, D. Samanta, 2nd edition, PHI.
For all other M.Tech 1st Year 1st Sem syllabus go to JNTUH M.Tech Web Technology 1st Year 1st Sem Course Structure for (R17) Batch.
All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.
Do share with friends and in case of questions please feel free drop a comment.