Problem Solving in Computer Programming

Problem solving techniques algorithms.

Introduction to computers - Basics of C++ - Number representation, Basic data types int, float, double, char, bool, void.
Flow of Control - Conditional statements - If-else, Switch-case constructs, Loops - while,
do-while, for.
Functions - user defined functions, library functions, parameter passing - call by value,
call by reference, return values, Recursion.
Arrays - Single, Multi-Dimensional Arrays, initialization, accessing individual elements,
passing arrays as parameters to functions. Pointers and Dynamic Arrays Multidimensional Dynamic Arrays, creation and deletion of single and multi-dimensional
arrays.
C Strings, Standard String Class
I/O Streams, stream flags, stream manipulators, formatted I/O, binary I/O, Character I/O,
File
I/O - Opening, closing and editing files.
Structures and Classes - Declaration, member variables, member functions, access
modifiers, inheritance, function overloading, overriding, redefinition, virtual functions,
operator overloading, polymorphism - compile time and runtime binding.

Data Structure

Introduction to Data Structures

Asymptotic Notations, Theorems and Examples based on Asymptotic Notations
Linear and Non-linear Data Structures
Stack Data Structure and its Applications
Queue Data Structure and its Applications
Singly, Doubly and Circular Linked Lists
Trees and tree traversals
Dynamic Sets and Operations on Dynamic Sets
Binary Search Tree and its Operations
Heap Data Structure
Priority Queue
AVL Trees
Direct Addressing
Introduction to Hashing
Collision Resolution by Chaining
Collision Resolution by Open Addressing
Lower Bound for Comparison based Sorting Algorithms
Insertion Sort, Merge Sort, Quick Sort, Heap Sort and Counting Sort, Radix Sort
Introduction to Graphs and Representation of Graphs
Depth First Search (DFS), Breadth First Search (BFS), Applications: BFS and DFS,
Prims Algorithm for finding Minimum Spanning Tree (MST)
Kruskals Algorithm for finding MST
Dijkstras Algorithm for Single Source Shortest Paths
Floydd-Warshall Algorithm for All-Pairs Shortest Path Problem