C++ With Data Structures Course Contents

C++ Course Content

Chapter 1:

Basics in C++

• Programming Methods
• Procedure Oriented Programming
• Object Oriented Programming
• Introduction to C++
• Variables, Datatypes, Operators
• Reference Operator
• Scope (: :) Resolution Operator
• New Structure of a C++ Program

Chapter 2:

Control Structures

• Conditional - if, if.....else, Nested if...else, Switch...Case
• Loops - While., do.... While, For, Nested Loops
• Jump - Goto, Continue, Break

Chapter 3

Functions

• Introduction
• Defining a Function
• Prototypes
• Actual and Formal Arguments
• Parameter passing Techniques

                              Call by Value
                              Call by Reference
                              Call by Pointer

• Default Arguments
• Function Overloading
• Inline Functions

Chapter 4

OOPS Concepts

• Encapsulation
• Abstraction
• Polymorphism
• Static Binding
• Dynamic Binding
• Inheritence
• Message Passing
• Class
• Object

Chapter 5

Classes And Objects

• Class Declaration
• Access Specifiers
• Data Member and Member Functions
• Creating Objects
• Differences between Class and Structure
• Objects as arguments
• Returning Objects
• Static Members
• Friend Functions
• Friend Classes

Chapter 6

Constructors And Destructors

• Introduction
• Defining Constructor
• Comparing Constructor and Member Function
• Default Constructor
• Argument Constructor
• Copy Constructor
• Constructor Overloading
• Default Arguments in Constructor
• Destructor
• Defining Destructor

Chapter 7

Operator Overloading

• Need of Overloading
• Defining Operator Overloading Function
• Operator Overloading Rules
• Overloading Unary Operators
• Overloading Unary Operators using Friend
• Overloading Binary Operators
• Oveloading Binary Operators using Friend
• Overloading Other Operators

Chapter 8

Inheritance

• Introduction
• Types of Inheritance
• Single Level Inheritance
• Multilevel Inheritance
• Multiple Inheritance
• Hybrid Inheritance
• Hierarchical Inheritance
• Base Class
• Derived Class
• Inheritance Scope
• Protected Members
• Virtual Base Class
• Constructors in Base Class
• Virtual Destructors

Chapter 9

Advanced Class Concepts

• Container Class and Contained Class
• Local Classes
• Inheritance V/S Containership

Chapter 10

Polymorphism and Virtual Functions

• Types of Polymorphism
• Dynamic Binding
• Function Overriding
• Difference Between Function Overloading and Overriding
• Need of Virtual Functions
• Pure Virtual Functions

Chapter 11

Templates

• Need of Template
• Defining Template
• Function Templates
• Class Templates

Chapter 12

Exception Handling

• What is Exception?
• Need of Handling Exceptions
• Types of Exceptions
• Exception Handling Mechanism
• Try, catch and throw keywords

Chapter 13

Streams

• Hierarchy of I/O Streams
• Istream class Functions
• Ostream Class Functions
• IOS Class Functions
• Manipulators

Chapter 14

Files

• Hierarchy of Files Streams
• Opening a File
• File Opening Modes
• Sequential Access Files
• Random Access Files
• Command Line Arguments

Chapter 15

Graphics

• Introduction to Graphics
• Initializing Graphics
• Graphic Drivers and Modes
• Graphic Functions

Chapter 16

Data Structures

• Introduction
• Stacks Using Arrays
• Stacks Using Linked List
• Queues using Arrays
• Queues using Linked List
• Circular Queues
• De - Queues
• Singly Linked List
• Circular Linked List
• Doubly Linked List
• Infix, Prefix and Postfix Expressions
• Trees
• Binary Trees
• Binary Search Trees
• Disected Graphs, Undirected Graphs
• Searching Methods - BFS, DFS
• Searching Techniques - BFS, DFS
• Searching Techniques - Linear, Binary
• Sorting Techniques - Bubble, Insertion, Selection, Quick, Heap and Merge

C with Data Structures Course Content

Programming Approaches

Introduction to C language

• Features of C
• History
• Structure of C Program
• Keywords, Identifiers, Constants            

Data Types

• Primitive Data Types
• Aggregated Data Types

Operators

• Binary Operators
• Unary Operators
• Ternary Operator
• Special Operators
• Order Of Evaluation

Selections

• Simple if
• if...else
• Nested if
• if...else ladder
• Goto Statement
• Break and Continue Statement
• Swith... Case Statement

Iteration

• While
• For
• Do...While
• Nested loop Statements

Arrays

• Introduction to Arrays
• Need for Arrays
• Types of Arrays

                    One Dimensional Arrays

                    Two Dimensional Arrays

                    Multi Dimensional Arrays

String Manipulation

• Declaring String
• Initializing String
• String Functions
• String Formatted Specifiers
• Multiple Strings

Functions

• Introduction to Functions
• Need for Functions
• Classification of Functions
• Function Prototype
• Defining Function
• Calling Function
• Function With Arrays
• Function with Strings
• Recursive Functions

Storage Class Specifiers

• Automatic
• Extern
• Static
• Register

Structures, Unions, Enum

• Introduction to Structures
• Declaring Structures
• Introduction to Structures
• Structures with Array
• Structures with Function
• Nested Structures
• Introduction to Union
• Declaring Union
• Difference between Structures and Unions
• Enumerations
• Typedef

Pointers

• Introduction to Memory
• Introduction to Pointers
• Operations on Pointers
• Pointer to Pointer
• Pointer to Array
• Array of Pointers
• Void Pointer
• Call by Value and Call by Reference
• Passing Pointers to Functions
• Functions returning Pointers
• Pointer to Functions
• Dynamic Function Call with Function Pointer
• Pointers with Structures

Dynamic Memory Allocation

• Allocation (Malloc, Calloc, Realloc)
• De - Allocation (Free)

Files

• Introduction
• File Input, Output Operations
• Sequential Files
• Random Access Files
• Command Line Arguments
• Handling Errors
• Database Vs File System

Graphics

• Introduction to Graphics
• Initializing Graphics
• Graphic Drivers and Modes
• Graphic Functions

                                      DATA STRUCTURES

• Introduction
• Stacks using Arrays
• Stacks using Linked List
• Queues using Arrays
• Queues using Linked List
• Circular Queues
• De - Queues
• Singly 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

Core Java basics

Pointer Arithmetic

Pointer Arithmetic is supported by c++. Java doesn't support pointer arithmetic.

Pointer arithmetic in c++

a[0] = 10;
a[1] = 20;
a[2] = 30;                                     1000 ---> 10           20            30            40           50
a[3] = 40;                                       a             1000    1002       1004        1006        1008
a[4] = 50;
*(a+5) = 60;



*(a+0) --->  * (1000 + 0) ----> * (1000)

*(a+1) ----> * (1000 + 1) -----> * (1002)

* (a+2) -----> *(1000 + 2) ------> * (1004)

* (a+3) -----> * (1000 + 3) --------> *(1006)

* (a+4) ----->  *(1000 + 4) --------> *(1008)


p
2000
1000
-                  -
-                 -
-                 -
-                -
a       
10           20     Unreserved
2000      2002


int main(0
{
int *p;
int a = 10;
p= &a;
printf(" %d", *p);  ------>10
p++;
*p=20;
printf("%d", *p); ------->20
p--;
printf("%d", *p); ------>10
}

Java has automatic memory management. No dangling pointers and no memory leaks.

Memory Leak

When Program loss an address or ability to un reserve the memory which is reserved then the memory would be leaked.

Java simplifies pointer handling no reference / dereference operations.

No make files and no header files.

Data Ware Housing and Mining

Basic Elements Of Data Ware House

1. Source System

2. Data Storing Area

3. Presentation Server

4. Datawarehouse

5. Dimensional model

6. Business Process

7. Data Mart

8. OLAP

9. ROLAP

10. MOLAP

11. End User Application

12. End User Data  Access Tool

13. Modeling Application

14. Meta Data

15. Adhoc Query Tool

Multiplexing

How to share the medium with low or no interface is called multiplexing

Example

Space Division Multiplexing (SDM)

Frequency Division Multiplexing (FDM)

Time Division Multiplexing (TDM)

Code Division Multiplexing (CDM)

Client / Server Application

Client Server application is divided into 3 functional units

1. User Interface

2. Business Logic / Application Logic

3. Shared Data

In 1 tier application we have one host that is client

In 2 tier we have client as well as server

In 3 tier we have  client, web server and database

Middle Ware Technologies

Types Of Servers

1. File Server

Any  server access the repository for same server is called file server.

Client  ------>File Calls  -------->File Sever
          <------------Files--------->  

Examples:

Document files, Image Files, Audio Files...etc

2. Database Server

Any server used  to access Data base data is called Database server.

Client-------------->SQL Calls-------------------->DBServer
          <------------------Data--------------------->

Examples:

MS-Access
Oracle
SQLServer

3. Transaction Server

Group of SQL statements are called transaction. Transaction server is a repository of remote procedures.

They are

1. Transaction Lite
2. Transaction Heavy

Client -------------->Remote Procedure------------------>Transaction Server

4. Groupware Server

It is a repository of text

Example

Lotus Nodes

Client ------------>Group Ware Messages ------------>Group Server

5. Object Servers

It interacts with ORB(Object Request Broker).

Client ----ORB------->RMI-------ORB---->OS

Example:

1. Hp's ORB Plus

2. Express

3. Microsoft's Dcom

6. Web Server

WWW is a software it contains web servers.

Client -----------> HTTP Over TCP/IP--------> Web Server ------CGI------>Data server

1. Fat Client

Client Knows about server to access the functionalities.

*  File Server and Database server are called Fat Client

2. Fat Servers

Client doesn't know about servers.

* Groupware Server, Web Server, Transaction Server are called Fat Servers.

* Object server is combination of both fat client and server.