# MAC - 925 - NIT Arunachal Pradesh ```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: [email protected] / [email protected]
Exercises Proposed for teaching in (Jan – May, 2016 Semester)
1. Name of the Teacher: Moumita Das
2. Department
Computer Science &amp; Engineering
3. Course Title
Design &amp; Analysis of Algorithm
4. Course code
MAC 925
5. Course Hands out (in reference to framed &amp; approved syllabus)
Contents
Hours
Asymptotic notation: time and space complexity, Big-O notation, omega, theta Notation, finding time 2hrs
complexity of algorithm: heap sort, quick sort, merge sort, searching etc.
Algorithm design technique: Recursion definition, use, limitation, Example: Hanoi Problem, 3hrs
tail recursion.
Divide and Conquer: Basic methods, use, example: binary search, heap sort, merge sort.
4hrs
Dynamic programming: Basic methods, use, example: matrix chain multiplication, all pair 4hrs
shortest paths, single source shortest path, travelling salesman problem.
Branch and Bound: basic methods, use example: 15 puzzle problem
3hrs
Backtracking: basic methods, use, example: eight queens problem, graph coloring problem, 3hrs
Hamiltonian problem
Greedy method: knapsack problem, job sequencing with deadlock, prims and kruskal algorithm, BFS
and DFS algorithm.
Lower bound theory: bounds on sorting and sorting techniques using partial and total orders, set
manipulation algorithm like UNION FIND, union by rank.
Matrix manipulation algorithm: different types of algorithm and solution of simultaneous equation,
DFT and FFT algorithm, inter multiplication scheme.
Notation of NP completeness: non deterministic algorithm, COOK’s theorem, P class, NP hard class,
NP complete class, CNF Satisfiability problem, Clique Decision Problem
Approximation algorithms: Necessity of approximation scheme, performance guarantee,
Polynomial time approximation schemes: 0/1 knapsack problem.
Total Class:
6. Books/Literature to be followed:
(a) Books (Min. 2 texts + 3 references)
(i)
Title
Author
Publisher
Edition
Introduction to Algorithm
T. H. Corman, C. E. Leiserson, R. L. Rivest, C. Stein
PHI
3rd Edition
(ii)
Title
Author
Design Methods and Analysis of Algorithms
S. K. Basu
4hrs
4hrs
5hrs
4hrs
4hrs
40hrs
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: [email protected] / [email protected]
Publisher
Edition
PHI
Second Edition]
(iii)
Title
Author
Publisher
Edition
Fundamental of Computer Algorithms
E. Horowitz, S. Sahani, S. Rajasekaran
Universities Press
2nd Edition
(iv)
Title
Author
Publisher
Edition
Design and Analysis of Algorithms
P. H. Dave, H. B. Dave
Pearson
3rd Edition
(v)
Title
Author
Publisher
Edition
Graph Theory
Narsingh Deo
PHI
3rd Edition
(b) Magazines/Journals:
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:
S.N. Bose
8. If the course is of practices, list the experiments to be offered.
(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)
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: [email protected] / [email protected]
(iii).
Brunch and Bound:
Implement 15 Puzzle Problems
(iv).
Backtracking:
Implement 8 Queen Problem
Graph Coloring Problem
Hamiltonian Problem
(v).
Greedy method:
Knapsack Problem
Minimum Cost Spanning Tree by Prim's Algorithm
Minimum Cost Spanning Tree by Kruskal's Algorithm
(vi).
Graph Traversal Algorithm: