Data Structures and Algorithms - Computer
This Course is Mapped to SPPU 2019 Pattern Syllabus. Every Data structures is explained thoroughly concerning following points: 1. Concept 2. Examples 3. Algorithm 4. Logic 5. Code 6. Analysis
">
Key to address translation techniques
Collision resolution techniques
Adjecency Matrix and List
Breadth First Search (BFS)
Depth First Search (DFS)
Minimum Spanning Tree (MST) - Prims and Kruskal algorithms
Floyd Warshall Algorithm
Dijiktras Algorithm
Topological Sort
Tree Traversing Techniques
Preorder - recursive
Preorder - Non recursive
Inorder and Postorder
Tree creation using infix,prefix,postfix Expressions
Binary Search Tree
Expression Tree
Threaded binary tree 1
Threaded binary tree 2
OBST prerequisites
OBST examples
AVL tree 1
AVL tree 2
Heap Data Structure
Prerequisite Course Available for FREE
Immediate Support is available for doubt clearing on Discussion Section
The interactive nature of the tutorials makes it a popular choice among students.
The instructors provide tips and tricks to help you adopt best coding practices