| Due
| Assignment
| File
| Sol.
| Mine
| Comments
| Handout
|
| 03/16/01
| CS138b (F)
|
|
| ps
| (4:00pm) F.1 can be done in O(mlogm \sqrt{n})
if using binary search
| 03/12/01
|
| 03/14/01
| CS134b (L5)
|
|
| 
| Only did the optimization
| 03/01/01
|
| 03/14/01
| EE127b (P2)
|
|
|
| (13:30pm)
| 02/23/01
|
| 03/14/01
| EE126b (F)
|
|
|
| (noon) done 03/12. Written by hand - no electronic version
| 03/12/01
|
| 03/13/01
| CNS188a (6)
| ps
|
| ps
| (5:00pm) gave up 2(b). One solution to 2(b) ps.
| 02/27/01
|
| 03/09/01
| CS138b (16)
| ps
|
| ps
| (4:00pm) wrong in 3(a) - the probabilities are the same. Here is
a C program to verify this.
| 03/01/01
|
| 03/07/01
| EE126b (7)
|
|
| ps
| Cover 14
| 02/28/01
|
| 03/05/01
| CNS188a (4)
| ps
|
|
| Project - LT Calculator
| 02/12/01
|
| 03/02/01
| CS138b (15)
| ps
|
| ps
| (4:00pm) 1st free late. 3(c) can be done in O(|J|2)
| 02/22/01
|
| 03/02/01
| EE127b (4)
|
|
| ps
| J&Z 1.3 pp.16-21, RJM Chapter 12.2 pp.1068-77, Wicker 12.1,12.2,12.4
For 4.3, I used log(y|x) instead of -log(y|x).
Either is OK.
| 02/21/01
|
| 02/28/01
| EE126b (6)
|
|
| ps
| Cover 14
| 02/21/01
|
| 02/27/01
| CNS188a (5)
| ps
|
| ps
|
| 02/13/01
|
| 02/26/01
| CS134b (L4)
|
|
|
|
| 02/12/01
|
| 02/23/01
| CS138b (14)
| ps
|
| ps
| (4:00pm)
| 02/16/01
|
| 02/21/01
| EE126b (5)
|
|
| ps
| Cover 14
| 02/14/01
|
| 02/16/01
| CS138b (13)
| ps
|
| ps
| (4:00pm)
| 02/08/01
|
| 02/16/01
| EE127b (3)
|
|
| ps
| Wicker 8.3, Chapter
9.6 pp.18-20
| 02/07/01
|
| 02/13/01
| CNS188a (3)
| ps
|
| ps
| C.E.Shannon's Master thesis
| 01/30/01
|
| 02/12/01
| CS134b (L3)
|
|
|
| Solution: fc_ir_ast.ml
| 01/29/01
|
| 02/09/01
| CS138b (12)
| ps
|
| ps
| (4:00pm)
| 02/01/01
|
| 02/09/01
| EE127b (P1)
|
|
|
| (3:30pm) RJM "The Decoding of Reed-Solomon Codes"
| 01/03/01
|
| 02/09/01
| EE126b (M)
|
|
|
| (10:30am) Written by hand - no electronic version
A stupid mistaken: didn't calc entropies for M.1.
| 02/07/01
|
| 02/02/01
| CS138b (11)
| ps
|
| ps
| (4:00pm)
| 01/26/01
|
| 02/02/01
| EE127b (2)
|
|
| ps
| Wicker 2,8.1,pp.176-183, Chapter
9 pp.1-18,21-24,29-33
| 01/17/01
|
| 01/31/01
| EE126b (4)
|
|
| ps
| Cover 10. History of solving problem 4.1: ps.
For 4.3, the strategy is bad. Just send n-k out of n
bits if D=k/n.
| 01/24/01
|
| 01/30/01
| CNS188a (2)
| ps
|
|
| R.C.Minnick "Linear-Input Logic"
Written by hand - no electronic version
| 01/16/01
|
| 01/29/01
| CS134b (L2)
|
|
|
| Solution: fc_ast_parse.mly,
fc_ast_lex.mll
| 01/19/01
|
| 01/26/01
| CS138b (10)
| ps
|
| ps
| (4:00pm)
| 01/19/01
|
| 01/24/01
| EE126b (3)
|
|
| ps
| Cover pp.266-276,336-367
| 01/17/01
|
| 01/19/01
| CS138b (9)
| ps
|
| ps
| (4:00pm) correction
| 01/11/01
|
| 01/19/01
| EE126b (2)
|
|
| ps
| Cover 9
| 01/10/01
|
| 01/17/01
| CS134b (L1)
|
|
|
| splay_set.mli, splay_set.ml.
Solution: splay_set.mli,
splay_set.ml.
| 01/08/01
|
| 01/17/01
| EE127b (1)
|
|
| ps
| Wicker 2.2, RJM Finite Field 5 pp.29-34
| 01/03/01
|
| 01/16/01
| CNS188a (1)
| ps
|
| ps
|
| 01/02/01
|
| 01/10/01
| EE126b (1)
|
|
| ps
| Cover 12 pp.279-304,319-326
In 5(a), I did not prove that P* is the minimum...
| 01/03/01
|