Algorithms and Data Structures 2020

Week 7. Maps and Hash tables

Key Concepts

Home

Practical Information + -
- Learning Outcomes
- Compulsory Assignments
Week 1. Foundations of Algorithms + -
Week 2. Data Structures + -
- Key Concepts
- Projects and Exercises
  - Compulsory Assignment
  - Exercises
Week 3. Complexity Analysis + -
- Key Concepts
  - Complexity
  - Recursion
- Projects and Exercises
Week 4. Stacks and Queues + -
- Exercises
Week 5. Trees + -
- Projects and Exercises
Week 6. The Heap + -
- Projects and Exercises
Week 7. Maps and Hash tables + -
- Key Concepts
- Projects and Exercises
Week 8. Search Trees
Week 9. Text Processing
- Compulsory Assignment
- Other Exercises
Week 10. Dynamic Programming
- Compulsory Assignment
- Other Exercises
Week 11. Sorting
- Compulsory Assignment
- Exercises
Week 12. Shortest Path + -
- Algorithms
- Projects and Exercises
Week 13. Memory
- Compulsory Assignment
- Exercises
Week 14. NP-Completeness + -
- Projects and Exercises
  - Compulsory Assignment
  - Exercises
Exam Sets and Solutions

[next] [tail] [up]

8.1 Key Concepts

The Map interface
Ordered Maps

[next] [front] [up]

Hans Georg Schaathun / hasc@ntnu.no

25th January 2021 (8:17) | PDF av sidene