(Are you looking at a stale web page? Try refreshing your
browser.)
(
Latest Revision --
April 09, 2006
)
(
04/09/06: inserted HW #3
)
(
03/13/06: inserted HW #2
)
(
02/05/06: document start
)
Homework Problems for CS 4440
Ordinarily, homework counts for 40% of your grade - so doing the homework
properly will make a big difference.
Directions for homework submissions
You'll get good grades on the homework if you show mastery of the
material. Give thoughtful and complete answers. Explain
your answers so as to demonstrate and prove to a skeptical reader that they
are correct.
Put things into your own words. Do not copy, quote, or closely
paraphrase the textbook or other people's writings.
Write so as to be understandable to a certain intended readership -- an
intelligent person who has completed the prerequisites for CS 4440 but who has
not yet taken CS 4440.
If I don't feel that what you write is understandable to that audience then
you will lose substantial credit.
You will need to keep an extra copy of everything you turn in. Homework will
typically be due on the class day just prior to a test day. I will discuss
answers to the homework immediately after collecting it. Often you will not
receive graded homework back until sometime after you take the test.
Form and Format
- Everything except source code (including "psuedo-code"): Turn in a
hard copy. Put it on the 'counter' in front of me before the beginning
of class on the due date. Double space. Make margins of between
1" and 1-1/4" on sides, top and bottom. Use a font size from 10 to 14.
(I prefer a fixed-width font.)
- Source code: Turn in neat, compilable code. No more than 70
characters per line. Turn in one hard copy and one e-mail copy. Put
the hard copy on the 'counter' in front of me before class starts. Send
the e-mail before midnight on the due date. No attachments,
please. Just put the text in-line into the message.
Send e-mail to: john@ishi.csustan.edu
Homework Assignment #1
Chapter #01 -- Representative Problems
- Pages 22-23; problems 1-3.
Chapter #04 -- Greedy Algorithms
Homework Assignment #2
Chapter #05 -- Divide and Conquer
Chapter #06 -- "Dynamic Programming"
- Pages 312-314; problems 1-2
Homework Assignment #3
(A few more problems may be added to this set.)
Chapter #07 -- "Network Flow"
- Pages 415-417; problems 1, 2, 4, 5, 6.
Chapter #08 -- "NP and Computational Intractability"
Homework Assignment #4
Chapter #08 -- "NP and Computational Intractability"
- Pages 507-508; problem 8. Hint: think about the relation of Using up
all the Refrigerator Magnets to 3D Matching.
Homework Assignment #5
Chapter #xx -- "Chapter Title"