Skip to content

Latest commit

 

History

History
44 lines (28 loc) · 2.49 KB

README.md

File metadata and controls

44 lines (28 loc) · 2.49 KB

Programming 1 (NPRG030) and Introduction to Algorithms (NPRG062) Tutorials

Tutorials happen every Tuesday (9:50) and Thursday (9:50) in the room N11.

Useful Links

Practice Problems

How to Pass

To pass the Introduction to Algorithms tutorials, you need to have sufficient homework score. To pass the Programming 1 tutorials, you need to have sufficient homework score, pass the test at the end of the semester, and submit and present your semestral work.

Homework

Homework is submitted via ReCodEx (see above). To pass the tutorials, your homework score needs to be at least 70% of the maximum (excluding bonus assignments).

Test

There will be a programming test at the very end of the semester. If you do not pass the test, there will be additional opportunities to retake it during the exam period. You have a total of three attempts.

Semestral Project

For your semestral project, you will choose and solve a nontrivial programming task. Students typically implement some interesting algorithm, write a simple computer game or a command line tool. Before you start working on your project, I'll first need to approve the topic to make sure it's not too easy (or too hard). Send me a short description and specification of your project and wait for me to approve it before you start writing code.

Deadlines for proposals and submissions can be found here. To submit your project, you need to provide the following:

  • Implementation - source code
  • Test data - sample inputs and outputs, if applicable
  • User documentation - how to use your program
  • Developer documentation - how your program works

Once you have all that, simply send me an email and if everything is alright, we will meet up (online or in person) and you'll present your project to me. Note that there's usually about a week between submission and presentation, so plan accordingly.