Lecture(s)

 Topic(s)

  1

Introduction To Data Structure

  2

Introduction to Algorithm

1.      Introduction

2.      Time/Space  Complexity

3.      Asymptotic Notations (O,Ω,θ)

  3-5

Stack

1. Introduction
2. Operations On stack
3. Representation of Stacks in Memory
4. Multiple Stacks
5. Applications of Stacks

a)      Parenthesis Checker

b)      Mathematical Notation Translation

6-8

Queue

1. Introduction
2. Operations On Queue
3. Representation of Queue in Memory
4. Priority Queue
5. Applications of Queue

9-12

Linked List

1. Introduction
2. Operations On  Linked List

a)      Traversing a List

b)      Searching an element

c)      Inserting an element

d)      Deleting an element

3. Representation of Linked List in Memory
4. Doubly Linked List
5. Applications

13-17

Tree

1.      Introduction

2.      Tree Terminology

3.      Binary tree

4.      Binary Search Tree

5.      Representation of Various Trees  in Memory

6.      Operations on trees

 Traversing

 Searching/ Inserting/Deleting an element etc

 Determining Height/ No. of  Nodes/ Mirror image of a tree etc 

 7. AVL tree

 8. Threaded Binary Tree   

 9.  Applications

18-22

Graphs

1.      Introduction

2.      Graph Terminology

3.      Representation of Various Graphs in Memory

4.      Operations on Graph

5.      Breadth First Search / Depth First Search / Topological Sort

6.      Minimum Cost Spanning Tree

7.      All pairs shortest path problem

8.      Applications

23-26

Heap

1.      Introduction

2.      Operations On Heaps

3.      Representation of Heaps in Memory

4.      Applications

27-30

Hash Table & Hashing

1.      Introduction

2.      Direct Address Table

3.      Hash Table

4.      Hash Function

5.      Collision &Various Methods for Resolving Collision

6.      Rehashing

7.      Applications

31-37

Searching & Sorting Algorithms

1.      Introduction

2.      Linear Search

3.      Binary Search

4.      Merge Sort

5.      Quick Sort

6.      Heap Sort

7.      Selection Sort

8.      Insertion Sort

9.      Bucket Sort

10.  Complexity (Time/Space) Analysis

38-39

Review