**Midterm information**

__When:__ We will have an in-class midterm exam on November 6.

__What's at stake:__ The midterm will
contribute 36 points (out of 100) for your final class grade.

__Topics covered:__ You will be tested on the material from the first three thematic blocks
in the class: Introduction, Probability review, and (discrete-time) Markov chains. These include what we have covered
in class from the first lecture and up to the module on the PageRank algorithm for ranking nodes in graphs.
You should also be comfortable with the exercises from the homework assignments (Homework 1 to 6).

__Format:__ Open book exam comprising 6 or 7 short problems, along the same lines of those you
have worked out in your homework assignments. To avoid any surprises, below I provide a practice midterm
which you can use to train yourself and get a feel of what is expected.

__Instructions:__ As detailed in the cover page of your exam

- This is an open book, open notes exam.
- Calculators are not needed; laptops, tablets and cell-phones are not allowed.
- Perfect score: 100.
- Duration: 75 minutes.
- Make sure you write your name in the space provided.
- Show all your work, and write your final answers in the boxes when provided.

__Midterm review lecture:__ We will have a review lecture for the midterm on Friday 11/3, 3:25 pm-4:40 pm, in CSB 209.
I will
briefly review the most important concepts and results, and may solve some midterm-style problems. Come prepared with all your questions.
The review notes I handed out are available here.

__Practice midterm:__ A practice midterm is posted here,
and the solutions are available here.

__Past midterms:__

- The Fall 2014 midterm is posted here, and the solutions are available here.
- The Fall 2015 midterm is posted here, and the solutions are available here.
- The Fall 2016 midterm is posted here, and the solutions are available here.
- The Fall 2017 midterm is posted here, and the solutions are available here.