Lecture about various types of algorithms and their time complexity (follows NTIN060 Algorithms and Data Structures 1). I lead one of the tutorials this semester. For information on the lecture, take a look at the page of Ondřej Čepek. To submit homeworks, you can enroll into my tutorial on the Postal Owl using the link https://owl.mff.cuni.cz/join/a0813cf612ab or the token a0813cf612ab.
You can find the problem sheets below:
COURSE INFORMATION
To get the tutorial credit, you must obtain at least 100 points from the homework and quizzes.
Homework:
- There will be homeworks worth a total of 120 points.
- Submissions will be done through the Postal Owl system.
- Once you receive feedback for your homework, you may have up to two chances to fix any mistakes.
- You may ask for extensions for the homework deadlines only with a valid excuse.
- Unless the point above applies, you can submit a homework up to 2 weeks late for 2/3 of its points.
- I will give my first feedback a week after publishing the homework.
- Do not cheat. This includes using AI, copying from MathStackExchange and similar sites, as well as submitting identical solutions as your colleagues. You can discuss the homework with your friends, but please write down solutions on your own. I will report any and all suspicious behavior.
Quizzes:
- Starting from Week 2, there will be a quiz at the beginning of each tutorial.
- Quizzes will be worth a total of at least 30 points.
- What to expect: definitions, parts of algorithms, propositions from the lecture.
I don’t require attendance. If you feel that you can benefit more from self-study or anything else, go for it.