This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 473G: Graduate Algorithms, Spring 2007 Homework 0 Due in class at 11:00am, Tuesday, January 30, 2007 Name: Net ID: Alias: I understand the Course Policies. • Neatly print your full name, your NetID, and an alias of your choice in the boxes above, and staple this page to your solution to problem 1. We will list homework and exam grades on the course web site by alias. By providing an alias, you agree to let us list your grades; if you do not provide an alias, your grades will not be listed. For privacy reasons, your alias should not resemble your name, your NetID, your university ID number, or (God forbid!) your Social Security number. Please use the same alias for every homework and exam. • Read the Course Policies on the course web site, and then check the box above. Among other things, this page describes what we expect in your homework solutions, as well as policies on grading standards, regrading, extra credit, and plagiarism. In particular: – Submit each numbered problem separately, on its own piece(s) of paper. If you need more than one page for a problem, staple just those pages together, but keep different problems separate. Do not staple your entire homework together. – You may use any source at your disposal—paper, electronic, or human—but you must write your answers in your own words, and you must cite every source that you use. – Algorithms or proofs containing phrases like “and so on” or “repeat this for all n ”, instead of an explicit loop, recursion, or induction, are worth zero points. – Answering “I don’t know” to any homework or exam problem is worth 25% partial credit. If you have any questions, please ask during lecture or office hours, or post your question to the course newsgroup. • This homework tests your familiarity with prerequisite material—bigOh notation, elemen tary algorithms and data structures, recurrences, discrete probability, graphs, and most im portantly, induction—to help you identify gaps in your knowledge. You are responsible for filling those gaps on your own. The early chapters of Kleinberg and Tardos (or any algo rithms textbook) should be sufficient review, but you may also want consult your favorite discrete mathematics and data structures textbooks. • Every homework will have five problems, each worth 10 points. Stars indicate more challeng ing problems. Many homeworks will also include an extracredit problem. CS 473G Homework 0 (due January 30, 2007) Spring 2007 ? 1. Draughts/checkers is a game played on an m × m grid of squares, alternately colored light and dark. (The game is usually played on an 8 × 8 or 10 × 10 board, but the rules easily generalize to any board size.) Each dark square is occupied by at most one game piece (usually called a checker in the U.S.), which is either black or white; light squares are always empty. One player (“White”) moves the white pieces; the other (“Black”) moves the black pieces....
View
Full Document
 Fall '08
 Chekuri,C
 Algorithms, Graph Theory, Computational complexity theory, independent set, Hamiltonian path, Computational problems in graph theory

Click to edit the document details