CS 473G
Final Exam Questions (May 5, 2007)
Spring 2007
You have 180 minutes to answer six of these questions.
Write your answers in the separate answer booklet.
1. The d-dimensional hypercube is the graph defined as follows. There are 2d vertices, each la
Algorithms
Lecture 19: Shortest Paths [Sp'10]
Well, ya turn left by the fire station in the village and take the old post road by the reservoir and. . . no, that won't do. Best to continue straight on by the tar road until you reach the schoolhouse and th
Algorithms
Lecture 5: Dynamic Programming [Fa'10]
Those who cannot remember the past are doomed to repeat it. - George Santayana, The Life of Reason, Book I: Introduction and Reason in Common Sense (1905) The 1950s were not good years for mathematical res
Algorithms
Lecture 7: Greedy Algorithms [Fa'10]
The point is, ladies and gentleman, greed is good. Greed works, greed is right. Greed clarifies, cuts through, and captures the essence of the evolutionary spirit. Greed in all its forms, greed for life, mon
CS 373U: Combinatorial Algorithms, Spring 2004 Homework 2
Due Friday, February 20, 2004 at noon
(so you have the whole weekend to study for the midterm)
Name: Net ID: Name: Net ID: Name: Net ID:
Alias: Alias: Alias:
Starting with this homework, we are ch
CS 573
Final Exam Questions (December 17, 2008)
Fall 2008
You have 180 minutes to answer all seven questions. Write your answers in the separate answer booklet. You can keep everything except your answer booklet when you leave.
1. An integer program is a
CS 373 U
Makeup Final Exam Questions (August 2, 2004)
Spring 2004
Answer four of these seven problems; the lowest three scores will be dropped.
1. Suppose we are given an array A[1 . n] with the special property that A[1] A[2] and A[n - 1] A[n]. We say th
CS473ug
Head Banging Session #3
9/19/06 - 9/21/06
1. Championship Showdown What excitement! The Champaign Spinners and the Urbana Dreamweavers have advanced to meet each other in the World Series of Basketweaving! The World Champions will be decided by a
CS 473U
Final Exam Questions (December 15, 2006)
Fall 2006
1. A double-Hamiltonian circuit in an undirected graph G is a closed walk that visits every vertex in G exactly twice, possibly by traversing some edges more than once. Prove that it is NP-hard to
CS 473G
Final Exam Questions (December 13, 2005)
Fall 2005
You have 180 minutes to answer six of these questions.
Write your answers in the separate answer booklet.
You may take the question sheet with you when you leave.
1. Describe and analyze an algori
CS 373 U
Final Exam Questions (May 11, 2004)
Spring 2004
Write your answers in the separate answer booklet.
1. In the well-known Tower of Hanoi problem, we have three spikes, one of which has a tower of n disks of different sizes, stacked with smaller dis
CS 473G: Combinatorial Algorithms, Fall 2005 Homework 5
Due Thursday, November 17, 2005, at midnight
(because you really don't want homework due over Thanksgiving break)
Name: Net ID: Name: Net ID: Name: Net ID: Name: Net ID:
Alias: Alias: Alias: Alias:
H
Algorithms
Lecture 29: NP-Hard Problems [Fa'10]
The wonderful thing about standards is that there are so many of them to choose from. - Real Admiral Grace Murray Hopper If a problem has no solution, it may not be a problem, but a fact - not to be solved,
Algorithms
Lecture 28: Adversary Arguments [Sp'10]
An adversary means opposition and competition, but not having an adversary means grief and loneliness. - Zhuangzi (Chuang-tsu) c. 300 BC It is possible that the operator could be hit by an asteroid and yo
CS473ug
Head Banging Session #5
10/03/06 - 10/05/06
1. Simulating Queues with Stacks A queue is a rst-in-rst-out data structure. It supports two operations push and pop. Push adds a new item to the back of the queue, while pop removes the rst item from th
CS473ug
Head Banging Session #8
10/24/06 - 10/26/06
1. Alien Abduction Mulder and Scully have computed, for every road in the United States, the exact probability that someone driving on that road wont be abducted by aliens. Agent Mulder needs to drive fr
CS 473G
Homework 3 (due March 9, 2007)
Spring 2007
CS 473G: Graduate Algorithms, Spring 2007 Homework 3
Due Friday, March 9, 2007
Remember to submit separate, individually stapled solutions to each problem. As a general rule, a complete, full-credit solut
CS 373U: Combinatorial Algorithms, Spring 2004 Homework 3
Due Friday, March 12, 2004 at noon
Name: Net ID: Name: Net ID: Name: Net ID:
Alias: Alias: Alias:
For each numbered problem, if you use more than one page, staple all those pages together. Please
CS 473
Homework 2 (due February 10, 2009)
Spring 2009
CS 473: Undergraduate Algorithms, Spring 2009 Homework 2
Written solutions due Tuesday, February 10, 2009 at 11:59:59pm.
Roughly 1/3 of the students will give oral presentations of their solutions to
CS 473G: Graduate Algorithms, Spring 2007 Homework 1
Due February 6, 2007
Remember to submit separate, individually stapled solutions to each of the problems. 1. Jeff tries to make his students happy. At the beginning of class, he passes out a questionnai
CS 473G: Combinatorial Algorithms, Fall 2005 Homework 1
Due Tuesday, September 13, 2005, by midnight (11:59:59pm CDT)
Name: Net ID: Name: Net ID: Name: Net ID:
Alias:
Alias:
Alias:
Starting with Homework 1, homeworks may be done in teams of up to three pe
CS 373U: Combinatorial Algorithms, Spring 2004 Homework 1
Due Monday, February 9, 2004 at noon
Name: Net ID: Name: Net ID: Name: Net ID:
Alias: Alias: Alias:
For this and all following homeworks, groups of up to three people can turn in a single solution
CS 573: Graduate Algorithms, Fall 2008 Homework 0
Due in class at 12:30pm, Wednesday, September 3, 2008
Name: Net ID:
Alias: I understand the course policies.
Each student must submit their own solutions for this homework. For all future homeworks, group
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 st
CS 373U: Combinatorial Algorithms, Spring 2004 Homework 0
Due January 28, 2004 at noon
Name: Net ID:
Alias:
I understand the Homework Instructions and FAQ.
Neatly print your full name, your NetID, and an alias of your choice in the boxes above. Grades wi
Algorithms
Lecture 27: Lower Bounds [Sp'10]
It was a Game called Yes and No, where Scrooge's nephew had to think of something, and the rest must find out what; he only answering to their questions yes or no, as the case was. The brisk fire of questioning
Algorithms
Lecture 26: Linear Programming Algorithms [Fa'10]
Simplicibus itaque verbis gaudet Mathematica Veritas, cum etiam per se simplex sit Veritatis oratio. [And thus Mathematical Truth prefers simple words, because the language of Truth is itself si
Algorithms
Lecture 10: Treaps and Skip Lists [Fa'10]
I thought the following four [rules] would be enough, provided that I made a firm and constant resolution not to fail even once in the observance of them. The first was never to accept anything as true
Algorithms
Lecture 9: Randomized Algorithms [Fa'10]
The first nuts and bolts appeared in the middle 1400's. The bolts were just screws with straight sides and a blunt end. The nuts were hand-made, and very crude. When a match was found between a nut and a