ECE503 Design and Analysis of Algorithm L T P C

3 0 0 3

Version: 1.10

Objectives:

To develop proficiency in problem solving and programming.

To be able to carry out the Analysis of various Algorithms for mainly Time and Space Complexity.
To get a good understanding of applications of Data Structures.

Expected Outcomes:

Ability to decide the appropriate data type and data structure for a given problem.
Ability to select the best algorithm to solve a problem by considering various problem
characteristics, such as the data size, the type of operations, etc.
Ability to compare algorithms with respect to time and space complexity

Unit I Introduction 7 hours

The role of Algorithms in Computing, Insertion Sort, Analyzing algorithms, Designing algorithms,
Asymptotic notations, Divide and Conquer Technique - The substitution method for solving recurrences,
The recursion tree method for solving recurrences, The master method for solving recurrences.

Unit II Advanced Algorithmic Analysis 10 hours

Amortized analysis; Online and offline algorithms; Randomized algorithms; Dynamic
programming; combinatorial optimization.
Unit III Cryptographic Algorithms 10 hours
Historical overview of cryptography; Private-key cryptography and the key-exchange problem;
Public-key cryptography; Digital signatures; Security protocols; Applications (zero-knowledge proofs,
authentication etc..).
Unit IV Geometric Algorithms 8 hours
Line segments: properties, intersections; convex hull finding algorithms.

Unit V Parallel and Distributed Algorithms 10 hours

PRAM model; Exclusive versus concurrent reads and writes; Pointer jumping; Brents theorem
and work efficiency.
DISTRIBUTED ALGORITHMS: Consensus and election; Termination detection; Fault tolerance;
Stabilization.
Reference Books:

1. Aho et al, The design and analysis of computer algorithms, Addision Wesley.
2. M. J. Quinn, Parallel computing theory and practice, McGraw Hill 2nd edition, 2008
3. M. J. Quinn, Designing efficient algorithms for parallel computers, McGraw Hill.
4. Cormen, Leiserson, Rivest and Stein , Introduction to Algorithms, 3rd edition, McGraw-Hill
(2009)
5. Anany Levitin, Introduction to the Design and Analysis of Algorithms. 3rd edition., Addison
Wesley (2011)

Mode of Evaluation: CAT- I & II, Assignments/ Quiz, Term End Examination.

Date of Approval : 16.6.2015