C - C++ Training Institutes in Dehradun
C-and-C-Plus-Plus-Training

C / C++ Training

If you are getting ready for a career as an entry-level information technology (IT) professional or Software Engineer, this course is the first step in your preparation. The course will build on your existing user-level knowledge and experience with programming language to present fundamental skills and concepts that you will use on the job during S/W Development. In this course, you will acquire the essential skills and information of programming language. Although C/C++ was designed for implementing system software it is also widely used for developing portable application software. C/C++ is one of the most widely used programming languages of all time. C has greatly influenced many other popular programming languages.


Course Outline


C Training

  • Features of C
  • History
  • Structure of C Program
  • Keyword, Identifiers & Constants
  • Primitive Data Types
  • Aggregated Data Types
  • Binary Operators
  • Unary Operators
  • Ternary Operators
  • Special Operators
  • Order of Evaluation
  • Simple if
  • if..else
  • Nested if
  • if..else ladder
  • Goto Statement
  • Break and Continue Statement
  • Switch..Case statement
  • While
  • For
  • Do..While
  • Nested loop Statements
  • Introduction to arrays
  • Need for Arrays
  • Types of arrays
  • One Dimensional Arrays
  • Two Dimensional Arrays
  • Multi Dimensional Arrays
  • Declaring String
  • Initializing String
  • String Functions
  • String Formatted Specifiers
  • Multiple Strings
  • Interdiction to Functions
  • Need for Functions
  • Classification of Functions
  • Function Prototype
  • Defining Function
  • Calling Function
  • Function with Arrays
  • Function with Strings
  • Recursive Functions
  • Automatic
  • Extern
  • Static
  • Register
  • Introduction to structures
  • Declaring a Structure
  • Introduction to Structures
  • Structures with Arrays
  • Structures with Function
  • Nested Structures
  • Introduction to Union
  • Declaring Union
  • Difference between Structures and Unions
  • Enumerations
  • Typedef
  • Introduction to Memory
  • Introduction to Pointers
  • Operations on Pointers
  • Pointer to Pointer
  • Pointer to Array
  • Array to Pointers
  • Void pointers
  • Call by Value and Call by Reference
  • Passing Pointers to Functions
  • Functions returning Pointers
  • Pointer to Functions
  • Dynamic Functions Call with Function Pointer
  • Pointers with Structures
  • Allocation (Malloc, Calloc & Realloc)
  • De – Allocation (Free)
  • Introduction
  • File Input, Output Operations
  • Sequential Files
  • Random Access Files
  • Command Line Arguments
  • Handling Errors
  • Database vs File System
  • Introduction to Graphics
  • Initializing Graphics
  • Graphic Drivers & Modes
  • Graphic Functions
  • Introduction
  • Stacks using Arrays
  • Stacks using Linked List
  • Queues using Arrays
  • Queues using linked List
  • Circular Queues
  • De – Queues
  • Singly Linked List
  • Circular Linked List
  • Doubly Linked List
  • Infix, Prefix and Postfix
  • Expressions
  • Trees
  • Binary Trees
  • Directed Graphs, Undirected Graphs
  • Searching Methods – BFS, DFS
  • Searching Techniques – Linear, Binary
  • Sorting Techniques – Bubble, Insertion,
  • Selection, Quick, Heap and Merge


C++ Training

  • Programming Methods
  • Object Oriented Programming
  • Introduction to C++
  • Variables, Datatypes, Operators
  • Reference Operator
  • Scope Resolution Operators
  • New Structure of a C++ Program
  • Conditional – if, if…else, Nested if…else, Switch…Case
  • Loops – While, do…While, For, Nested Loops
  • Jump – Goto, Continue & Break
  • Introduction a Function
  • Defening a Function
  • Prototypes
  • Actual and Formal Arguments
  • Parameter Passing Techniques
  • Call by Value
  • Call by Reference
  • Call by Pointer
  • Default Arguments
  • Function Overloading
  • Inline Functions
  • Encapsulation
  • Abstraction
  • Polymorphism
  • Static Binding
  • Dynamic Binding
  • Inheritance
  • Message Passing
  • Class
  • Object
  • Class Declaration
  • Access Member and Member Functions
  • Creating Objects
  • Differences between Class and Structure
  • Objects as arguments
  • Returning Objects
  • Static Members
  • Friend Functions
  • Friend Classes
  • Introduction
  • Defining Constructor
  • Comparing Constructor Member Function
  • Default Constructor
  • Argument Constructor
  • Copy Constructor
  • Constructor Overloading
  • Default Argument in Constructor
  • Destructor
  • Defining Destructor
  • Need of Overloading
  • Defining Operator Overloaded Function
  • Operator Overloading Rules
  • Overloading Unary Operators
  • Overloading Unary Operators using Friend
  • Overloading Binary Operators
  • Overloading Binary Operators using Friend
  • Overloading Other Operators
  • Introduction
  • Types of Inheritance
  • Single Level Inheritance
  • Multilevel Inheritance
  • Multiple Inheritance
  • Hybrid Inheritance
  • Hierarchical Inheritance
  • Base Class
  • Derived Class
  • Inheritance Scope
  • Protected Members
  • Virtual Base Class
  • Virtual Destructors
  • Container Class & Contained Class
  • Local Classes
  • Inheritance v/s Containership
  • Type Polymorphism
  • Dynamic Binding
  • Function Overriding
  • Difference between Function Overloading and Overriding
  • Need of Virtual Functions
  • Pure Virtual Functions
  • Need of Template
  • Defining Template
  • Function Templates
  • Class Templates
  • What is Exception?
  • Need of Handling Exceptions
  • Types Of Exceptions
  • Exception Handling Mechanism
  • Hierarchy of I/O Streams
  • Istream Class Functions
  • Ostream Class Functions
  • IOS Class Functions
  • Manipulators
  • Hierarchy of File Streams
  • Opening a File
  • File Opening Modes
  • Sequential Access Files
  • Random Access Files
  • Command Line Arguments
  • Introduction to Graphic
  • Initializing Graphic
  • Graphic Drivers & Modes
  • Graphic Functions
  • Introduction
  • Stacks using Arrays
  • Stacks using Linked List
  • Queues using Arrays
  • Queues using Linked List
  • Circular Queues
  • De-Queues
  • Single Linked List
  • Circular Linked List
  • Doubly Linked List
  • Infix, Prefix and Postfix Expressions
  • Trees
  • Binary Trees
  • Binary Search Trees
  • Directed Graphs, Undirected Graphs
  • Searching Methods – BFS, DFS
  • Searching Techniques – Linear, Binary
  • Sorting Techniques – Bubble, Insertion
  • Selection, Quick, Heap and Merge
  • Minor Project 1
  • Project Case Study 1
  • Minor Project 2
  • Project Case Study 2

Course Registration

TESTIMONIALS


KEEP IN TOUCH

Subscribe to Our Newsletter to get Important News & Offers