C++ course training institute hyderabad

1
Mail Ussathyainhyd_at_gmail.comCall Us 65538958
/65538968 / 65538978

• C
• Introduction to Computers
• Computer Generations
• Block Diagram I/O Devices
• Hardware and Software
• Operating System
•  
• Introduction to C
• History and Generations of Language
• Algorithms
• Flowcharts
• Evaluation of C
•  

2

• Basics of C
• Character set
• Keywords and identifiers
• Constants and variables
• Data Types
• Type Conversion
• Structure of C Program
• Execution of C under MS-Dos.
• Unix / Linux
•  
• Operators of C
• Arithmetic
• Assignment
• Relational
• Logical
• Bitwise
• Conditional
• Special
• Precedence of Operators

3

• Arrays
• One Dimensional
• Two Dimensional
• Multi Dimensional
•  
• Strings
• String Operations
• String handling functions
•  
• Structures Unions
• Accessing Structure elements
• Structure initialization
• Array of structures
• Nested structures
• Unions
• Typedef
• Enumeration
• Preprocessor and macro

4

• Searching and sorting
• Selection sort
• Insertion sort
• Merge sort
• Sequential sort
• Radix sort
• Bubble sort
• Quick sort
• Heap sort
• Linear search
• Binary search
•  
• 11.Pointers
• Advantages of pointers
• Types of pointers
• Pinter arithmetic
• Pointer to arrays
• Pointer to string
• Structure to pointer

5

• File handling
• Operating a file
• File I/O
• Character I/O
• Line I/O
• Format I/O
• Structure I/O
• Random Access file processing
•  
• DS
•  
• Data structures
• Classification of data structures
• List
• Linear
• Non Linear
•  
• Linked list
• Single Linked list

6

• Stacks
• Implementation of stacks
• Operations on stack
• Application on stack
• Infix, Postfix Prefix
•  
• Queues
• Implementation of Queues
• Operation on Queues
• Application on Queues
• Circular Queues
• Dequeue
• Priority Queue
•  
• Non Linear data structures
• Trees
• Binary trees
• Binary search tree
• Tree traversals

7

• C
•  
• Introductions
• Disadvantage of C
• Evaluation of C
• Differences between CC
• Features of C
•  
• CFundamentals
• Character set
• Data types in C
• Structure of C
• Operators in C
•  
• Control Statements
• Conditional statements
• Un Conditional statements
• Switch statements
• Nested if

8

• Loops
• While
• For
• Do While
• Nested Loops
•  
• Arrays and Strings
• Single dimensional
• Multi dimesional
• String library functions
•  
• Functions
• Function prototype
• Functions with passing of arguments
• Functions passing arrays
• Function passing strings
• Function passing structures
• Call by value
• Call by reference

9

• Constructors and destructors
• Default constructors
• Parameterized constructor
• Copy constructor
• Destructor
•  
• Functions in C
• Friend function
• Inline function
•  
• Polymorphism
• Early binding
• Function overloading
• Operator overloading
• Late binding
• Virtual functions
• Pure virtual functions
•  
• Tern plates

10

• Inheritance
• Single level
• Multi level
• Multiple
• Hybrid
• Hierarchy
• 14 Pointers
• Pointers to arrays
• Pointers to strings
• Pointers to structures
• Pointers to classes
• Pointers to pointers
• Dynamic memory allocation
• New
• Delete
• This pointer
•  
• Searching and sorting
• Merge sort

11

• DS
•  
• Data structures in C
• Classification of DS
• Lists
• Linear
• Non Linear
•  
• Linked list
• Single linked list
• Double linked list
• Singly circular
• Doubly circular
•  
• Operations on Linked list
• Insert
• delete
• Search
• Sort

12

• Queues
• Implementation of Queues
• Operation on Queues
• Application of Queues
• Circular Queues
• Dequeue
• Priority Queue
•  
• Non linear Datastructures
• Trees
• Binary trees
• Binary search Trees
• Tree traversals
• Inorder
• Preorder
• Postorder
•  
• Operations on Binary Tree
• Insert