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: Subhasish Banerjee
2. Department:
Computer Science and Engineering
3. Course Title:
Advanced Data Structure &Algorithm
4. Course code:
MCSE - 911
5. Course Hands out (in reference to framed & approved syllabus) (maximum 500 words)
____________________________________________________________________
Course Content
Contact Hours
Unit I:
Asymptotic complexity and analysis, dynamic data structures and their
10 hrs
applications: stack, queue, tree, graph.
Unit II:
Sorting techniques complexity analysis, dynamic graphs, data structures
for memory optimization.
10 hrs
Unit III:
Dynamic programming: matrix chain multiplication, Greedy Paradigm,
Graph algorithms: Strongly connected components, single source
shortest paths, all pairs shortest path, Travelling salesman problems,
Graph colouring; Amortized analysis.
10 hrs
Unit IV:
Matrix operations: Linear equations solver; Polynomials and FFT;
Internet algorithms; String matching algorithms: Naïve approach,
Rabin-Karp algorithm, Knuth-Moris pratt algorithm, Approximation
algorithms; Local search heuristics; Randomized algorithms.
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
Prentice Hall of India
Third Edition
10 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
(ii)
Title
Author
Publisher
Edition
Fundamental of Computer Algorithms
E. Horowitz, S. Sahani, S. Rajasekaran
Universities Press
Second Edition
(iii)
Title
Author
Publisher
Edition
Data Structure using C and C++
Y. Langsam, M. J. Augensteir, A. M. Tenenbaum
Prentice Hall of India
Second Edition
(iv)
Title
Author
Publisher
Edition
Design and Analysis of Algorithms
P. H. Dave, H. B. Dave
Pearson
First Edition
(v)
Title
Author
Publisher
Edition
Data structure
Seymour Lipschutz
Tata McGraw-Hill (Schaum’s Outline)
First Edition
(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).
J. C. Bose
8. If the course is of practices, list the experiments to be offered.
(i). Write a menu drive programme to perform various operations in Stack and Queue using
Linked list.
(ii). Write a menu drive program to store the Polynomial functions and perform the
operation like addition, subtraction and multiplication using linked list.
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
(iii).
(iv).
(v).
(vi).
(vii).
(viii).
(ix).
(x).
Write a program to store the Sparse Matrices and perform the operation Multiplication,
addition, etc.
Write a menu drive programme to traverse a binary tree in Inorder, Preorder and
Postorder in Recursive and Non recursive ways.
Write a program to create the Threaded binary tree and perform the traversals.
Write a menu drive program to Sort the elements in Heap Sort, Insertion Sort, Selection
Sort techniques.
Write a program to sort the integer elements by using Divide and Conquer paradigm.
(eg. Merge Sort, Quick Sort).
Write a program to find the optimized solution of Matrix Chain Multiplication.
Write a program to find the all pairs Shortest Path of weighted graph.
Write the programs to find the optimal solutions of Travelling Salesman Problem, single
Source Shortest path, Graph coloring.
And many more from the rest part of the syllabus which will be covered in lectures.
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: Subhasish Banerjee
Designation:
Assistant Professor
Signature with Date: