Advanced Data Structures — KopHubTheory courseSemester 3NEP 2020
Advanced Data Structures
Advanced trees, graphs, hashing, and algorithmic techniques for designing efficient data structures.
Introduction to Algorithms and Pseudocode Algorithmic Paradigms and Divide-and-Conquer Overview Greedy Method: General Principles and Machine Scheduling Course details
- Academic year
Course roadmap
Choose a module
5 ready · 1 coming soon
Computer Algorithm
- Introduction to Algorithms and Pseudocode
- Recursive Algorithms
- Performance Analysis: Space and Time Complexity
- +2 more topics
Content statusIn progress Divide & Conquer
- Algorithmic Paradigms and Divide-and-Conquer Overview
- Binary Search Algorithm
- Finding Maximum and Minimum Elements
- +2 more topics
Tree and Graph
- Binary Tree Fundamentals
- Advanced Tree Structures: BSTs, AVL, and Heaps
- Graph Definitions, Representations, and Traversals
- +2 more topics
Unit 4
This module is being prepared. It will become available without changing your course link.
Algorithm Design
- Greedy Method: General Principles and Machine Scheduling
- Greedy Method: Knapsack, Job Sequencing, and Optimal Storage
- Greedy Method: Optimal Merge Patterns and Huffman Codes
- +2 more topics
Complexity classes P & NPComplete
- Introduction to P and NP Classes
- Understanding Polynomial Time Reductions
- NP-Completeness: Definition and Examples
Advanced Data Structures
6 Modules
Advanced Data Structures
6 Modules