Main learning outcomes for this class
- Big O Notation:
- I understand the basic meaning of Big O Notation
- I know how to estimate the complexity of simple programs and how to use it to estimate if my program will not obtain time limit exceeded when submitted
- Fundamental Data Structures:
- I know the concept of stacks, queues and deques and how to use them on my programming language
- I know the concept of sets (set and multiset) and how to use them on my programming language
- I know the concept of maps/dictionaries (map and multimap) and how to use them on my programming language
- I know the concept of priority queues (priority_queue) and how to use them on my programming language
- I understand the concept of ordered data structures and how to traverse them using iterators
- I know how to use a custom comparator for more more complex data than simple primitive types
- I know that there are non ordered data structures for the fundamental data structures (ex: unordered_set and unordered_map)
Study Material
- Big O Notation
- Programming Language References
- Fundamental Data Structures:
Pedro Ribeiro - DCC/FCUP |
Último update:
