Chapter 1: Asymptotic notation | |
---|---|
Semiconductor Materials | |
Introduction To Data Structures And Algorithms | |
Oscillator With External Forcing - I |
Chapter 2: Notions of space and time complexity | |
---|---|
Quick Sort | |
Tries | |
More Sorting |
Chapter 3: Worst and average case analysis | |
---|---|
Quick Sort | |
Disk Based Data Structures | |
Case Study: Searching For Patterns | |
Priority Queues |
Chapter 4: Design :Greedy approach | |
---|---|
Why Sorting | |
More Sorting | |
Minimum Spanning Trees | |
The Union | |
Prims Algorithm For Minimum Spanning Trees | |
Coupled Oscillations |
Chapter 5: Dynamic programming | |
---|---|
Stacks | |
Introduction To Data Structures And Algorithms | |
Trees | |
Red Black Trees | |
Insertion In Red Black Trees | |
Coupled Oscillations |
Chapter 6: Divide and conquer | |
---|---|
Dictionaries | |
Quick Sort | |
Why Sorting |
Chapter 7: Tree and graph traversals | |
---|---|
Trees | |
Tree Walks / Traversals | |
Data Structures For Graphs | |
Two Applications Of Breadth First Search | |
Depth First Search |
Chapter 8: Connected components | |
---|---|
Hashing | |
Graphs | |
Two Applications Of Breadth First Search | |
Depth First Search | |
Applications Of Dfs |
Chapter 9: Spanning trees | |
---|---|
Trees | |
Red Black Trees | |
Insertion In Red Black Trees | |
Disk Based Data Structures | |
Why Sorting |
Chapter 10: Shortest paths | |
---|---|
Data Structures For Graphs | |
Single Source Shortest Paths | |
Single Source Shortest Paths |
Chapter 11: Hashing | |
---|---|
Dictionaries | |
Damped Oscillator - I | |
Damped Oscillator - I | |
Hashing |
Chapter 12: Sorting | |
---|---|
Deletion | |
Quick Sort | |
Trees | |
Why Sorting | |
More Sorting |
Chapter 13: Searching | |
---|---|
Dictionaries | |
Ordered Dictionaries | |
Trees | |
Disk Based Data Structures | |
Applications Of Dfs |
Chapter 14: Asymptotic analsis (best , worst , average cases) of time and space | |
---|---|
Introduction To Data Structures And Algorithms | |
Tries | |
Why Sorting |
Chapter 15: Upper and Lower bounds | |
---|---|
The Union |
Chapter 16: Basic concepts of complexity classes P | |
---|---|
More Sorting |
Chapter 17: Basic concepts of complexity classes NP | |
---|---|
Tries |
Chapter 18: Basic concepts of complexity classes NP hard | |
---|---|
Tries |
Chapter 19: Basic concepts of complexity classes NP complete | |
---|---|
Tries |