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.
- C Programming Revision - I
- C Programming Revision - II
- Searching
- Searching & Frequency Count
- Analysis of Searching Methods
- Hashing
- Sorting
- Sorting & Recursion
- Quicksort
- Structures
- Structures & Polynomials
- 2D Arrays
- Sparse Matrices
- Transpose of Sparse Matrices
- Addition of Sparse Matrices
- Multiplication of Sparse Matrices
- Storage
- Dynamic Memory Allocation
- Linked List
- Operations of Linked List - I
- Operations of Linked List - II
- Operations of Linked List - III
- Operations of Linked List - IV
- Circular Linked List
- Doubly Linked List
- Sparse Matrices as Linked List - I
- Sparse Matrices as Linked List - II
- Linked List Using Recursion
- Linked List Using Unions
- Generalized Linked List
|
- Stack
- Stack as a Linked List
- Stack and Expressions
- Stack Operations
- Postfix Evaluation
- Infix To Prefix
- Postfix To Prefix
- Postfix To Infix
- More Conversions
- Queues - I
- Queues - II
- Dequeue & Priority Queue
- Trees
- Tree Traversal
- BST - I
- BST - II
- Binary Tree
- Threaded Binary Tree
- Heap
- AVL & B-Trees
- Graphs
- Adjacency Multilist
- Depth First Search
- Breadth First Search
- Spanning Tree
- Dijkstra's Algorithm
- Memory Management - I
- Memory Management - II
- GarbageCollection
- File Organization
|
