Syllabus

INTRODUCTION TO DATA STRUCTURE 
Types of Data Structure, Arrays, Strings, Recursion, ADT (Abstract Data type), Concept of Files, Operations with files, types of files

LINKED LIST 
Linked List as an ADT, Linked List Vs. Arrays, and Memory Allocation & De-allocation  for  a  Linked  List,  Linked  List  operations,  Types  of Linked  List, Implementation  of  Linked  List,  Application  of  Linked  List  polynomial,  sparse matrix

STACK 
The  Stack  as  an  ADT,  Stack  operation,  Array  Representation  of  Stack,  Link Representation of Stack, Application of stack – Recursion, Polish Notation

QUEUES
The Queue as an ADT, Queue operation, Array Representation of Queue, Linked Representation of Queue, Circular Queue, Priority Queue, & Dequeue, Application of Queues – Johnsons Algorithm, Simulation

TREES
Basic trees concept, Binary tree representation, Binary tree operation, Binary tree traversal, Binary search tree implementation, Thread Binary tree, The Huffman Algorithm, Expression tree, Introduction to Multiway search tree and its creation (AVL, B-tree, B+ tree) 

GRAPHS
Basic concepts, Graph Representation, Graph traversal (DFS & BFS)

SORTING
Sort Concept, Shell Sort, Radix sort, Insertion Sort, Quick Sort, Merge sort, Heap Sort, 

SEARCHING
List Search, Linear Index Search, Index Sequential Search Hashed List Search, Hashing Methods, Collision Resolution (One way and Two way); AVL tree balancing; B-tree; Application of trees.