Discrete Maths: Ways of sitting 3 exams during a 13 week semester. I had a discrete maths test today and this question was the last one and it really threw me off.

During a 13 week semester ( no breaks in between ), a student must sit 3 exams >for a particular course. 
  However, he must sit them in order, i.e 1st -> 2nd -> 3rd. In other words, you must first sit the 1st exam, then the 2nd then the 3rd. so can't sit the second exam without having sat the 1st one, etc..
If he can only sit one exam per week, in how many ways can the student sit the exams.

I tried during inclusion/exclusion principle but it got messy real quick. I also thought of doing the lines and dots method but figured it's wrong since the dots are not identical.
I'm just curious how to do this.
the second part of the question was

Suppose they are not allowed to sit two exams in consecutive weeks, now in how >many ways can the student sit the exams.

I didn't even attempt the second part as I did not have time.
Any help would be greatly appreciated. 


During a $13$-week semester, a student must sit $3$ exams for a particular course.  However, he must sit them in order (the first exam must precede the second and the second must precede the third).  If he can only sit one exam per week, in how many ways can he sit the exams?

Method 1:  Since he must sit the exams in order, his examination schedule is completely determined by choosing during which three of the thirteen weeks he schedules an exam.  Hence, there are 
$$\binom{13}{3}$$
ways for the student to schedule his exams.
Method 2:  This method is less efficient, but I am adding it to address the questions raised in the comments.
Suppose the student takes the $k$th examination in week $a_k$.  Define 
\begin{align*}
x_1 & = a_1\\
x_2 & = a_2 - a_1\\
x_3 & = a_3 - a_2\\
x_4 & = 13 - x_3
\end{align*}
Then 
$$x_1 + x_2 + x_3 + x_4 = 13 \tag{1}$$
Observe that $x_1$ is a positive integer.  Since the student cannot sit two examinations in the same week and the exams must be sat in order $x_2$ and $x_3$ are also positive integers.  Since the student can sit an examination in the last week, $x_4$ is a nonnegative integer.  
We can transform equation 1 into an equation in the positive integers by setting $x_4' = x_4 + 1$.  Substituting $x_4' - 1$ for $x_4$ in equation 1 yields 
\begin{align*}
x_1 + x_2 + x_3 + x_4' - 1 & = 13\\
x_1 + x_2 + x_3 + x_4' & = 14 \tag{2}
\end{align*}
Equation 2 is an equation in the positive integers that is equivalent to equation 1.  A particular solution of equation 2 corresponds to the placement of three addition signs in the $13$ spaces between successive ones in a row of $14$ ones.
$$1 \square 1 \square 1 \square 1 \square 1 \square 1 \square 1 \square 1\square 1 \square 1 \square 1 \square 1 \square 1 \square 1$$
For instance, choosing the third, seventh, and thirteenth spaces yields 
$$1 1 1 + 1 1 1 1 + 1 1 1 1 1 1 + 1$$
which corresponds to the solution $x_1 = 3$, $x_2 = 4$, $x_3 = 6$, $x_4' = 1$ ($x_4 = 0$) or $a_1 = 3$, $a_2 = 7$, $a_3 = 13$.  The number of such solutions is the number of ways we can select three of the thirteen spaces between successive ones in a row of fourteen ones in which to place an addition sign, which is 
$$\binom{13}{3}$$  

Suppose a student cannot sit an exam in consecutive weeks.  In how many ways can the student sit the exams?

We arrange ten blue balls and three green balls so that no two of the green balls are consecutive.
Line up ten blue balls in a row.  This creates eleven spaces, nine between successive blue balls and two at the ends of the row.
$$\square \color{blue}{\bullet} \square \color{blue}{\bullet} \square \color{blue}{\bullet} \square \color{blue}{\bullet} \square \color{blue}{\bullet} \square \color{blue}{\bullet} \square \color{blue}{\bullet} \square \color{blue}{\bullet} \square \color{blue}{\bullet} \square \color{blue}{\bullet} \square$$
To ensure that the three green balls are separated, choose three of these eleven spaces for the green balls.  For instance, if we choose the third, sixth, and eleventh spaces, we obtain
$$\color{blue}{\bullet} \color{blue}{\bullet} \color{green}{\bullet} \color{blue}{\bullet} \color{blue}{\bullet} \color{blue}{\bullet} \color{green}{\bullet} \color{blue}{\bullet} \color{blue}{\bullet} \color{blue}{\bullet} \color{blue}{\bullet} \color{blue}{\bullet} \color{green}{\bullet}$$
Now number the balls from left to right.  The numbers on the green balls are the examination weeks.  In this case, they are $a_1 = 3$, $a_2 = 7$, and $a_3 = 13$.  The number of such solutions is the number of ways we can select three of these eleven spaces in which to insert a green ball. Hence, there are 
$$\binom{11}{3}$$
ways to schedule the exams so that the student does not sit exams in consecutive weeks.
