final - CS 373: Combinatorial Algorithms, Spring 1999 Final...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Alias: This is a closed-book, closed-notes exam! If you brought anything with you besides writing instruments and your two 8 1 2 ′′ × 11 ′′ cheat sheets, please leave it at the front of the classroom. • Print your name, netid, and alias in the boxes above, and print your name at the top of every page. • Answer six of the seven questions on the exam. Each question is worth 10 points. If you answer every question, the one with the lowest score will be ignored. 1-unit graduate students must answer question #7. • Please write your answers on the front of the exam pages. Use the backs of the pages as scratch paper. Let us know if you need more paper. • Read the entire exam before writing anything. Make sure you understand what the questions are asking. If you give a beautiful answer to the wrong question, you’ll get no credit. If any question is unclear, please ask one of us for clarification. • Don’t spend too much time on any single problem. If you get stuck, move on to something else and come back later. • Write something down for every problem. Don’t panic and erase large chunks of work. Even if you think it’s nonsense, it might be worth partial credit. # Score Grader 1 2 3 4 5 6 7 Name: CS 373 Final Exam 1. Short Answer sorting induction Master theorem divide and conquer randomized algorithm amortization brute force hashing binary search depth-first search splay tree Fibonacci heap convex hull sweep line minimum spanning tree shortest paths shortest path adversary argument NP-hard reduction string matching evasive graph property dynamic programming H n Choose from the list above the best method for solving each of the following problems. We doChoose from the list above the best method for solving each of the following problems....
View Full Document

This note was uploaded on 12/15/2009 for the course 942 cs taught by Professor A during the Spring '09 term at University of Illinois at Urbana–Champaign.

Page1 / 8

final - CS 373: Combinatorial Algorithms, Spring 1999 Final...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online