There are three labeled baskets whose inner contents you cannot see: a basket with just apples, a basket with just oranges, and a basket with oranges and apples. Suppose all of the basket labels are wrong? How you figure out which basket is which by taking only one piece of fruit?

December 12	The formula for grades A histogram of course performance
December 7	Test 3 is available in PDF and in DOC forms. Once you download the test you have three hours to complete it. Afterwards, please bring the test to the CS Office as soon as possible. I am trusting you to be honorable to yourself and to others.
December 6	Solutions to the first four problems from assignment 10 are available .
November 29	Time management is now available as a video cast
November 20	Homework update The Graphic Gems series provides a host of helpful algorithms. There is even an algorithm for determining whether two lines cross. The algorithm consider two lines to cross if they have a common endpoint. If you care to modify the algorithm so that it does not count such a case as being cross over, I would agree with you. I have created an improved TSP.java. It has a method main() that makes use of a TSP GUI to test your code
November 20	Cake cutting Definitions and algorithms Applications and algorithms Sudoku -- my intention is to improve it over the holidays GUI Sudoku solver
November 15	Selected links Tool for using a spreadsheet to act as a genetic algorithm Ant optimization
November 13	The last lecture by Randy Pausch is available through streaming. A printed copy of a one-page single-space paper discussion has been assigned.
November 5	Homework has been assigned. A paper copy is due by Monday November 12 at 3 PM in the CS office. The original simulated annealing paper is available via UVa
October 25	Advice for upcoming class We spent a lot of time on the 0/1 knapsack problem (e.g.,the jump sets using f_i(y) = max {f_i-1(y) , p_i+ f_i-1(y -w_i)}and the tabular representation We spent a lot of time on sequencing problems (e.g., longest common subsequence and the edit distance problems)
October 24	Solutions to recent homeworks are available Select.java EditDistance.java WorkPlan.java
October 17	The Methods.java that did timing is still available. It requires etm.jar and the appropriate modification of the Java class path.
October 16	The EditDistance.java code includes a very simple testing program and a class Solution for recording and validating your answer. The homework section has more information.
October 5	Upload your Select.java Improved Methods.java Improved selection and partition algorithms
October 4	Some methods to help test and debug your code are available in Methods.java The corrected selection and partition algorithms are also available
September 28	Remember there is homework due next Friday.
September 20	Remember there is homework due tomorrow and a test next Thursday. The worksheet from Tuesday is available
September 12	More hints for the current assignment are available
September 11	Hint for the Node Cover problem A tree with nine vertices makes a straightforward example. A tree with five vertices also works, but some of you will not like it as an answer.
September 6	The text book is in stock. Tomorrow we will tackle another scheduling problem -- the total scheduling problem; the knapsack problem, and may be Huffman encoding. The scheduling and encoding problems can be read about in Chapter 4. The knapsack problem is defined in chapter 6 (page 271-272); however, our interest will be to come up with some greedy algorithms and determine whether they work. Teaching assistant Scott Geiser (seg8f) will have office hours Wednesdays from 3:30 to 6:30 in the Computer Science Lounge (Olsson 224). He will also make appointments.
September 4	Want to score some class participation points. Hand in at the start of the Thursday September 6 class a typed 1/2 page - page suggestion on how the Socratic approach could be carried out in CS 432.
September 3	The address of the readings for the Tuesday class can be found here
August 29	Fruit question -- solution due at the start of class Thursday August 30 There are three labeled baskets whose inner contents you cannot see: a basket with just apples, a basket with just oranges, and a basket with oranges and apples. Suppose all of the basket labels are wrong? How you figure out which basket is which by taking only one piece of fruit?
August 29	The text book has been ordered and should be in stock soon.,
August 28	First day of class!!!
August 24, 2007	Please bring an m by n chocolate bar to the first class
August 22, 2007	The textbook has been selected: Algorithm Design Jon Kleinberg and �va Tardos Addison Wesley ISBN: 978-0321295354 2006

	CS 432 - Fall 2007	Jim Cohoon
Home \| Documents \| Homework \| Slides \| People \| Uploads \| Code \| Email Log \| Grades