Introduction to Machine Learning : Examinations

These instructions apply to all separate examinations based on the Autumn 2014 lecture course.  That means separate examinations from Spring 2015 until the next time the course is lectured.

 

Who can participate?

If you participated in the Autumn 2014 course and completed at least 50% of the homework, but did not pass the exam or wish to improve your grade, you can take the separate examination as a renewal examination.  This means that the separate examination replaces the course examination.  You don't need to do anything extra in addition to the exam.  You homework from Autumn 2014 carries over and will constitute 40% of your grade, as it did in conjunction with the regular course exam.

If you did not complete at least 50% of homework in Autumn 2014, you can take the separate examination only if you complete additionally a set of programming assignements.,  The details are given below.  If you take this route, the programming assignment will constitute 20% of your grade, and the exam 80%.

Programming assingnments for separate examination

You should send your solution to the lecturer (Jyrki Kivinen) as explained in the problem description at least one week before the separete examination you plan to take.

What to bring?

As with all the exams at the department, you should bring writing materials (pencil etc. but not your own paper) and some means of identification (student card, passport etc.).

Additionally, to the exams of this course, you may bring a "cheat sheet" which is one hand-written A4 sheet, to which you can write whatever information you think might be useful in the exam, using both sides if you wish. Even if you don't think you'll really need a cheat sheet in the exam, you may wish to create one just to help clarify to yourself what you think the important things are.

You will not need, and should not bring, a calculator.

 

What will be in the exam?

 

In the exam, you may be asked to

  • briefly define and explain key concepts and terms
  • explain algorithms, techniques and other broader topics, possibly answering "what," "why" and "how" questions
  • simulate an algorithm on a (very small) data set
  • make basic mathematical calculations and derivations
  • something else relevant to the content and learning objectives of the course.

 

Below are some sample exams from previous years. They should give a good idea of what to expect.