Day 1:
Data Structure Basics

Day 2:
Basic Data Structure Handling, emergence of 1-d, 2-d, and m-d in   an pointer perspective.

Day 3:
Algorithm Analysis and Complexity theory with programming implementations

Day 4:
Abstract Data Type, ADT Style programming

Day 5:
Object oriented programming and it’s Implementation in creation of ADTs.

Day 6:
Memory Management based programming using Linked lists. Design of malloc( ), Calloc( ), realloc( ), free( )

Day 7:
Programming simulation of Garbage Collection, Compaction. Implementation of Best Fit, Worst Fit algorithm,

Day 8:
Process management based programming. Creation of dynamic multi level multi priority based scheduler. Process management in Dual core processor

Day 9:
Compiler implementation of Data Structure, Creation symbol table, linked dictionary, parse tree creation.

Day 10:
Tree Basics, BS- tree, Threaded Binary tree programming, AVL t   ree programming, B+ Tree programming,

Day 11:
Graph Theory and it’s programming implementation of adjacency matrix, adjacency list, path matrix, topological sorting, BFS, DFS, Shortest path algorithms.

Day 12: 
Advanced Sorting, Searching and  Hashing Based Programming.

Day 13:
Teaching Ethics and it’s nobelity, Teaching Methodologies

Apart from the above regular Cool Breeze research discussion panel will be carried out for bridging the gap between teaching and research.