1. Lecture 41 CSE 331 Dec 10, 2010

2. HW 10 due today Q1 in one pile and Q 3+4 in another I will not take any HW after 1:15pm

3. Finals 3:35-6:05pm KNOX 104 Tue, Dec 14 Blog post on the finals up

4. On Friday, Dec 10 hours-a-thon Atri: 2:00-3:30 (Bell 123) Jeff: 4:00-5:00 (Bell 224) Alex: 5:00-6:30 (Bell 242)

5. Reminder Please fill in the feedback forms from the Engineering school

6. New Grading policy Step 1: Compute grade cut-offs using existing scheme (25% mid term+ 40% finals) Step 2: If 65% finals leads to a better grade for you, I’ll go with the new option

7. High level view of CSE 331 Problem Statement Algorithm Problem Definition “Implementation” Analysis Correctness+Runtime Analysis Data Structures Three general techniques

8. If you are curious for more CSE431: Algorithms CSE 396: Theory of Computation

9. Another course of interest (S 11) CSE 443: Compilers Pre-req: 396 Offered infrequently!

10. HW 10 due today Q1 in one pile and Q 2+3 in another I will not take any HW after 1:15pm

11. Now relax…

12. 12 Coding Theory

13. 13 The setup C(x) x y = C(x)+error x Give up Mapping C  Error-correcting code or just code  Encoding: x  C(x)  Decoding: y  X  C(x) is a codeword

14. 14 Different Channels and Codes Internet – Checksum used in multiple layers of TCP/IP stack Cell phones Satellite broadcast – TV Deep space telecommunications – Mars Rover

15. 15 “Unusual” Channels Data Storage – CDs and DVDs – RAID – ECC memory Paper bar codes – UPS (MaxiCode) Codes are all around us

16. 16 Redundancy vs. Error-correction Repetition code: Repeat every bit say 100 times – Good error correcting properties – Too much redundancy Parity code: Add a parity bit – Minimum amount of redundancy – Bad error correcting properties Two errors go completely undetected Neither of these codes are satisfactory 1 1 1 0 011 0 0 0 01

17. 17 Two main challenges in coding theory Problem with parity example – Messages mapped to codewords which do not differ in many places Need to pick a lot of codewords that differ a lot from each other Efficient decoding – Naive algorithm: check received word with all codewords

18. 18 The fundamental tradeoff Correct as many errors as possible with as little redundancy as possible Can one achieve the “optimal” tradeoff with efficient encoding and decoding ?

19. Interested in more? CSE 545, Spring 2011

20. 20 Datastream Algorithms Single pass over the inputPoly-log “scratch” space

21. 21 Data Streams (another application) Databases are huge – Fully reside in disk memory Main memory – Fast, not much of it Disk memory – Slow, lots of it – Random access is expensive – Sequential scan is reasonably cheap Main memory Disk Memory

22. 22 Data Streams (another application) Given a restriction on number of random accesses to disk memory How much main memory is required ? For computations such as join of tables Main memory Disk memory

23. Group Testing Overview Test soldier for a disease WWII example: syphillis

24. Group Testing Overview Test an army for a disease WWII example: syphillis What if only one soldier has the disease? Can pool blood samples and check if at least one soldier has the disease

25. Whatever your impression of the 331 IT WAS

26. Hopefully it was fun!

27. Thanks!