ADS(online content)

UNIT-I: Linked Lists

1. Introduction to Data Structures

[Lecture Notes] [PPT] [VideoLecture]

2. Introduction to Linked List

[Lecture Notes] [PPT] [Video Lecture]

3. Single Linked list_insertion_deletion

[Lecture Notes] [PPT] [Video Lecture]

4. Single Linked list_additional_operations

[Lecture Notes] [PPT] [Video Lecture]

5.Doubly Linked List_insertion

[Lecture Notes] [PPT] [Video Lecture]

6. Doubly Linked List_deletion

[Lecture Notes] [PPT] [Video Lecture]

7.Circular Linked list_insertion

[Lecture Notes] [PPT] [Video Lecture]

8.Circular Linked list_deletion

[Lecture Notes] [PPT] [Video Lecture]

9. Polynomials with Linked List_Representation

[Lecture Notes] [PPT] [Video Lecture]

10. Polynomial operations with Linked List

[Lecture Notes] [PPT] [Video Lecture]

UNIT-II: TREES

1. Introduction to Trees

[Lecture Notes] [PPT] [Video Lecture]

2. Introduction to Binary Trees

[Lecture Notes] [PPT] [Video Lecture]

3. Binary Tree Traversals

[Lecture Notes] [PPT] [Video Lecture]

4. Threaded Binary Trees

[Lecture Notes] [PPT] [Video Lecture]

5. Introduction to Binary Search Trees

[Lecture Notes] [PPT] [Video Lecture]

6. Binary Search_insertion_deletion

[Lecture Notes] [PPT] [Video Lecture]

7. Binary Search Tree Traversals

[Lecture Notes] [PPT] [Video Lecture]

8. Priority Queue

[Lecture Notes] [PPT] [Video Lecture]

9. Introduction to Binary Heap

[Lecture Notes] [PPT] [Video Lecture]

10. Binary Heap Implementation

[Lecture Notes] [PPT] [Video Lecture]

11.Heap Sort

[Lecture Notes] [PPT] [Video Lecture]

UNIT-III: ADVANCED TREES

1. Balanced Search Trees (AVL TREES)

[Lecture Notes] [PPT] [Program]

2. Red Black Trees

[Lecture Notes] [PPT1] [PPT2]

3. Splay Trees

[Lecture Notes] [PPT]

4. Tries and Suffix Arrays

[Lecture Notes] [PPT]

5. Introduction to B-Trees

[Lecture Notes] [PPT]

6. Operations on B Trees.

[Lecture Notes] [PPT]

UNIT-IV: Graphs

1. Introduction to Graphs

[Lecture Notes] [PPT]

2. Graph Representations

[Lecture Notes] [PPT]

3. Basic operations of Graphs

[Lecture Notes] [PPT]

4.Topologocal sort

[Lecture Notes] [PPT]

5.Graph Traversals

[PPT1] [PPT2]

6.Aplications of DFS

[PPT]

7. Spanning Trees

[Lecture Notes] [PPT1] [PPT2]

UNIT-V:

1.Hashing

[Lecture Notes] [PPT]

2.Collision Handling techniques

[Lecture Notes] [PPT]

3. External Sorting

[Lecture Notes] [PPT]

4. pattern Matching(Naive)

[Lecture Notes] [PPT]

5. KMP

[Lecture Notes] [PPT]

6. RK Algorithm

[Lecture Notes] [PPT]