Data structures study material

Data structures study material:

Click here to download the material

Steps to open the zip file :

1. Extract your zip file first
2. open index.html file in the data-structure folder

Unit I
Basic concepts-Data types, Abstact Data Types, Data structures, Algorithms, Performance analysis- time complexity and space complexity, Asymptotic Analysis-Big O, Omega and Theta notations, Basic concepts of STL(Standard Template Library)-Containers, Iterators, algorithms.
Introduction to Linear and Non Linear data structures ,Linear data structures- Linear Lists, Sequential and Linked allocation , The list ADT, array and linked Implementations, Singly Linked Lists-Operations-Insertion, Deletion, Doubly Linked Lists- Operations- Insertion, Deletion, Circularly linked lists.
Representation of single, two dimensional arrays, Sparse matrices and their representation.
Unit II
Stack ADT, definition, operations, array and linked implementations, applications-infix to postfix conversion, Postfix expression evaluation, recursion implementation, Queue ADT, definitions and operations ,array and linked Implementations, Circular queues, Insertion and deletion operations, Deque(Double ended queue)ADT, array and linked implementations.
Unit III
Non Linear data structures- Trees – Basic Terminology, Binary tree ADT, array and linked representations, traversals, threaded binary trees, Priority Queue ADT-implementation, Heaps.
Graphs – Introduction, Basic Terminology, Graph Representations- Adjacency matrix, Adjacency lists, Graph traversals- DFS and BFS
Unit IV
Searching- Linear Search, Binary Search, Hashing-Introduction, hash tables, hash functions, collision resolution methods, Comparison of Searching methods.
Sorting- Bubble Sort, Insertion Sort, Selection Sort, Radix Sort, Quick sort, Merge sort, Heap Sort Comparison of Sorting methods.
Unit V
Search Trees-Binary Search Trees, Definition, ADT, Implementation, Operations-
(w.e.f 2015-16)
Searching, Insertion and Deletion, AVL Trees(Definition and Example only),B-Trees, Definition, B-Tree of order m, operations- Insertion and Searching, Introduction to Red-Black and Splay Trees(Elementary treatment-only Definitions and Examples), Comparison of Search Trees.
Pattern matching algorithm- The Knuth-Morris-Pratt algorithm, Text Compression-Huffman coding algorithm, Tries (examples only).
TEXT BOOKS :
1. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Cengage Learning.
2. Data structures and Algorithm Analysis in C++, Mark Allen Weiss,3rd edition, Pearson
Education. Ltd.
3. Data structures, Algorithms and Applications in C++,S.Sahani, Universities Press.
REFERENCE BOOKS :
1. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and D.Mount, Wiley student edition,seventh edition, John Wiley and Sons.
2. ADTs,Data structures and Problem Solving with C++,2nd edition,L.Nyhoff,Pearson(Prentice Hall).
3. Data Structures using C++, D.S. Malik, Cengage Learning, India Edition.
4. Data structures with C++ Using STL, 2nd edition,W.H.Ford and W.R.Topp, Pearson (Prentice Hall).
5. Data Structures using C++,V.H.Patil, Oxford University Press.
6. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI.
7. Advanced Data structures & Algorithms in C++,V.V.Muniswamy,Jaico Publishing House
8. C++ Plus Data Structures,4th edition,Nell Dale,Jones and Bartlett India Pvt. Ltd.