 18001025661 / 8527794500
info@sgtuniversity.org

# Syllabus | B.Tech-Computer Science & Engineering | Analysis and Design of Algorithms

 Analysis and Design of Algorithms Learning Schedule L T P C Pre-requisites: Fundamental of C 3 0 0 3

COURSE DESCRIPTION

This course provides elementary introduction to algorithm design and analysis. It includes the topic: mathematics foundation, divided-and-conquer, dynamic programming, greedy method, NP-completeness complexity, approximation algorithm, random-ized algorithm, etc. At the end of this course student should be able to understand the concepts and skills of algorithm design, Implemental some well-known algorithms and analyze the performance of algorithms.

COURSE OBJECTIVES

The objective of this course is to learn:

1. Existing algorithm and develop efficient algorithms for simple computational tasks.
2. Reasoning about the correctness of the algorithm
3. Behaviours of algorithms and the notion of tractable and intractable problems.

COURSE OUTCOMES

At the end of the course student will be able to:

1. Analyze algorithms and determine efficiency of algorithm.
2. Understand advanced abstract data type (ADT), data structures and their implementations
3. Design algorithms using the brute force, greedy, divide and conquer, branch and bound etc. methodologies.
4. Prove problems of P, NP, or NP-Complete.
5. Develop and implement learned/new algorithm using appropriate techniques to solve problems.

COURSE CONTENT

Unit I: Introduction

Introduction : Algorithms, Analyzing algorithms, Complexity of algorithms, Growth of functions, Performance measurements, Sorting and order Statistics – Shell sort, Quick sort, Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear time.

Advanced Data Structures: Red-Black trees, B – trees, Binomial Heaps, Fibonacci Heaps.

Unit III : Divide & Conquer and Greedy Methods

Divide and Conquer with examples such as Sorting, Matrix Multiplication, Convex hull and Searching. Greedy methods with examples Huffman Coding, Knapsack, Minimum Spanning trees – Prim’s and Kruskal’s algorithms, Single source shortest paths – Dijkstra’s and Bellman Ford algorithms.

Unit IV: Dynamic Programming

Dynamic programming with examples such as Knapsack, All pair shortest paths –Warshal’s and Floyd’s algorithms, Resource allocation problem. Backtracking, Branch and Bound with examples such as Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of subsets.

Unit V

Algebraic computation, String Matching, Theory of NP-completeness, Approximation algorithms and Randomized algorithms.

TEXT BOOKS

1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of India.

REFERENCE BOOKS

1. RCT Lee, SS Tseng, RC Chang and YT Tsai, “Introduction to the Design and Analysis of Algorithms”, Mc Graw Hill, 2005.
2. Horowitz & S Sahni, “Fundamentals of Computer Algorithms”,
3. Berman, Paul,” Algorithms”, Cengage Learning.
4. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.