This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 373 Homework 4 (due 4/1/99) Spring 1999 CS 373: Combinatorial Algorithms, Spring 1999 http://www-courses.cs.uiuc.edu/~cs373 Homework 4 (due Thu. Apr. 1, 1999 by noon) Name: Net ID: Alias: Everyone must do the problems marked ◮ . Problems marked a3 are for 1-unit grad students and others who want extra credit. (There’s no such thing as “partial extra credit”!) Unmarked problems are extra practice problems for your benefit, which will not be graded. Think of them as potential exam questions. Hard problems are marked with a star; the bigger the star, the harder the problem. Note: When a question asks you to “give/describe/present an algorithm”, you need to do four things to receive full credit: 1. (New!) If not already done, model the problem appropriately. Often the problem is stated in real world terms; give a more rigorous description of the problem. This will help you figure out what is assumed (what you know and what is arbitrary, what operations are and are not allowed), and find the tools needed to solve the problem. 2. Design the most efficient algorithm possible. Significant partial credit will be given for less efficient algorithms, as long as they are still correct, well-presented, and correctly analyzed. 3. Describe your algorithm succinctly, using structured English/pseudocode. We don’t want full- fledged compilable source code, but plain English exposition is usually not enough. Follow the examples given in the textbooks, lectures, homeworks, and handouts....
View Full Document
- Spring '09
- Line segment, Divide and conquer algorithm, Convex hull, Thu, Convex hull algorithms