NATIONAL INSTITUTE OF TECHNOLOGY, ARUNACHAL PRADESH, YUPIA, Pin-791112
(Established by MHRD, Govt. of India)
Website : www.nitap.in, Fax No: (0360) 2284972
E-Mail: nitarunachal@gmail.com / admin@nitap.in
Exercises Proposed for teaching in (July – December, 2015 Semester)
1. Name of the Teacher: Dr. Swarnendu Kr. Chakraborty
2. Department:
Computer Science and Engineering
3. Course Title:
Design and Analysis of Algorithm
4. Course code:
CSE - 502
5. Course Hands out
Course contents
Contact hours
Models of computation: RAM, TM etc. time and space complexity Asymptotic
4 hrs.
Notation: Big-O, omega, theta etc.; finding time complexity of well known algorithms
like- heap sort, search algorithm etc.
Algorithm Design techniques: Recursion- Definition, Use, Limitations, and Examples:
Hanoi problem. Tail Recursion
Divide and Conquer: Basic method, use, Examples: Merge sort, Quick Sort, Binary
Search
Dynamic Programming: Basic method, use, Examples: matrix-chain multiplication, all
pair shortest paths, single-source shortest path, travelling Salesman problem
Branch and Bound: Basic method, use, Examples: The 15-puzzle problem
Backtracking: Basic method, use, Examples: Eight queens problem, Graph coloring
problem, and Hamiltonian problem
Greedy Method: Basic method, use, Examples: Knapsack problem, Job sequencing
with deadlines, minimum spanning tree (Prim's and Kruskal's algorithms)
Lower Bound Theory: Bounds on sorting and sorting techniques using partial and
total orders.
Disjoint Set Manipulation: Set manipulation algorithm like UNION-FIND, union by
rank, Path compression.
Properties of graphs and graph traversal algorithms: BFS and DFS
Matrix manipulation algorithms: Different types of algorithms and solution of
simultaneous equations, DFT & FFT algorithm; integer multiplication schemes
Notion of NP-completeness : Non deterministic algorithm, COOK’s theorem, P class,
NP-hard class, NP-complete class, CNF Satisfiability problem, proof a problem to be
NP hard, Clique Decision Problem.
Approximation algorithms : Necessity of approximation scheme, performance
guarantee, Polynomial time approximation schemes: 0/1 knapsack problem
6. Books/Literature to be followed:
(a) Books (Min. 2 texts + 3 references)
(i)
Title
Introduction to Algorithm
3 hrs.
3 hrs.
4 hrs.
3 hrs.
3 hrs.
3 hrs.
4 hrs.
3 hrs.
3 hrs.
4 hrs.
3 hrs.
NATIONAL INSTITUTE OF TECHNOLOGY, ARUNACHAL PRADESH, YUPIA, Pin-791112
(Established by MHRD, Govt. of India)
Website : www.nitap.in, Fax No: (0360) 2284972
E-Mail: nitarunachal@gmail.com / admin@nitap.in
Author
Publisher
Edition
T. H. Corman, C. E. Leiserson, R. L. Rivest, C. Stein
PHI
Third Edition
(ii)
Title
Author
Publisher
Edition
Fundamental of Computer Algorithms
E. Horowitz, S. Sahani, S. Rajasekaran
Universities Press
Second Edition
(iii)
Title
Author
Publisher
Edition
Design Methods and Analysis of Algorithms
S. K. Basu
PHI
Second Edition
(iv)
Title
Author
Publisher
Edition
Design and Analysis of Algorithms
P. H. Dave, H. B. Dave
Pearson
-------
(v)
Title
Author
Publisher
Edition
Graph Theory
Narsingh Deo
PHI
---------
(b) Magazines/Journals (Minimum 5)
(i). Slaves to the algorithm - Aeon Magazine
(ii). Algorithm Articles - Offshore Magazine
(iii). Journal of Algorithms, Elseviers, Netherland
(iv). Algorithms — Open Access Journal, MDPI, Basel, Switzerland
(v).
TIT - IEEE Transactions on Information Theory, IEEE Computer Society,
United State
(vi). SIAMCOMP,- Siam Journal on Computing
7. Mode of Teaching: J.C Bose/S. N. Bose (please tick).
S. N. Bose
7. If the course is of practices, list the experiments to be offered.
NATIONAL INSTITUTE OF TECHNOLOGY, ARUNACHAL PRADESH, YUPIA, Pin-791112
(Established by MHRD, Govt. of India)
Website : www.nitap.in, Fax No: (0360) 2284972
E-Mail: nitarunachal@gmail.com / admin@nitap.in
(i).
Divide and Conquer:
Implement Binary Search using Divide and Conquer approach
Implement Merge Sort using Divide and Conquer approach
Implement Quick Sort using Divide and Conquer approach
Find Maximum and Minimum element from a array of integer using Divide and Conquer
approach
(ii).
Dynamic Programming:
Find the minimum number of scalar multiplication needed for chain of matrix
Implement all pair of Shortest path for a graph ( Floyed Warshall Algorithm )
Implement Travelling Salesman Problem
Implement Single Source shortest Path for a graph ( Dijkstra , Bellman Ford)
(iii).
Brunch and Bound:
Implement 15 Puzzle Problems
(iv).
Backtracking:
Implement 8 Queen Problem
Graph Coloring Problem
Hamiltonian Problem
(v).
Greedy method:
Knapsack Problem
Job sequencing with deadlines
Minimum Cost Spanning Tree by Prim's Algorithm
Minimum Cost Spanning Tree by Kruskal's Algorithm
(vi).
Graph Traversal Algorithm:
Implement Breadth First Search (BFS)
Implement Depth First Search (DFS)
Are the manuals ready for the experiments to be conducted?
Yes
Remarks/ Endorsement by the HoD
With his /her signature with date
Name of the Teacher: Dr. Swarnendu Kr. Chakraborty
Designation:
Assistant Professor
Signature with Date: