# Homework

**There are TWO compulsory mid-term homework assignments in the course:**

**1. Probability theory check**

**2. Basic queuing theory, covering lecture and recitation material 1-6.**

**1. Probability theory check**

The objective of the homework is to make sure you know the probability theory basics that are essential for the course. Check the "Probability recall" link under General information.

Homework 1 submission deadline: 2017 Jan 26, 14:00. However, I encourage you to submit earlier.

- Problems
- Solutions

**2. Basic queuing theory**

The objective if the homework is to make sure you started to study and have the necessary knowledge to understand the more advanced material.

Homework 2 submission deadline: TBD

- Problems
- Solutions

**How to submit**

Homework solutions have to be submitted on a paper copy, hand written. Solutions can be submitted:

- You can give me your solution at a lecture or recitation.
- At the STEX office (Osquldas vag 10). If the office is closed, you can leave your solution in their mail-box.
- E-mail submission: vfodor@kth.se

Use the home assignment cover page (pdf) , or similar hand-written version. Otherwise your solution may get lost!

**How to work**

You can discuss the problems with other students, but copying from other solutions is not allowed. Also consider KTHs general information on plagiarism.

**Grading**

The homeworks are graded P/F. You pass the moment, if you reach 75%. You receive full points even if your solution has errors, but you have to show a real attempt to solve the problem.

In case you can not submit the homework on time, contact the teacher in advance. Otherwise 5 points will be subtracted from your exam results.

**General advice**

- The home assignment problems are easier than exam problems, so, do not take it easy, even if your solutions here are correct.

- It is of highest importance for you to find the correct queuing system to solve a problem. If the queuing system is wrong, the solution can not be correct. Also, do not use equations from "other" queuing systems.

- If there is a formula (you know it or it is listed on the formula sheet) you do not need to derive it. You need to derive a formula, if we write "derive" or "prove".

- Be careful with rounding numbers, and avoid it if possible. We work with small numbers here. Also, keep using common fractions (ratio of integers) if possible, not the decimal form, when small but important parts may disappear.

- Read the published solutions in detail, even if your solution was correct. Maybe you find some interesting ideas.