C,C++ Languages and Ds

  • 'C' Curriculum
  • 'C++' Curriculum
  • 'DS' Curriculum
  • OVERVIEW
  • FAQS

C Training Course Contents

Course Duration: 30-45 Days (Regular Program) / 10-15 Days (Fast Track) / 6 Weekends (Weekend Batch)

C Language Course Objective

Introduction to ‘C’ language

  • Features of C
  • History
  • Structure of C Program
  • Keyword, Identifiers & Constants

Data types

  • Primitive Data Types
  • Aggregated Data Types

Operators

  • Binary Operators
  • Unary Operators
  • Ternary Operators
  • Special Operators
  • Order of Evaluation

Selections

  • Simple if
  • if..else
  • Nested if
  • if..else ladder
  • Goto Statement
  • Break and Continue Statement
  • Switch..Case statement

Iteration

  • While
  • For
  • Do..While
  • Nested loop Statements

Arrays

  • Introduction to arrays
  • Need for Arrays
  • Types of arrays
  • One Dimensional Arrays
  • Two Dimensional Arrays
  • Multi Dimensional Arrays

String manipulation

  • Declaring String
  • Initializing String
  • String Functions
  • String Formatted Specifiers
  • Multiple Strings

Functions

  • Interdiction to Functions
  • Need for Functions
  • Classification of Functions
  • Function Prototype
  • Defining Function
  • Calling Function
  • Function with Arrays
  • Function with Strings
  • Recursive Functions

Storage class specifiers

  • Automatic
  • Extern
  • Static
  • Register

Structures, unions, enum

  • 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

Pointers

  • 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

Dynamic memory allocation

  • Allocation (Malloc, Calloc & Realloc)
  • De – Allocation (Free)

Files

  • Introduction
  • File Input, Output Operations
  • Sequential Files
  • Random Access Files
  • Command Line Arguments
  • Handling Errors
  • Database vs File System

Graphics

  • Introduction to Graphics
  • Initializing Graphics
  • Graphic Drivers & Modes
  • Graphic Functions

Data Structures (DS)

  • 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 Course Contents

Course Duration: 30-45 Days (Regular Program) / 10-15 Days (Fast Track) / 6 Weekends (Weekend Batch)

Basic In C++

  • Programming Methods
  • Object Oriented Programming
  • Introduction to C++
  • Variables, Datatypes, Operators
  • Reference Operator
  • Scope (: 🙂 Resolution Operators
  • New Structure of a C++ Program

Control Structures

  • Conditional – if, if…else, Nested if…else, Switch…Case
  • Loops – While, do…While, For, Nested Loops
  • Jump – Goto, Continue & Break

Functions

  • 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

Oops Concepts

  • Encapsulation
  • Abstraction
  • Polymorphism
  • Static Binding
  • Dynamic Binding
  • Inheritance
  • Message Passing
  • Class
  • Object

Classes and Objects

  • 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

Constructors and Destructors

  • Introduction
  • Defining Constructor
  • Comparing Constructor Member Function
  • Default Constructor
  • Argument Constructor
  • Copy Constructor
  • Constructor Overloading
  • Default Argument in Constructor
  • Destructor
  • Defining Destructor

Operator Overloading

  • 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

Inheritance

  • 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

Advanced Class Concepts

  • Container Class & Contained Class
  • Local Classes
  • Inheritance v/s Containership

Polymorphism and Virtual Functions

  • Type Polymorphism
  • Dynamic Binding
  • Function Overriding
  • Difference between Function Overloading and Overriding
  • Need of Virtual Functions
  • Pure Virtual Functions

Templates

  • Need of Template
  • Defining Template
  • Function Templates
  • Class Templates

Exception Handling

  • What is Exception?
  • Need of Handling Exceptions
  • Types Of Exceptions
  • Exception Handling Mechanism

Streams

  • Hierarchy of I/O Streams
  • Istream Class Functions
  • Ostream Class Functions
  • IOS Class Functions
  • Manipulators

Files

  • Hierarchy of File Streams
  • Opening a File
  • File Opening Modes
  • Sequential Access Files
  • Random Access Files
  • Command Line Arguments

Graphics

  • Introduction to Graphic
  • Initializing Graphic
  • Graphic Drivers & Modes
  • Graphic Functions

Data Structures

  • 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

Data Structure Training Course Overview

Data Structures

Course Duration: 15-20 Days (Regular Program) / 0-10 Days (Fast Track) / 4 Weekends (Weekend Batch)

  • Introduction
  • Structured Representation
  • Statements and Control Structures
  • Abstract Data Types
  • Static Data Types
  • Dynamic Data Types
  • Arrays
  • Pointers
  • Linked List
  • Advanced Data Structures
  • Data Structure Representation

Stacks

  • Defining stack
  • Application of stack
  • Operations of stack
  • Stack implemented as an array
  • Stack implemented with pointers
  • Using Stacks to solve problems

Queues

  • Defining Queue
  • Application of Queue
  • Operation of Queue
  • Circular Queue
  • Priority Queue
  • Double Ended Queue
  • Queue implemented with Pointers
  • Differences between Stacks and Queues

Linked List

  • Introduction
  • Advantages of Linked List over an Array
  • Application of Linked List
  • Types of Linked Lists
  • Singly Linked Lists
  • Operation of Singly Linked Lists
  • Doubly Linked Lists
  • Operations on Doubly Linked Lists
  • Circular Linked Lists
  • Circular Double Linked Lists
  • Uses of Linked Lists

Trees

  • Introduction
  • Binary Trees
  • Implementation of Binary Trees
  • Insertion into a Binary Tree
  • Binary Tree Deletion
  • Traversing a Binary Tree
  • Binary Height Balanced Trees

Graphs

  • Introduction
  • Types of Graphs
  • Various Representation of Graphs
  • Application of Graphs
  • Graph Traversals

Sorting Techniques

  • Introduction
  • Bubble Sort
  • Selection Sort
  • Quick Sort
  • Merge Sort
  • Iterative Merge Sort
  • Introduction to Heap
  • Heap Operations
  • Heap Sort

Searching Techniques

  • Introduction
  • Linear Search
  • Binary Search

C OverView

C (programming language) C (/ˈsiː/, as in the letter c) is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations.

C++ OverView

C++ is a general-purpose programming language. It has imperative, object-oriented and generic programming features, while also providing facilities for low-level memory manipulation.

DS OverView

A data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways.

Who Should Join: Any graduate or postgraduate or professional having basic knowledge of Computer and Logic