Programming and Data Structure II
- Lecture Notes, Study Materials and Important questions answers

Subject : Programming and Data Structure II

OBJECT ORIENTED PROGRAMMING FUNDAMENTALS

1. C++ Programming Features - Answer (click here)
2. Data Abstraction - Answer (click here)
3. Data encapsulation - Answer (click here)
4. Class - Answer (click here)
5. Objects - Answer (click here)
6. Constructor - Answer (click here)
7. Static Members - Answer (click here)
8. Constant Members - Answer (click here)
9. Member Functions - Answer (click here)
10. Pointers - Answer (click here)
11. References - Answer (click here)
12. Role of this Pointer - Answer (click here)
13. Storage class - Answer (click here)
14. Function as Arguments - Answer (click here)

OBJECT ORIENTED PROGRAMMING CONCEPTS

1. String Handling - Answer (click here)
2. Copy Constructor - Answer (click here)
3. Polymorphism - Answer (click here)
4. Function Overloading - Answer (click here)
5. Operator Overloading - Answer (click here)
6. Dynamic Memory Allocation - Answer (click here)
7. Nested Classes - Answer (click here)
8. Inheritance and its Type - Answer (click here)
9. Virtual Functions - Answer (click here)

C Plus PROGRAMMING ADVANCED FEATURES

1. Abstract Class - Answer (click here)
2. Exception Handling - Answer (click here)
3. Standard Libraries - Answer (click here)
4. Generic Programming - Answer (click here)
5. Templates: Class and function templates - Answer (click here)
6. Containers - Answer (click here)
7. Iterators - Answer (click here)
8. Function Adaptors - Answer (click here)
9. Allocators - Answer (click here)
10. Parameterizing the Classes - Answer (click here)
11. File Handling Concepts - Answer (click here)

ADVANCED NON

1. Tree Introduction - Answer (click here)
2. Binary Tree ADT: Implementation, Types, Application, Comparison - Answer (click here)
3. Binary search tree ADT - Answer (click here)
4. AVL Trees - Answer (click here)
5. B-trees - Answer (click here)
6. Red–black tree - Answer (click here)
7. Splay trees - Answer (click here)
8. Binomial Heaps - Answer (click here)
9. Fibonacci Heaps - Answer (click here)
10. Disjoint Sets data structure - Answer (click here)
11. Amortized analysis - Answer (click here)
12. Accounting Method - Answer (click here)
13. Potential Method - Answer (click here)
14. Aggregate Analysis - Answer (click here)

GRAPHS

1. Representation of Graphs - Answer (click here)
2. Breadth First Traversal - Answer (click here)
3. Depth First Traversal - Answer (click here)
4. Topological Sort - Answer (click here)
5. Minimum Spanning Trees - Answer (click here)
6. Kruskal's algorithm - Answer (click here)
7. Prim’s Algorithm - Answer (click here)
8. Shortest Path Algorithms - Answer (click here)
9. Dijkstra’s Algorithm - Answer (click here)
10. Bellman-Ford Algorithm - Answer (click here)
11. Floyd - Warshall Algorithm - Answer (click here)