Table of contents:
Frequently Asked Questions:
If the question you have is not answered here, take a look at the other pages here, piazza and Blackboard. If you still have questions, feel free to contact us (preferably through piazza).
General
-
Piazza is a forum where everyone can submit their own question. You can also submit anonymously. When a question is posted everyone, including other students, are able to answer it. This ensures that you have an opportunity to cooparte to find an answer, and enables you to discuss possible answers/solutions.
The TAs and the lecturer will of course also see the forum and answer questions. We strive to be as available as possible to answer any questions you may have, as quick as possible.
Assignments
-
The requirement is to have at least 5 (originally 6) of the 8 (originally 9) assignments approved. If the first 5 assignments you deliver are approved you don’t have to deliver the final 2 assignments. We do however recommend that you deliver all assignments, even if it is after the deadline, as this will aid your learning and ensure you get feedback from our TAs if necessary.
-
Some of the exercises in this course can be challenging, but it is important to read and understand the curriculum. Just remembering things is not enough to master algorithms, you have to continually work with your understanding of what can be complex topics.
Before doing an exercise it can be a good idea to review your notes, read the corresponding chapters in the book, and see if you understand the notions presented. Of course, you can always ask for help from our teaching assistants as they are more than willing to help you and explain the exercises to you, don’t be afraid to use the resources available to you! You can find more information about the TAs on the assignment page. -
Some of the theoretical assignments have star tasks. These tasks represent extra hard problems that are supposed to challenge those who are up for it. They are not compulsory, but they can be great practice. There is also a lot of good practice in attempting a star problem without necessarily solving it. Even if you don’t fully understand it, you will learn patterns and concepts that could be useful for general problem-solving in the course.
If a task is marked with \(\bigstar\), then all subtasks of this task are also \(\bigstar\)-tasks.
Exam
-
Unfortunately there are no previous exams, as this is a brand new course. We recommend you look at the practice exam (exercise 9) to get an idea of how the exam will be.
You should also look at the curriculum page to try and understand the central goals from each chapter and read and understand the contents of the book to prepare. -
No, the programming parts of the assignments are meant to help you understand the algorithms in the course better by actually using them in a Python program. The exam itself will not feature any programming, but an understanding of pseudocode is required. Remember to check out the practice exam (exercise 9) to see an example of how the exam can look like.
-
The most up to date information about the exam is found on StudentWeb, or the official course page.