Eligibility	PLUS 2
Duration	2 Months/ 120 Hrs/3 Hrs Per day
Fee Amount	Rs. 5,000/-

SYLLABUS

Module I
Introduction to programming methodologies – structured approach, stepwise refinement
techniques, programming style, documentation – analysis of algorithms: frequency count,
definition of Big O notation, asymptotic analysis of simple algorithms. Recursive and iterative
algorithms.
Module II
Abstract and Concrete Data Structures- Basic data structures – vectors and arrays. Applications,
Linked lists:- singly linked list, doubly linked list, Circular linked list, operations on linked list,
linked list with header nodes, applications of linked list: polynomials,.
Module III
Applications of linked list (continued):-Memory management, memory allocation and deallocation.
First-fit, best-fit and worst-fit allocation schemes Implementation of Stacks and
Queues using arrays and linked list, DEQUEUE (double ended queue). Multiple Stacks and
Queues, Applications.
Module IV
String:-representation of strings, concatenation, substring searching and deletion. Trees:- m-ary
Tree, Binary Trees – level and height of the tree, complete-binary tree representation using
array, tree traversals (Recursive and non-recursive), applications. Binary search tree – creation,
insertion and deletion and search operations, applications.
Module V
Graphs – representation of graphs, BFS and DFS (analysis not required) applications. Sorting
techniques – Bubble sort, Selection Sort, Insertion sort, Merge sort, Quick sort, Heaps and Heap
sort. Searching algorithms (Performance comparison expected. Detailed analysis not required)
Module VI
Linear and Binary search. (Performance comparison expected. Detailed analysis not required)
Hash Tables – Hashing functions – Mid square, division, folding, digit analysis, collusion
resolution and Overflow handling techniques.