C ,
C ++ & Data Structures
C
C is
a general purpose Programming Language. C has proven to be a pleasant,
powerful, and versatile language for a wide variety of programs. Many
of the modern languages like C++, Visual C++, Java, JavaScript, etc.
are based on C Language. Therefore, not knowing this Language is considered
a handicap. The fundamental types are characters, and integers and floating-point
numbers of several sizes. Pointers provide for machine independent address
arithmetic.
SALIENT
FEATURES
-
C is
a general purpose Structured Language that is powerful, efficient
and compact.
-
C is
a combination of High level language and Assembly language that's
why it's good for man & assembler.
-
C is
a robust language whose rich set of built-in functions and operators
can be used to write any complex program.
-
C
is a portable language.
-
C
provides a variety of data types.
- In addition, there
is a hierarchy of derived data types created with pointers, arrays,
structures, and unions.
- Programming in C is
efficient & fast because of its datatypes and various operator.
APPLICATION
- 90% of UNIX Operating
System is written in C Language.
TOPICS
COVERED
-
Basic
Structure of C, Constants, Variables, Data types & Keywords,
Operators, Expression, Conditional Operators.
-
Decision,
Loop & Switch Control Statement.
-
Arrays
& String Handling, Creating Functions in C.
-
Introduction
to Pointers in C.
-
Passing
Pointers as Arguments to Function.
-
Structure,
Union. File Handling Dynamic Allocation of Memory.
- Introduction To Linked
List Basics.
C
++
C++ is a
Object Oriented Programming Language that is powerful, efficient and
compact. It includes concepts like Polymorphism, Dynamic Binding, Data
hiding, Operator encapsulation and inheritance, which are to observed
in C User defined objects (instances) can be reused with and without
modifications to generate new application. This reduces coding to greater
extends.
SALIENT
FEATURES
- For file accessing,
you can use file objects to open or manipulate a file.
- C++ is a Robust
language whose rich set of built-in functions and operators can
be used to reduce complexity of programs.
- C++ is also a Portable
language.
APPLICATION
- Complex real-time
System.
- Simulation and Modeling.
- Object-oriented
database.
- Hypertext, hypermedia
and expert text.
- Neural networks
and parallel programming.
- Communication System.
TOPICS COVERED
- Introduction to
Object Oriented Programming (C++).
- Tokens, expression,
data types & control structure.
- Introduction to
Classes, Objects, Constructor & Deconstructor.
- Functions in C++.
- Function overloading,
Operator overloading.
- Inheritance, multiple
& multilevel inheritance.
- Introduction to
virtual functions, classes & polymorphism.
- File operations
using fstream classes.
- Exception Handling.
- Introduction to
Templates.
C
& C++ (Level I)
| Course
Duration |
Fees
(Indian RS.) |
Fees
(US $) |
| 65
sessions of 1 hr. each |
7,000 |
200 |
DATA STRUCTURES
Data
Structure is a collection of data elements organised in a specific
manner and accessing functions are defined to store and retrive
individual data elements.You can get the required data and store
it using a proper data structure. Sort the input data. Finally u
can print the data according to requirement. You can add the data,
search the data, delete the data, view the data using all types
of search and sort techniques in data structure.
APPLICATION
- In All Types
of Software Development.
- In System Programming.
TOPICS
COVERED
-
Structure
Programming, Life Cycle of a Software, Program Verification,
Efficiency of Algorithms, Analysis of Algorithms.
-
Abstract Data Type, Classification Of Data Structure, Arrays,
Structures in C, Character Structure in C, Pointers, Memory
Management in C.
-
Linkly
List, Singly Linked List, Operations on Linked List, Avail List,
Implementation Linked List, Circuler Linked List, Doubly Linked
List, Applications Of Linked List.
Stack, Operations on Stack, Implementation of Stack, Applications
of Stack, ueue,Operations on Queue , Implementing operations
Of Queue, Priority Queues and Applications of Queues.
-
Recursion,
Static Storage Allocation, Dynamic Memory Allocation, Writing
Recursive Algorithms.
-
Tree,
Binary Tree, Operations on Binary trees, Tree Traversal, Threaded
Binary Trees.
-
Searching,
Sequential Searching , Searching an Ordered Table, Search Trees,
General Trees, Hashing .
-
Sorting,
Bubble Sort, Selection Sort, Insertion Sort, Shell Sort, Quick
Sort, Merge Sort, Radix Sort, Address Calculation Sort, Tree
Sort, Heap Sort.
-
Graph, Representation
of Graphs, Graph Traversal, Application of Graphs.
Data
Structures (Level II)
| Course
Duration |
Fees
(Indian RS.) |
Fees
(US $) |
| 40
sessions of 1 hr. each |
6,500 |
165 |
C,
C++ & Data Structures (Level I + II)
| Course
Duration |
Fees
(Indian RS.) |
Fees
(US $) |
| 105
sessions of 1 hr. each |
13,000 |
325 |
Add
Service Tax=12.36% on all tuition fees.
Please
Note: Management has full right to change
courses, contents, tuition fees without prior notice.
|
|
