head

Home

Syllabus

Lesson Plan

Guest Lectures

Technical Advisory

Organizers

Contact

 

 

 

SYLLABUS

   

 

Unit-1: Data Structure Foundations

Pointer Basics, Pointer Arithmetic, Memory Models, Pointer Types

Unit-2: Basic Data Structures

Basic Data Structure Handling, emergence of 1-d, 2-d, and m-d in   an pointer perspective., Dynamic Allocation operations

Basic Data Structure Handling, emergence of 1-d, 2-d, and m-d in   an pointer perspective., Dynamic Allocation operations

Unit-3: Algorithm Analysis Basics

Algorithm Analysis and Complexity theory fundamentals

Abstract Data Type, ADT Style programming

Unit-4: Introduction to Object Oriented Programming
Object oriented programming and it’s Implementation in creation of ADTs.

Unit-5: Operating System Basics & It’s Programming Implementations

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

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

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

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

Unit-6: Non-Linear Data Structure and it’s Applications

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

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

Unit-7: Data Organization

Advanced Sorting, Searching and  Hashing Based Programming.

 
hh