You are on page 1of 12

Mail Us:sathyainhyd@gmail.

com
Call Us: 65538958 /65538968 / 65538978

C:
Introduction to Computers
Computer Generations
Block Diagram & I/O Devices
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
Arrays
One Dimensional
Two Dimensional
Multi Dimensional

Strings
String Operations
String handling functions

Structures & Unions


Searching and sorting
Selection sort
Insertion sort
Merge sort
Sequential sort
Radix sort
Bubble sort
Quick sort
Heap sort
Linear search
Binary search
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:

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
C++

Introductions
Disadvantage of C
Evaluation of C++
Differences between C&C++
Features of C++

C++Fundamentals
Character set
Loops
While
For
Do While
Nested Loops

Arrays and Strings


Single dimensional
Multi dimesional
String library functions

Constructors and destructors


Default constructors
Parameterized constructor
Copy constructor
Destructor

Functions in C++
Friend function
Inline function

Polymorphism
Inheritance
Single level
Multi level
Multiple
Hybrid
Hierarchy
14 Pointers
Pointers to arrays
Pointers to strings
Pointers to structures
Pointers to classes
DS:

Data structures in C++


Classification of DS
Lists
Linear
Non Linear

Linked list
Single linked list
Double linked list
Queues
Implementation of Queues
Operation on Queues
Application of Queues
Circular Queues
Dequeue
Priority Queue

Non linear Datastructures


Trees
Binary trees

You might also like