CS443
March 25 2010
TEST 1
Instructions: Do all your work in the blue exam books. Please write your answers IN THE
GIVEN ORDER, though you may solve problems in any order. There is no need to reduce answers
to simplest terms. You may use ONE PAGE OF PREPA
CS443
Takehome Exam
April 28, 2012
Instructions: Please submit your solutions to my oce by 5 PM Monday, April 30, 2012. You
should treat this as an in class, open book exam: so books and notes are OK, but NO COMPUTERS, NO WEB SEARCH, ETC. You are expected
CS443
March 8, 2012
TEST 1
Instructions: Do all your work in the blue exam books. Please write your answers IN THE
GIVEN ORDER, though you may solve problems in any order. There is no need to reduce answers
to simplest terms. You may use ONE PAGE OF PREPA
CS443
HW4
March 28, 2012
A due date for (*) problems will be set later.
1. We are given the polynomial
Q(x1 , x2 ) = x2 x2 + 25x1 x2 + 24 5x2 x2 30x1 + 4x2 + 6x2 5x1 x2 20x2 ,
12
1
2
1
2
in two variables.
(a) What is d, the degree of Q?
(b) Write Q(x1 , x
CS443
HW3
March 29, 2012
These problems are (mainly) for your own interest and benet in understanding the relevant
topics. However if you want to solve problems marked with (*) and hand in solutions by April 5, I
will give you some extra credit. The same
CS443
HW2
February 10, 2012
Problems marked with (*) should solved and carefully written solutions handed in by Feb. 23,
2012. Two problems are marked with (+). Choose one and solve it. If you do both I will give
extra credit. With programs a short pseudo
CS443
HW1
January 31, 2012
Most of these problems are for your own practice and as a review of basic probability and
counting. Try to work them out for your own benet, or at least convince yourself that you know
how to do them. However problems marked wit
CS-443
Apr. 15, 2012
Geometric Graphs: The Crossing Lemma and Two Applications
These notes borrow from Chap 4 of the wonderful book by J. Matouek on Discrete Geometry
s
(http:/www.ms.m.cuni.cz/acad/kam/matousek).
Let G = (V, E ) be a graph with n labeled