Programming in C / C++

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
• Declaring String
• Initializing String
• String Functions
• String Formatted Specifiers
• Multiple Strings
• Automatic
• Extern
• Static
• Register
• Introduction to Graphics
• Initializing Graphics
• Graphic Drivers & Modes
• Graphic Functions
•  
• C++ Training
• Encapsulation
• Abstraction
• Polymorphism
• Static Binding
• Dynamic Binding
• Inheritance
• Message Passing
• Class
• Object
• 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
• Need of Template
• Defining Template
• Function Templates
• Class Templates
• 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