C,C++, Data Structures Course in Kothrud Pune

• Basics of Computer and programming: computer fundamentals, programming language means, history of programming languages, different programming languages in the market, and their application. Different types of languages and different coding approaches, Introduction to language processor and IDE, C program Execution, Importance of C Programming, C programming extracts

  C Programming Fundamentals: how to learn C, welcome program, Character set, the concept of ASCII, Constant, keyword and Variable, C data types and concept of range, different types of instructions, Declaration of variable, simple data input-output using printf() and scanf(), escape sequence characters 

  Operators in C:  Introduction to different operators in c, Assignment operators, unary operators, Arithmetic operators, relational operators, logical operators, conditional operators, bitwise operators, special operators

  Control Statements: Conditional control statements, decision control statements: if(), if() else, Nesting, ladder, Loops for()  While() do while(), and switch case, Unconditional control statement: goto, break, continue and return

  Array in C: Introduction to the array, need of array, declaration, and initialization of an array, using single dimension array, searching and sorting techniques, using a two-dimensional array, some matrix operations,

  Pointer in C: need of pointer, Declaration of the pointer, a pointer to a simple type, a pointer to 1D Array, pointer arithmetic, dynamic memory allocation using malloc(), realloc(), calloc(),  and memory release using free(), pointer to pointer, Array of the pointer, block pointer, a pointer to a function, different types of pointer

  Function in C: Need of function, declaration of a function, the concept of a library, package and module, different types of function, User-defined Functions: simple function, function with and without arguments, function with and without returning type, recursion, passing and returning the different variable of built-in types and array, passing and returning the pointer, a pointer to a function, Built-in Functions: some library functions from Math.h, Stdlib.h, Complex.h, dos.h etc, Storage class: auto, static, register, extern

  Structure in C: Need of structure, Declaration of structure, the variable of structure, Array of Structure variables, Pointer to structure variables, Dynamic memory allocation for structure, passing and returning the structure variable, passing and returning the structure pointer, variable of built-in types as a member of a structure, an array as a member of a structure, pointer variable as a member of a structure, self-referable structure

  File handling in C: concept of file and database, need, Introduction to FILE structure, opening and closing the file, different modes of an opening file, read/write operation in a file, different file operations

  Graphics in C: concept of file and database, need, Introduction to FILE structure, opening and closing the file, different modes of the opening file, read/write operation in the file, different file operations

Introduction to OOP and C++ Programming: Different programming Approaches and  importance of object-oriented programming, characteristics of POP and OOP, Basic Concepts in oop – Class object, data hiding, encapsulation, Abstraction, Application Areas Of OOP

Basics of C++ Programming: Skeleton of C++ program, IO using cin>> and cout<<, the concept of tokens, C++ data types, Operators in C++, operator precedence, Control statements review, which and how some concepts of C behave differently in C++ 

Function in C++: Function review, how normally it is written in C++, inline function, Function call bypassing the default arguments, function call by passing const arguments, function overloading

Class and Object: defining the class and object, knowing the OOP concepts practically, private and public members of the class, and defining the member function inside and outside of class. Passing and returning data of different types to/from member function, Array and the pointer as a member of the class, private member function and nesting of the member function, Array of objects, Dynamic memory allocation for Objects, passing and returning the object to/from member function, static data members and static member function, friend functions, a pointer to class members, local classes

Constructors and Destructors: Need and use of constructors, rules of defining constructors, different types of constructors, default constructor, parameterized constructor, dynamic constructor, copy constructor, passing default argument to constructor, destructors

Operator Overloading: Why to overload the operator, rules for overloading the operator, defining the operator<op>() function, unary operator overloading, Binary operator overloading, Overloading both unary and binary operators using a friend

Inheritance: Definition of inheritance, syntax, the concept of base and derived class, different types of inheritances, single inheritance, multi-level inheritance, hierarchical inheritance, multiple inheritances, hybrid inheritance, using the protected visibility modifier, function overloading, and function overriding in inheritance, defining constructors in inheritance, Ambiguity error in inheritance, the solution to ambiguity error,  virtual base class, abstract class in C++, nesting of classes

Polymorphism: definition of polymorphism, types of polymorphism, pointer review, a pointer to object, this pointer, a pointer to the derived class, virtual and pure virtual function

Console and File IO in C++: Introduction standard library and different IO streams, different console and file operations

Templates: Introduction to templates, syntax, class templates, and function templates

Introduction: Algorithms as opposed to programs, Fundamental questions about algorithms, Data structures, abstract data types, design patterns, Textbooks, and web resources, Overview

Arrays, Iteration, Invariants: Arrays, Loops and Iteration, Invariants

Lists, Recursion, Stacks, Queues: Linked Lists, Recursion, Stacks, Queues, Doubly Linked Lists, Advantage of Abstract Data Types

Searching: Requirements for searching, Specification of the search problem, A simple algorithm: Linear Search, A more efficient algorithm: Binary Search

Efficiency and Complexity: Time versus space complexity, Worst versus average complexity, Concrete measures for performance, Big-O notation for complexity class, Formal definition of complexity classes

Trees: General specification of trees, Quad-trees, Binary trees, Primitive operations on binary trees, The height of a binary tree, The size of a binary tree, Implementation of trees, Recursive algorithms

Binary Search Trees: Searching with arrays or lists, Search keys, Binary search trees, Building binary search trees, Searching a binary search tree, Time complexity of insertion and search, Deleting nodes from a binary search tree, Checking a binary tree is a binary search tree, Sorting using binary search trees, Balancing binary search trees, Self-balancing AVL trees, B-trees.

Priority Queues and Heap Trees: Introduction, need, Trees stored in arrays, Priority queues and binary heap trees, Basic operations on binary heap trees, Inserting a heap tree node, Deleting a heap tree node, Building a new heap tree from start, Merging binary heap trees, Binomial heaps, Fibonacci heaps, Comparison of heap time complexities

Sorting: The problem of sorting, Common sorting strategies, How many comparisons must it take? Bubble Sort, Insertion Sort, Selection Sort, Comparison of O(n2), sorting algorithms, Sorting algorithm stability, Tree sort, Heapsort, Divide and conquer algorithms, Quicksort, Merge sort, Summary of comparison-based sorting algorithms, Non-comparison-based sorts, Bin, Bucket, Radix Sorts

Hash Tables: Storing data, The Table abstract data type, Implementations of the table data structure, Hash Tables, Collision likelihoods and load factors for hash tables, A simple Hash Table in operation, Strategies for dealing with collisions, Linear Probing, Double Hashing, Choosing good hash functions, Complexity of hash tables

Graphs: Graph terminology, Implementing graphs, Relations between graphs, Planarity, Traversals – systematically visiting all vertices, Shortest paths – Dijkstra’s algorithm, Shortest paths – Floyd’s algorithm, Minimal spanning trees, Travelling Salesmen and Vehicle Routing