Course Page ✏️
- Algorithms and Methods of Programming
- DIP321
- Description
-
Students are able to independently study and break down a larger algorithmic problem.
Students are able to develop algorithmic solutions to nontrivial graph problems.
Students can determine complexity using Big-O notation with and without use of Master Theorem. - ECTS credits
- 3
- Teaching Language
- English
- Exam Language
- English
- Support Materials Language
- English
- Basic Learning Outcomes
- Managing Entity (faculty)