Data Structures is a fundamental subject in modern Computer Science. Every programmer and developer must be well versed with it. This course helps you understand the design, implementation and analysis of Data Structures Thro. C++.
- Introduction To Data Structures
- Linear and Binary Search
- Searching and Frequency Count
- Analysis of Searching Methods
- Hashing Techniques
- Sorting Techniques
- Sorting and Recursion
- Quicksort Algorithm
- Structures
- Polynomials
- Two Dimentional Arrays
- Sparse Matrices
- Transpose of Sparse Matrices
- Addition of Sparse Matrices
- Multiplication of Sparse Matrices
- Storage of Arrays
- Dynamic Memory Allocation
- Procedural Programming
- OO Solution
- Classes in C++
- this Pointer
- Access Specifiers and Constructor
- Function Overloading
- Constructors
- Types Of Constructors
- Operator Overloading
- Pre, Post Incr and References
- More About References
- Dynamic Memory Allocation - I
- Dynamic Memory Allocation - II
|
- Static Members
- Reuse Mechanisms
- Containership and Inheritance
- Virtual Functions
- Linked List
- Operations On A Linked List
- Ascending Order Linked List
- Reversing And Merging Linked List
- Linked List And Polynomials
- Circular Linked List
- Doubly Linked List
- Stack
- Stack as Linked List
- Stack and Expressions
- Infix to Postfix using stack
- Postfix Evaluation
- Queue
- Circular Queue
- Dequeue And Priority Queue
- Trees
- Tree Traversal
- Binary Search Trees - I
- Binary Search Trees - II
- Binary Tree
- Graph
- Adjacency Multilist
- Depth First Search
- Breadth First Search
- Spanning Tree
- Dijkstras Algorithm
|
