MODULE- I 

• Introduction to Data Structures

• Getting start with Data Structures

MODULE- I 

• Mathematical Background

• Process of Analysis

• Calculation of Storage Complexity

• Calculation of Run Time Complexity

MODULE- I 

• Arrays and Pointers

• Sparse Matrices

• Polynomials

• Representation of Arrays

• Row Major Representation

• Column Major Representation

• Applications

• Representation of single and multidimensional arrays in Code Blocks

MODULE- I 

• Linked List and it's types and applications

• Linked List implementation using array

• Implementation of Doubly Linked List

• Implementation of Circularly Linked Lists

MODULE- I 

• Stack and it's characteristics

• STL

• application of stack

MODULE- I 

• Implementation of Stack

• Implementation of Stack using array

• Implementation of stack using Linked List

MODULE- I 

• Queues and it's characteristics

• Types

• Application of queue

MODULE- I 

• Implementation of Queue

• Array Implementation

• Linked List Implementation of Queue

• Implementation of circular queues(Array)

• Implementation of circular queues(Linked List)

MODULE- I 

• Implementation of Deque(array)

MODULE- I 

• Tree intro and it's type and application

• Tree traversal methods

• Tree and it's implementation

MODULE- I 

• Intro to Binary Trees, and it's applications

• Implementation of Binary Tree

• Recursive Implementation of Binary Tree Traversals

• Non Recursive Implementations of Binary Tree

• Intro to Binary Search Tree

• Traversing a BST

MODULE- I 

• Insertion in BST

• Deletion in BST

MODULE- I 

• Intro and balancing in AVL, application

• Implementation AVL insertion

• Deletion in AVL

MODULE- I 

• Intro and how it's different from Tree

• Graph traversal methods

• Shortest Path Algorithms, Dijkstra’s Algorithm

• Graphs with Negative Edge costs,

• Acyclic Graphs,

• All Pairs Shortest Paths Algorithm

• Minimum cost Spanning Trees

• Kruskal’s Algorithm

• Prims’s Algorithm

• Finding Strongly Connected Components

MODULE- I 

• Linear Search

• Binary Search

• Applications of types of search

MODULE- I 

• Internal Sorting

• Insertion sort

• Insertion Sort

• Bubble Sort

• Quick Sort

• 2 Way Merge sort

• Sorting on Several Key

MODULE- I 

• Splay Tree Intro

• Splaying Steps and Algorithm

• Red Black Trees and Properties

• Insertion in Red Black tree

• Deletion in Red black Tree

MODULE- I 

• Terminology

• File Organisation

• Sequential Files

• Structure

• Operations

• Disadvantages

• Areas of use

• Direct File Organisation

• Indexed Sequential File Organisation