-
7/25/2019 Dexter Cp
1/4
dexterCodingCourse Name: C with Interview Preparation
Duration : 30 Hrs
Fees: 3000/
Module I
History of C, Introduction to C, Input/Output In C, Data Types,
Introduction to Operators, Arithmetic
Operators, Logical Operators, Relational Operators, Conditional
Operator, Bitwise Operators, Shift
Operators, Comma Operator , Special Operators. Type Conversion
and Type Casting. Introduction to
functions in math.h
Module II
Conditional Statements, If Statement, Else Statement, Else If
Statement, If..Else If ladder, Nested If,
Switch..case..break statements. Introduction to loops, For,
While and Do..while loops,Nested Loops,
Use of break and continue statements in loops.
Module III
Introduction to Arrays, Single and Double Dimensional Arrays,
Introduction to Functions, Passing
values and returning values to/from functions. Call by value and
Call by reference, Returning by
reference, Recursion, Introduction to Strings, Various String
Functions in string.h, Introduction tofunctions in ctype.h
Module IV
Introduction to Storage Classes, Auto, Register, Static and
Extern Storage Classes, Introduction to
Preprocessor Directives, Macros, Conditional Compilation.
Module V
Introduction to Structures, Difference between structure and an
array, Initialization of Structures,
Array of Structures, Array of Members of Structure, Passing and
returning structure to/from
functions, Nested Structures, Union, Difference between
structure and union.
Module VI
Introduction to Pointers, Operations on Pointers, Void Pointer,
Pointers and arrays, Pointers and
strings, Pointers and structures, Pointers and functions, use of
const qualifier with pointers.
Introduction to File Handling, text and binary files, reading
and writing text from/to file, reading and
writing structures, CRUD Operations.
-
7/25/2019 Dexter Cp
2/4
dexterCodingCourse Name: C++ with OOPs
Duration : 35 Hrs
Fees: 3500/
Module I
Introduction to C++, Input/Output in C++, Operators in C++,
Scope Resolution Operator, References
in C++, Const qualifier with references.
Module IIVarious conditional statements such as if, else,
switchcasebreak etc, Types of loops and when to
use which one, Arrays, Strings, Functions, Structures,
Unions
Module III
Class and Objects, Defining member functions inside and outside
the class, Inline functions, Access
Specifiers, Parameterized and Non Parameterized constructors,
Destructors, Use of this pointer,
Static Data members and member functions, Friend functions and
classes, Constructor Initializer list.
Module IV
Function Overloading, Operator Overloading, Introduction to
Inheritance, Various types ofInheritance, Order of Construction in
Derived classes, Adding, changing and hiding members in
derived classes, Multiple Inheritance, Diamond Problem, Virtual
Base Classes, Virtual Functions,
Abstract Base classes, Concept of VPTR and VTABLE, Early Binding
and Late Binding.
Module V
Introduction to templates, class templates, function templates,
Exception handling in C++, Handling
errors using assert, cerr and exit. Introduction to STL, Various
STL Classes, Iterators and Containers
-
7/25/2019 Dexter Cp
3/4
dexterCodingCourse Name: Data Structures
Duration : 30 Hrs
Fees: 3000/
Module I
Introduction to Data Structures, Complexity, Recursion,
Introduction to Linked List, Diiferences
between a linked list and an array, Creation, traversal,
insertion and deletion operations on lists,
Doubly Linked List, Circular Lists, Doubly Circular lists
Module II
Introduction to Stacks and Queues, Applications of Stacks and
Queues, Expression evaluation using
Stacks
Module III
Trees, Binary Tree, Binary Search Tree, Tree Traversal, Adding
and removing nodes in a tree, Heap,
Conversion between Infix, Prefix and Postfix notations,
Applications of Trees
Module IV
Introduction to Graphs, Various Terminologies related to graphs,
Depth First and Breadth First
Traversal in Graphs, Spanning Tree and Minimum Spanning Tree,
Shortest path problem
Module V
Searching and sorting of arrays. Linear and Binary Search.
Bubble Sort, Selection Sort, Insertion Sort,
Merge Sort and Quick Sort. Comparison of various sorting
algorithms.
-
7/25/2019 Dexter Cp
4/4
dexterCodingCourse Name: Java
Duration : 35 Hrs
Fees: 4000/
Module I
Introduction to Java, Data Types, Operators, Conditional
Statements, Loops for, while and
do..while, Single and multi dimensional arrays, Introduction to
strings, string builder and string
buffer, various string functions.
Module IIClass and Objects, Method Overloading, Constructor,
Static variables and methods, this keyword,
Inheritance, Aggregation and Composition, Method overriding,
Runtime Polymorphism, Static and
Dynamic Binding, Abstract class and interface and when to use
which one, Object cloning, Call by
value and call by reference, Packages
Module III
Introduction to exception handling, the use of try, catch,
finally, throw and throws keywords.
File Input and Output, Introduction to streams, File Writer and
Reader, Data Input Stream and Data
Output Stream.
Module IVIntroduction to collections, Using various collection
classes such as ArrayList, LinkedList, Iterators,
Hashset etc.
Introduction to Multithreading, Life Cycle of a Thread, Creating
Thread, Sleeping a thread, Joining a
thread, Thread Priority, Thread Pooling, Performing multiple
task by multiple thread, Concurrency
problem and its solution, Garbage Collection.
Module V
Introduction to swings, creating user interface using various
controls, Layout Managers, creating
events and event handlers.
Introduction to JDBC, Connecting to MySql, Driver Manager,
Connection Interface, Statement
Interface, Resultset, Prepared statement, CRUD operations on a
database.
