Course details

C, C++, Data Structure

Fundamentals & Introduction of Programming

  • Programming Tools
  • Algorithm
  • Flow Chart
  • Pseudo code
  • History and Features of C
  • Compilation
  • IDE
  • Data Types
  • Literals
  • Variable
  • Structure of ā€˜Cā€™ Program
I/O & Storage Specifiers

  • printf0 and scanf()
  • Operators
  • Comments
  • Type Casting
  • auto, const, static, register, extern
Branching & Looping

  • if()
  • Nested if()
  • Ladder if()
  • break & continue
  • switch()
  • while()
  • do _ while()
  • for()
  • Infinite Loop
  • Nested Loop
Character & String Handling

  • ASCII code
  • Character arithmetic
  • Character functions
  • Arithmetic Function
  • String I/O operations
  • String library functions
Array, Structure and Union

  • Single Dimensional Array
  • Double Dimensional Array
  • Multidimensional Array
  • Array Initialization
  • Enumeration
  • Defining structure
  • structure initialization
  • nested structure
  • Difference between structure and union
Pointers

  • Introduction
  • Pointers arithmetic
  • Pointers & Array
  • Pointers & Structure
  • Pointers & String
  • Pointer to Pointer
User Defined Function

  • Function Prototype
  • function with argument function with returning value
  • Local and Global Variables
  • Scope of Variable
  • Life of Variables
  • Argument & Return of Array
  • Pointer and String
  • Call by Value
  • Call by Address
  • Recursive Function
Dynamic Memory Allocation & Preprocessors

  • malloc()
  • calloc()
  • realloc()
  • free()
  • #include
  • #define
Data File Handling & Graphics

  • Character & String I/O
  • Formatted & Structured I/O
  • initgraph()
  • closegraph()
  • Drawing line, circle, rectangle, polygon etc,
  • colors, line style, fill style
Join Us
Introduction to C++ I/O Objects

  • Declare and initialize variables (including casting of primitive data types)
  • Concepts of Object Oriented Programming
  • Difference between C & C++
  • cout and cin
  • Insertion Operator (<< )
  • Extraction operator( >>)
  • References Variables: Call by reference

Classes & Objects

  • Access Specifies (Public, Protected & Private )
  • More than one object
  • Object as an array
  • Object as a pointer

Function & Operator Overloading

  • Method overloading using no. of arguments
  • type of arguments
  • Overloading Binary & Unary operator

Constructor & Destructor

  • Syntax rules for writing constructor
  • Types of constructor
  • Default constructor
  • Parameterized Constructor
  • Constructor Overloading
  • Copy Constructor
  • Syntax rules for writing destructor
  • Difference between constructor & destructor
Inheritance

  • Introduction
  • Base Class & derived Class
  • Various forms of Inheritance
  • Simple/Single Inheritance
  • Multilevel Inheritance
  • Multiple Inheritance
  • Hierarchical and Hybrid Inheritance
  • Accessibility: Public, Protected & Private Inheritance
  • Ambiguity
  • Hybrid Inheritance Vs Virtual Base Class
  • Method overriding
  • Constructor & Destructor in Inheritance
  • Calling base class constructor
  • Passing arguments in base class constructor
Run-time Polymorphism & Miscellaneous

  • virtual function
  • pure virtual function
  • Abstract Class Object as an argument
  • Returning object
  • inline function
  • friend function
  • friend class
  • this pointer
  • static data member
  • static member function
Exception Handling & Generic function

  • Catching class type
  • using multiple catch statements
  • A function with two generic types
  • Explicitly Overloaded a Generic Function
  • Overload a function Template
Sequential & Random Access File

  • Opening & Closing Files
  • File Modes
  • Sequential I/O Files
  • get(), getline() and put() , read() and write() EOF
  • seekg(), seekp(), tellg(), tellp()

Join Us
Data Structure using C

  • What is an Algorithm
  • Algorithm complexity
  • Dynamic Memory Allocation by malloc(), calloc(), free(), realloc()
Searching & Sorting

  • Linear Search
  • Binary Search
  • Simple Sort
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Quick Sort
  • Merge Sort
Linked List, Stack & Queue

  • Singly Linked List
  • Circularly Linked List
  • Doubly Linked List
  • Circularly Doubly Linked List
  • Operation: Insertion, Deletion and traversing
  • Concept of Stack
  • Implementation of stack using Array and Linked List
  • Applications of Stack
  • Concept of Queue
  • Implementation of Queue using Array and Linked List
  • Types of Queue: Circular Queue, Dequeue and Priority Queue
Tree & Graph

  • Introduction of Tree
  • Definitions of Node
  • Papent Node, Child Node, Leaf Node, Height, Depth etc.
  • Binary Tree, Binary Search Tree
  • Concept of Graph
  • Definitions of Vertex, Edge, Path
  • Weighted Graph
  • BFS and DFS

Join Us