Programming Fundamentals
(C, C++ and Data Structure)

Introduction to String, gets() & puts() functions, String handling functions, Structure, accessing structure members, size of structures, reading and displaying structure variables, array to structure, nested structures, self-referential structures, structure and functions, Union, enum keyword, typedef keyword, introduction to file handling, buffer and streams, working with text files and binary files, file operations using std library and system calls, file management I/O functions, random access files.

Introduction to C++, First C++ Program, How C++ differs from C, Variables Declaration, Function overloading, Optional Parameters, Reference Variables, Operator overloading, Basics of Console Input and Output, Constant Pointers, Dynamic Memory Allocation, Operators - arithmetic, assignment, logical, bitwise, Conditions like if / else / switch, Arrays / multi-dimensional arrays, Loops - for / while / do-while, Functions, overloading functions, passing variables to functions, Structures, References, Pointers, C++ programs & Practices.

Overview of OOPs Principles, Introduction to classes & objects, Creation & destruction of objects, Data Members, Member Functions, this Pointer, Constructor & Destructor, Static class member, Friend class and functions, Namespace, Introduction to inheritance and benefits, Access Specifier, Base and Derived class Constructors, Types of Inheritance, Down casting and up casting, Function overriding, Virtual functions, Destructor overriding, Polymorphism, Pure virtual functions, Virtual Base Class, C++ Class Hierarchy, File Stream, Text File Handling, Binary File Handling, Error handling during file operations, Overloading << and >> operators, Introduction to Exception, Benefits of Exception handling, Try and catch block, Throw statement, Pre-defined exceptions in C++, Writing custom Exception class, Stack Unwinding, C++ Templates, Function Templates, Class Templates.

Introduction :What is an algorithm, Data Structure and Types, Asymptotic Notations, Master Theorem, Divide and Conquer Algorithm. Data Structure : Stack, Queue, Types of Queues, Circular Queue, Priority Queue, Deque, Linked List, Linked List Operations, Types of Linked List, Hash Table, Heap Data Structure, Fibonacci Heap, Decrease Key and Delete node from Fibonacci Heap. Tree Based Data Structure : Tree Data Structure, Tree Traversal, Binary Tree, Full Binary Tree, Perfect Binary Tree, Complete Binary Tree, Balanced Binary Tree, Binary Search Tree, AVL Tree, B Tree, Insertion into B-tree, Deletion from B-tree, B+ Tree, Insertion on a B+ Tree, Deletion from a B+ Tree, Red Black Tree, Insertion in Red Black Tree, Deletion from Red Black Tree. Graph Based DSA : Graph Data Structure, Spanning Tree, Strongly Connected Components, Adjacency Matrix, Adjacency List, DFS Algorithm, Breadth-first Search, Bellman Ford's Algorithm. Sorting & Searching Algorithms : Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Counting Sort, Radix Sort, Bucket Sort, Heap Sort, Shell Sort, Linear Search, Binary Search. Greedy Algorithms : Greedy Algorithm, Ford-Fulkerson Algorithm, Dijkstra's Algorithm, Kruskal's Algorithm, Prim's Algorithm, Huffman Code. Dynamic Programming : Dynamic Programming, Floyd Warshall Algorithm, Longest Common Subsequence

After the completion of all the modules during this programming fundamentals training program, some projects would be assigned to you to improve your practical knowledge and project experiences.