CSC 310, Fall 2011 Solutions to Theory Assignment #1
Question 1 (15 marks): Consider a source with an alphabet of three symbols, a1 , a2 , a3 ,
with probabilities p1 , p2 , p3 . Suppose we use a code in which the codewords for a1 , a2 , a3 are
0, 10, 11.
CSC 310, Fall 2011 Theory Assignment #2
Due in class on November 14. Worth 7% of the course grade.
Note that this assignment is to be done by each student individually. You may discuss it in
general terms with other students, but the work you hand in shou
CSC 310, Fall 2011 Theory Assignment #3
Due in class on December 5. Worth 7% of the course grade.
Note that this assignment is to be done by each student individually. You may discuss it in
general terms with other students, but the work you hand in shoul
CSC 310, Fall 2011 Practical Assignment #1
Due in class on November 21. Worth 10% of the course grade.
Note that this assignment is to be done by each student individually. You may discuss it in
general terms with other students, but the work you hand in
CSC 310, Fall 2011 Solutions to Theory Assignment #3
Question 1 (35 marks): Consider a channel for which the input alphabet and output
alphabet are both cfw_0, 1, 2, and for which the channel transition probabilities are given by
Q0|0 = Q2|2 = 1, Q0|1 = Q
CSC 310, Fall 2011 Theory Assignment #1
Due in tutorial on October 7. Worth 7% of the course grade.
Note that this assignment is to be done by each student individually. You may discuss it in
general terms with other students, but the work you hand in sho
CSC 310, Fall 2011 Solutions to Theory Assignment #2
Question 1 (50 marks): Suppose that the designer of a data compression system uses a
model for a source of binary symbols, X1 , X2 , . . . , Xn , in which these symbols are independent given the probabi
Answers for CSC 310 Test #1
Some questions have more than one possible answer.
1. (a) First code:
001 can be decoded as either 001 or 00,1.
The code does satisfy the Kraft-McMillan
inequality.
Second code:
0110 can be decoded as either 0,11,0 or 01,10.
Th