CMPT 441-711: Homework 2
I Fall 2014
Question 6.9
Denote by Sk the set of oors that can be reached from oor 32 in k, but not in k 1, steps. Then,
obviously, S0 = 32. Now we give description of the algorithm for computing Sk , for any k > 0, assuming
that

CMPT 441-711: Homework 1
Fall 2014
Question 2.17
We can model this problem as a set of two recurrence relations. Let V (t) be the number of viruses after t
minutes. From the problem description we can obtain the following recurrence:
V (0) = 1
V (t) = 2V

CMPT 441-711: Homework 3
Question 11.2
We modify the HMM by splitting states F (for fair coin) and L (for loaded coin) into ten states F1 . . . F10
and L1 . . . L10 respectively. Each of these states will have the same emit probabilities as the state F ,

CMPT 441 - 711 Homework Assignment 3, Fall 2014
Due date: Nov 10, 2014
1. Problem 11.2 (pp 407) in Jones and Pevzner.
2. Problem 11.4 (pp 407) in Jones and Pevzner.
3. Problem 11.5 (pp 407) in Jones and Pevzner.
4. Problem 11.6 (pp 408) in Jones and Pevzn

CMPT 441 - 711 Homework Assignment 2, Fall 2014
Due date: Oct 9, 2014
1. Problem 6.9 in pp 212, Jones & Pevzner (10 pts).
2. Problem 6.22 in pp 214, Jones & Pevzner (10 pts).
3. Problem 6.24 in pp 216, Jones & Pevzner (10 pts).
4. Problem 6.25 in pp 216,

CMPT 441 - 711 Homework Assignment 1, Fall 2014
Due date: Sep 26, 2014
1. Problem 2.17 in pp 56, Jones & Pevzner (10 pts)
2. Problem 2.19 in pp 56, Jones & Pevzner (10 pts)
3. Problem 2.20 in pp 56, Jones & Pevzner (10 pts)
4. Problem 4.11 in pp 121, Jone