Syllabus:
Internal data representation; Abstract data types; Elementary data structures: arrays, lists, stacks, queues, trees, graphs; Advanced data Structures: heaps, Fibonacci heaps, B-trees; Recursion, sorting, searching, hashing, storage management.
Mid Exam will be consisted of class (1-3). Solve tutorial, do assignment and read all the terms in class (1-3)
Final Exam will be consisted of class (4-7). Solve tutorial, do assignment and read all the terms in class (4-7)
Class
- Introduction to Data Structure (Part 1)- [ PDF ] [ WORD ] [ PPT-1 ]
- Introduction to Data Structure ( Part 2) - [ PPT-2 ]
- Data structures - Array - [ PPT ]
- Data Structures - Linked List - [ PPT ]
- Data Structures - Stack - [ PPT ]
- Data Structures - Tree - [ PPT ]
- Data Structures - Stack Recursion , Tower of Hanoi - [ PPT ]
Textbooks
- Introduction to Data Structures in C by Ashok N. Kamthane
- Data Structures and Algorithms by A. V. Aho, J. E. Hopcroft, J. D. Ullman
- Data Structures Using C and C++ by Y. Langsam, M. J. Augenstein, A. M. Tenenbaum
- Algorithms in C++ by Robert Sedgewick