Advanced Data Structure and C++ Programming
Advanced Data Structure and C++ Programming
C++ programming
Amresh Nikam
Syllabus
Syllabus
Syllabus
Syllabus
Syllabus
Chapter 1 Session 1
Basics of C++
A Brief History of C++
Standard C++ A Programming Language and a Library
C++ versus C
The Organization of a C++ Program
C++ Identifiers and Keywords
Your First C++ Program
Variables
Constants
Chapter 1 Session 2
C++ Expression
Expressions and Assignments
Operators That Compute
Bitwise Operators
Compound Assignment and Comma Operators
Precedence and Associativity
Initializers
Type Conversion
Chapter 2 Session 3
C++ Expression
Operators That Make Decisions
Console Input and Output
Loops in C++
Chapter 2 Session 4
Functions In C++
Function Declaration, Definition and Calling
Returning From Functions
Passing Arguments to Function Parameters
Call by Value
Call by Address
Chapter 3 Session 6
Functions In C++
Call by Reference,
Return by Reference
Default Arguments
Const Arguments
Overloaded Functions
Chapter 4 Session 7
Operator Overloading
Implementing Operator Overloading
Member Function
Non-Member Function
Friend Function
Restrictions on Operator Overloading
Chapter 5 Session 15
Operator Overloading
Overloading Arithmetic Operator
Overloading I/O operator
Overloading Relational operator
Copy constructor Vs. Assignment operator
Chapter 5 Session 16
Operator Overloading
Manipulating of String Using Operators
Concatenation
Repetition of string
Remove Sub String
Chapter 6 Session 17
Exception handling
The need for exceptions
Basic exception handling
Exceptions, functions, and stack unwinding
Uncaught exceptions, catch-all handlers, and exception specifiers
Chapter 8 Session 26
Exception handling
Exceptions, classes, and inheritance
Rethrowing exceptions
Function try blocks
Exception dangers and downsides
Chapter 9 Session 27
Stack
Implementation of stack using self referential structure
Operation on stack
Push
Pop
Chapter 9 Session 32
Queue
Implementation of queue using self referential structure
Operation on queue
insert
delete
Chapter 9 Session 33
Circular Queue
Implementation of circular queue
Operation on circular queue
insert
delete
Chapter 10 Session 34
Priority Queue
Implementation of priority queue
Operation on priority queue
insert
delete
Chapter 11 Session 35
Tree
Tree Terminology
Root Edge Parent Child Siblings Leaf
Internal Nodes Degree Level Height Depth
Path Strictly Binary Tree Complete Binary Tree
Almost Complete Binary Tree
Binary Tree
Binary Tree Representation using array
Binary Tree Representation using self referential structure
Chapter 11 Session 36
Advance Tree
Threaded Binary Tree
Right in Threaded Binary Tree
Left in Threaded Binary Tree
Traversal of Threaded Binary Tree
Chapter 12 Session 41
AVL tree
Concept of AVL tree
Rotation
RR
LL
RL
LR
Exercise on AVL tree
Chapter 12 Session 42
AVL tree
Implementation of AVL tree
Traversal
Chapter 12 Session 43
B tree
Concept of B tree
Properties of B tree
Insertion of node in B tree
Deletion of node from B tree
Chapter 12 Session 44
B tree
Exercise on B tree
Concept of B+ and B* tree
Difference between B, B+ and B* tree
Chapter 13 Session 45
Graph
Graph Terminology
Implementation of Graph
Adjacency Matrix
Linked list
Mixed
Chapter 13 Session 46
Graph Traversals
Depth First Search
Breadth First Search
Chapter 13 Session 47
Application of Graph
Shortest Path
Topological Sort