Scribd
Upload
174 views

Advanced Algorithms - Cse-Cs

This document outlines the syllabus for an Advanced Algorithms course for a Master's program in Computer Science. The course objectives are to introduce students to advanced algorithm design and analysis methods, teach them to choose appropriate algorithms for problems, and familiarize them with data structures for algorithmic problems. The course outcomes are that students will be able to analyze algorithm complexity, choose suitable data structures, classify problems by complexity, and understand recent advances in algorithms. The course content covers topics like graph algorithms, matroids, graph matching, flow networks, matrix computations, shortest paths, modulo arithmetic, Fourier transforms, linear programming, and NP-completeness. References for further reading on algorithms are also provided.

Uploaded by

aarthi dev
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
174 views

Advanced Algorithms - Cse-Cs

This document outlines the syllabus for an Advanced Algorithms course for a Master's program in Computer Science. The course objectives are to introduce students to advanced algorithm design and analysis methods, teach them to choose appropriate algorithms for problems, and familiarize them with data structures for algorithmic problems. The course outcomes are that students will be able to analyze algorithm complexity, choose suitable data structures, classify problems by complexity, and understand recent advances in algorithms. The course content covers topics like graph algorithms, matroids, graph matching, flow networks, matrix computations, shortest paths, modulo arithmetic, Fourier transforms, linear programming, and NP-completeness. References for further reading on algorithms are also provided.

Uploaded by

aarthi dev
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

R19 M.TECH.

CSE/CS

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


M. Tech - CSE/CS – I Year – II Semester
Common to CSE and CS Syllabus

ADVANCED ALGORITHMS (Professional Core – III)

Pre-Requisites: UG level course in Algorithm Design and Analysis


Course Objectives:
 Introduce students to the advanced methods of designing and analyzing algorithms.
 The student should be able to choose appropriate algorithms and use it for a specific
problem.
 To familiarize students with basic paradigms and data structures used to solve advanced
algorithmic problems.
 Students should be able to understand different classes of problems concerning their
computation difficulties.
 To introduce the students to recent developments in the area of algorithmic design.

Course Outcomes: After completion of course, students would be able to:


 Analyze the complexity/performance of different algorithms.
 Determine the appropriate data structure for solving a particular set of problems.
 Categorize the different problems in various classes according to their complexity.
 Students should have an insight of recent activities in the field of the advanced data structure.

UNIT – I
Sorting:
Review of various sorting algorithms, topological sorting
Graph:
Definitions and Elementary Algorithms: Shortest path by BFS, shortest path in edge-weighted case
(Dijkasra's), depth-first search and computation of strongly connected components, emphasis on
correctness proof of the algorithm and time/space analysis, example of amortized analysis.

UNIT – II
Matroids:
Introduction to greedy paradigm, algorithm to compute a maximum weight maximal independent set.
Application to MST.
Graph Matching:
Algorithm to compute maximum matching. Characterization of maximum matching by augmenting
paths, Edmond's Blossom algorithm to compute augmenting path.

UNIT - III
Flow-Networks:
Maxflow-mincut theorem, Ford-Fulkerson Method to compute maximum flow, Edmond-Karp
maximum-flow algorithm.
Matrix Computations:
Strassen's algorithm and introduction to divide and conquer paradigm, inverse of a triangular matrix,
relation between the time complexities of basic matrix operations, LUP-decomposition.

UNIT - IV
Shortest Path in Graphs:
Floyd-Warshall algorithm and introduction to dynamic programming paradigm. More examples of
dynamic programming.

Page 24 of 55
R19 M.TECH. CSE/CS

Modulo Representation of integers/polynomials:


Chinese Remainder Theorem, Conversion between base-representation and modulo-representation.
Extension to polynomials. Application: Interpolation problem.
Discrete Fourier Transform (DFT):
In complex field, DFT in modulo ring. Fast Fourier Transform algorithm. Schonhage-Strassen Integer
Multiplication algorithm.

UNIT - V
Linear Programming:
Geometry of the feasibility region and Simplex algorithm
NP-completeness:
Examples, proof of NP-hardness and NP-completeness.
One or more of the following topics based on time and interest:
Approximation algorithms, Randomized Algorithms, Interior Point Method, Advanced Number
Theoretic Algorithm
Recent Trends in problem solving paradigms using recent searching and sorting techniques by
applying recently proposed data structures.

References:
1. "Introduction to Algorithms" by Cormen, Leiserson, Rivest, Stein.
2. "The Design and Analysis of Computer Algorithms" by Aho, Hopcroft, Ullman.
3. "Algorithm Design" by Kleinberg and Tardos.

Page 25 of 55

You might also like