JPEG, Units 3D, 6

RNA, Unit 5    Directions, Unit 6   Counter, Unit 7          TSP, Unit 8

• My office hours (in ECOT 624).
• Suzanne Gallagher is the grader for CSCI 5454. Her email is Suzanne dot Gallagher "the name of our state" dot edu. Her office hour is 10am -11am Mondays in ECCR 252.
• Honor Code: At the top of each assignment include a signed copy of the CU Student Honor Code:
  "On my honor, as a University of Colorado at Boulder student, I have neither given nor received unauthorized assistance on this work." More information on the CU Honor Code
• Other Campus Policies: Disability Services ; Religious Observances
• Downloads
  • Reading .ps files: If you don't have a postscript reader, download a version of ghostscript for your machine. Then you'll be all set - .ps files will open up automatically, and you'll be able to print them too. To do the download, either go to the main ghostscript site , or go directly to the page Obtaining AFPL Ghostscript and choose the version for your OS.
  • If you haven't installed Cygwin on your Windows machine you should - you'll enjoy the best of both the Linux and Windows worlds. Downloading and installing is simple, assuming a high speed Internet connection.
• Here's my list of links to algorithmic material
• Policy on length of answers for homework problems.
• Information on the csel, activating your account, etc.
• How to view classes you miss .
• Remaining Schedule:
  • HW10, the takehome final, is due May 8, the day of the scheduled final exam in our course. This due date holds for CAETE students as well.
  • FCQ's will be administered at the end of class on Wed Apr 23, by Neha Shanbhag.
• Grades. Here are the Final Grades To read the totals & interpret them first read these instructions.
• Here is the algorithm I use to assign final grades.
  • HW1: In class: ave 56/70, std 13, median 53; CAETE: ave 55, std 17, med 60.
  • HW2: In class: ave 71, std 29, median 83; CAETE: ave 76, std 24, med 80.
  • HW3: In class: ave 72, std 23, median 80;
  • HW4: In class: ave 82, std 16, median 85; CAETE: ave 74, std 20, med 78.
  • HW5: In class: ave 65, std 26, median 68; CAETE: ave 76, std 17, med 75.
  • HW6: In class: ave 64/80, std 16, median 69; CAETE: ave 59/80, std 15, med 60.
  • HW7: In class: ave 148/230, std 57, median 169; CAETE: ave 175, std 50, med 200
  • HW8: In class: ave 94/120, std 21, median 104; CAETE: ave 93, std 18, median 98.
  • HW9: In class: ave 55/60, std 8, median 60; CAETE: NA

• Here are some Perl scripts for DP:
  • Paragraphing
  • LCS
• HW10, Takehome Final: Part I & Part II .

  Length limits: The length limits must not be exceeded. They're all roughly 50% more than my solution. Problem 1: 1.5 pages total. Problem 2: 1.5 pages total. Problem 3: .75 page. Problem 4: 1.75 pages total.

  Point values: 340 points total. Problem 1: 90. Problem 2: 90 (15 points for each of i -- vi). Problem 3: 70 (i 50; ii 20); Problem 4: 90 (i 25; iii 20; the others - ii, iv, v - 15 each).

  Error in Problem 2: In line 1 of the code, "return any local min of f,S" should be "return the min of f,S".

  Simplification of Problem 2: Here are 2 simplifications to make your life easier:

  a. In part (iii), your fix to line 3 simply includes more points in the definition of x.

  b. In part (iv), you can assume that MIN has been called from line 4. In other words you can ignore the case that the initial call MIN(G) returns without recursing. [It's entirely obvious that MIN is correct in this case.] So now the 2 occurrences of the phrase "whenever MIN is called" in part (iv) become "whenever MIN(Q) is called".

• FFT Intro. Due Wed. Apr. 23.
  Point Values: 60 points. Each part (i) -- (iii) is worth 20.
• My Powerpoint slides on bsp's & painter's algorithm
• HW#8 Randomized Algorithms. Due Wed. Apr. 16.
  Point Values: 120 points. All questions 1-8 are 15 points.
  Typo: The caption to Fig1(b) should say "R4 contains 1 segment...". So change 'R3' to 'R4'.
• HW#7 Takehome Exam on Units 1-2. Due Wed. Apr. 2. The due date for HW7 has been changed to Monday Apr 7. Point Values: 230 points total. 1: 70 (i:30, ii and iii: 20 each); 2: 40 3: 60 (i 20, ii 40) 4: 50.
• HW6: Beginning Cryptography . Due Monday Mar 17. You may turn this in Wed Mar 19 if you need more time. But HW7 will be posted at the end of this week. Point Values: 1(i) and 2(i) are both 30, 1(ii) and 2(ii) are both 20.

  Correction Problem 1(ii) isn't worded clearly, & may not even be correct. So we'll do 2 things:

  (a) Problem 1(ii) is not required for the assignment. The assignment is worth 80 points total.

  (b) Here's a corrected version of the problem. It will be treated as an Extra Credit worth 10 points. It's due with the assignment.

  A legitimate message M is an arbitrary k-bit binary number (since that's what Bob is sending). Alice signs M by applying her decoding algorithm S_A to M. S_A is your answer to 1(i). So the problem is to find a k-bit number M that causes your algorithm of 1(i) to fail. To do this you can use a stronger assumption than what is given in the assignment: Assume a_1,a_2,...,a_(k-1) is not the sequence of powers of 2 (note the last number is a_(k-1), not a_k as the assignment said); furthermore assume Alice chooses 2 as the value of r.

• Here's the Doomsday Algorithm for calendar arithmetic. I can answer any questions on it!
• HW5: Logs & Mods Due Mon Mar 10. Point Values: 1:75. 2: 25. 1(ii) 30; 1(iv) & 2(i) 15 each; all others (1(i), (iii), (v), 2(ii)) 10 each.
• HW4: LEDA DFS Program Due Mon Mar 3. The given code is in the csel, not this website. Please bring this code to class, as we'll review the LEDA constructs in this code (probably on Wed Feb 20).
  • Timing requirement: The last test of carving in test 4 should be at most 1.0 time units. My code ran in 0.7, and I didn't do anything unusual in the code. (Note: A complete run takes 7-10 seconds of wall time if you include test 4, so it's best to comment it out at the start.)
  • Info on the CSEL, including how to activate your account.
  • To download a free edition of LEDA
  • More info on LEDA.
  • Some more LEDA statements that may help in debugging.

• Optional reading for DFS unit: "Path-based depth-first search for strong and biconnected components," H.N. Gabow, Information Processing Letters 74, 2000, pp.107-114, gzipped postscript. "Searching", H.N. Gabow, book chapter in Handbook of Graph Theory, J.L. Gross and J. Yellen eds., pp.953-984, 2003, gzipped PDF
• HW3: Digraphs Due Mon Feb 18. Point Values: 1:40. 2 &3: 30. 2(i),(ii),3(i),(ii): 15.
• HW2: Dags. Due Wed Feb 6. New due date: Mon Feb 11 Point Values: Each of 1 and 2 is worth 50 points. If you prefer that hw's be posted in PDF in addition to .ps, let me know.
• HW1: Adjacency Representation. Due Monday Jan 28. New duedate, Wed. Jan. 30 Point Values: 70 points total [since it's the first assignment, it is worth less than the usual 100 points]. (i) is worth 30, (ii) is worth 40. Since this is the first assignment, you may work in a group. This will give you an opportunity to share ideas and meet fellow students. A group can hand in 1 writeup if it wishes.
• In Homework #0 given below, please add to the reading the handout we glossed over today, Handout#40: A Cheat Sheet of Proofs, for Graphs. This gives you a quick recap of the most-often used techniques in this class.
• Extra Credit Problem #1, BGP/Experimental Asymptotic Analysis. Due in class, Wednesday Jan. 23. [Note: As indicated in the problem writeup, your answer g(n) shouldn't have any lower order terms.]
• Mailing List: If you haven't gotten an email from me, I need to add you to the class mailing list, so please send me an email on this.
• Homework#0: Read CLRS Ch. 1 and Handout#0 of my notes. You're responsible for all of this.
• Please bring my notes to all classes.
• Textbooks: The 2 texts are Introduction to Algorithms, 2nd Edition by Cormen et al, and my class notes. Both books are available for purchase at the CU Bookstore.

  Q: Can I use a copy of your bound notes from a previous semester?
  A: No, I revise the notes every time I teach the course, and they always get better!
  
  Q: Can I use Edition 1 of CLRS?
  A: No, Edition 2 is very different (in fact Edition 1 is CLR only).