Data Structure using “C”
Primitive Data types – Control statements – Aggregate data types – Input/Output preprocessor – Problem Solving Techniques – Flowchart – Algorithms- Arrays (Single Dimensional Arrays – Multi Dimensional Arrays) – Strings and functions – Pointer (Advantages of Pointer – Pointers and Arrays – Pointer and String – Pointer and Structures – Dynamic Memory Allocation – Garbage Collection) – File Handling – Bit Manipulation – Linked List (Introduction to Linked List – Linked List Implementation – Single, Double and Circular Linked List) – Stacks and Queues (Stacks using Array – Stacks using Linked List – Recursion with Stack – Queues – Types of Queues – Queues using Array – Queues using Linked List – Priority Queues) – Trees (Binary Tree – Tree Traversal – Binary Search Tree – Threaded Binary Trees – AVL Trees – Binary Heaps – Linear Search – Fibonacci Search – Indexed Sequential Search) – Graphs and Graphs Traversal – Sorting Techniques (Bubble Sort – Insertion Sort – Selection Sort – Shell Sort – Quick Sort – Merge Sort – Heap Sort – External Sort)
OOPS Using C++
Introduction to OOPS – Input & Output Streams – Classes & Objects – Member Functions – Function Overloading – Friend Functions & Classes – Operator Overloading – Constructor & Destructor – Inheritance – Polymorphism – File handling using Stream Classes – Instance – Templates.
Project
Academic Project done in this course can be used as final year college project.