CS341 What's New?
CS341 | CS
Department | Princeton University
Jan 15: The solution to the final exam is online now. If you have questions about grading, please contact me asap.
-- Xiaohu Qie
Jan 14: Now you can pick up your final tests in the hand-out box. Please respect your fellow students' privacy and do not peek at their scores.
-- Xiaohu Qie
December 18: For those of you who wanna study the homework during the break: the solution to Homework#9 has been posted.
-- Xiaohu Qie
December 16: Two handouts were distributed in class today. If you
didn't get them, you can come by Ms. Barbu's office
(Room 323) to pick them up.
Don't forget that the final exam problem sheets will
be posted on the web on January 5, 1999, by noon.
-- Andrew Yao
December 10: Hi, Jayanth alerted me that there are two
misprints in the newest homework set
(Chapter 9.5). In Exercise 11, the first line should read
"A corporation has 7 availabe postions
y_1, y_2, ..., y_7 and ...". In Exercise 20, in the nxn matrix,
the entry in the bottom-left corner should
be "2, n-1" (instead of "2, n-2"), and
the entry above it should be "3, n-2"
(instead of "3, n-3"). -- Andrew Yao
November 24: As announced in class yesterday, the final exam will
be a take-home open-book exam. The exam problems will be available on
the main web page (just click the "Final Exam" link next to "Handouts" link)
on January 5 before noon. You are allowed to take any consecutive twenty-four
hours to work on it, and turn in your solutions on January 7 before
3pm. Detailed instruction will be given on the exam problems sheet. -- Andrew Yao
November 23: There is a new handout (No. 10) covering the DNA
sequencing algorithm discussed in class today. The figures are
missing in the handout, but I will hand out hard copies of Handout No.
10 containing the figures in class on Wednesday. The next assignment (Homework 7) is now
on-line. -- Andrew Yao
October 29: There is a new handout (No. 6). -- Andrew Yao
October 28: Please pick up graded assignment 4 in the course mailbox
on the 2rd floor. --Xiaohu
October 26: Homework Set Number 5 is now on-line. This assignment is
due on November 18, 1998. Midterm is an open-book exam to be held on November
11 in class, and it covers all material in Chapters 1, 2, 3, and 5. --
Andrew Yao
October 26: There is a new handout (No. 4) containing last year's midterm
exam. I will post its solutions by this Thursday. You may be interested
in trying to solve them yourselves before seeing the solutions. -- Andrew
Yao
October 21: There is no homework assignment this week. Also, the class
newsgroup is now in place. -- Andrew Yao
October 21: There are a few people who didn't pick up their graded
homework set 3; these can be picked up from Ms. Sandy Barbu in room 323.
-- Xiaodong
October 17: The question statement of the Exercise 21 of Homework Set
4 (Chapter 5.7) is ambiguous. It will not be graded. So you don't need
to do Exercise 21. -- Andrew Yao
October 7: There are a few people who didn't pick up their graded homework
set 1; these can be picked up from Ms. Sandy Barbu in room 323. -- Andrew
Yao
October 12: The solution for Assignment 2 has been posted. --
Xiaodong Wen
October 8: For those who use number from 0-3 instead of 1-4 in
Latin square in homeset 1, you may receive more credit. If you want, please
resubmit your graded homework 1 with homework 3. Sorry for the inconvenience.
--Xiaodong Wen
October 7: The solution for Assignment 1 has been posted. --
Xiaohu Qie
September 30: The midterm exam will be held in class on November 11.
The exam will be open-book. -- Andrew Yao
September 30: Casey McTaggart (mctagart@princeton.edu) is starting
a study group for this course. Anyone interested please send a message
to the above e-mail address.-- Andrew Yao
September 28: The time and place of TAs' office hours are now posted
on the homepage of CS341. There's also a new handout (Handout No. 2)--
Andrew Yao
September 24: There seems to be some confusion about the meaning of
"increasing subsequence" in the sequence a_1, a_2, ..., a_n. By "increasing
subsequence," we mean a subsequence a_{j_1} (less than) a_{j_2} (less than)
... (less than) a_{j_t}, where j_1, j_2, ... ,j_t is increasing but not
necessarily "consecutive". Same for "decreasing subsequence".-- Andrew
Yao
September 24: I was told that the bookstore had run out of the textbooks
for this course. I have reordered some, and they should come early next
week. In the mean time, I have made copies of the first two chapters. If
you need them, please ask Ms. Sandy Barbu in Room 323 for them. -- Andrew
Yao
September 24: My office hours: Tuesdays 2:30-4:00pm -- Xiaohu Qie