Go to All Subject -

Computer Sotware and Inormation Technology Engineering CSE IT

Programming and Data Structure II - CS6301

Programming and Data Structure II

OBJECT ORIENTED PROGRAMMING FUNDAMENTALS


-:- C++ Programming Features
-:- Data Abstraction
-:- Data encapsulation
-:- Class
-:- Objects
-:- Constructor
-:- Static Members
-:- Constant Members
-:- Member Functions
-:- Pointers
-:- References
-:- Role of this Pointer
-:- Storage class
-:- Function as Arguments

OBJECT ORIENTED PROGRAMMING CONCEPTS


-:- String Handling
-:- Copy Constructor
-:- Polymorphism
-:- Function Overloading
-:- Operator Overloading
-:- Dynamic Memory Allocation
-:- Nested Classes
-:- Inheritance and its Type
-:- Virtual Functions

C Plus PROGRAMMING ADVANCED FEATURES


-:- Abstract Class
-:- Exception Handling
-:- Standard Libraries
-:- Generic Programming
-:- Templates: Class and function templates
-:- Containers
-:- Iterators
-:- Function Adaptors
-:- Allocators
-:- Parameterizing the Classes
-:- File Handling Concepts

ADVANCED NON


-:- Tree Introduction
-:- Binary Tree ADT: Implementation, Types, Application, Comparison
-:- Binary search tree ADT
-:- AVL Trees
-:- B-trees
-:- Red–black tree
-:- Splay trees
-:- Binomial Heaps
-:- Fibonacci Heaps
-:- Disjoint Sets data structure
-:- Amortized analysis
-:- Accounting Method
-:- Potential Method
-:- Aggregate Analysis

GRAPHS


-:- Representation of Graphs
-:- Breadth First Traversal
-:- Depth First Traversal
-:- Topological Sort
-:- Minimum Spanning Trees
-:- Kruskal's algorithm
-:- Prim’s Algorithm
-:- Shortest Path Algorithms
-:- Dijkstra’s Algorithm
-:- Bellman-Ford Algorithm
-:- Floyd - Warshall Algorithm