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:
Lt AchyuthSarkar
2. Department:
Computer Science Engineering
3. Course Title:
Data Structure
4. Course code:
CSE-302
5. Course Hands out
Course content
Basic concept of data, structures and pointers.
Arrays: Representation, implementation, polynomial representation, limitations.
Strings: Representation, String operations, implementing string.h library functions.
Recursion - Design of recursive algorithms, Tail Recursion, When not to use recursion,
Removal of recursion.
Content
hours
3 Hrs
4 Hrs
Linked List: Static and dynamic implementation. Single, double, circular, multiple 4 Hrs
linked lists.
Stacks: Recursion and Stacks. Static and dynamic implementation.Expression
evaluation. Infix, postfix expressions, multiple stacks. Queues: Static and dynamic
implementation, circular queues, and implementation
5 Hrs
Hash Tables: Hash tables implementation. Hashing techniques, single, double.
Storage Management: Memory Management techniques, garbage collection.
5 Hrs
Trees:
Binary
trees,
binary
search
trees,
static
and
dynamic
implementation.AVLtree,B+ tree, B tree, tree operations, insert, delete, and search
5 Hrs
Heaps: Implementation, sorting etc.
Sorting and Searching: Different sorting techniques. Insertion sort, selection sort,
bubble sort, radix sort,quick sort, merge sort, heap sort
5 Hrs
File Structures - Sequential and Direct Access. Relative Files, Indexed Files- B+ tree 4 Hrs
as index, Multi-indexed Files, Inverted Files, Hashed Files.
Graphs: Representation of graphs, BFS, DFS sort.
5 Hrs
Total
40 Hrs
6. Books/Literature to be followed:
(a) Books (Min. 2 texts + 3 references)
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)
(ii)
(iii)
(iv)
(v)
(b)
1.
2.
3.
4.
5.
7.
8.
Title
Author
Publisher
Title
Author
Publisher
Title
Author
Publisher
Title
Author
Publisher
Title
Author
Publisher
Data Structure
Seymour Lipschutz,
Tata McGraw-Hill.
C & Data Structures
P. S. Deshpande, O. G. Kakde
Charles River Media, 2004
Data Structures and Algorithms in C++
Adam Drozdek
Cengage Learning
Data Structures and Algorithms
Aho Alfred V, Hopperoft John E., UIlman Jeffrey D
Addison Wesley, 1998
Algorithms, Data Structures, and Problem Solving with C++
Mark Allen Weiss
Addison-Wesley Publishing Company, 1996
Magazines/Journals (Minimum 5)
IEEE Transactions on Computers, IEEE, Computer Society, United State
ACM Transactions on Embedded Computing Systems (TECS), ACM, United State
Journal of Systems Architecture, Elsevier, Netherlands
Journal of Discrete Algorithms (JDA) , Elsevier, Netherlands
MSDN Magazine, Microsoft and 1105 Media, USA
Mode of Teaching: J C Bose Model
If the course is of practices, list the experiments to be offered.
1. Experiments should include but not limited to: Implementation of array operations.
2. Implementation of Stacks and Queues: adding, deleting elements Circular Queue: Adding
& deleting elements Merging Problem : Evaluation of expressions operations on Multiple
stacks & queues:
3.
Implementation of linked lists:
inserting, deleting, and inverting a linked list.
Implementation of stacks & queues using linked lists. E.g., Railway ticketing system, CD’s
in the case wearing bangles.
4. Implementation of polynomial addition, polynomial multiplication, sparse Matrices:
multiplication, addition. Recursive and Non recursive traversal of Trees
5. Implementation of threaded binary tree traversal.
6. Application of Trees. Application of sorting.
7. Implementation of different types of searching techniques like linear search, binary search
with real life analysis.
8. Hash tables implementation: searching, inserting and deleting, searching & sorting
techniques.
9. Implementation of recursive function using Tower of Hanoi.
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
10. Implementation of External memory data structure using B tree.
11. Implementation of AVL tree.
Are the manuals ready for the experiments to be conducted? YES
Yes/No (please tick)
If “No”, the reasons there of and fixing responsibility
__________________________________________
__________________________________________
__________________________________________
__________________________________________
Remarks/ Endorsement by the HoD
With his /her signature with date
Name of the Teacher: Lt AchyuthSarkar
Designation:Asst Prof CSE
Signature with Date: