CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: - Programming complexity - Document - PDFSEARCH.IO

First Page	Meta Content
	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Document Date: 2014-12-28 08:54:06 Open Document File Size: 64,03 KB Share Result on Facebook City Net / / IndustryTerm correct slower algorithm / depth-first search sweep line adversary argument evasive graph property / algorithm binary search convex hull shortest path string / correct faster algorithm / polynomial-time algorithm / induction amortization depth-first search sweep line adversary argument / dynamic programming algorithm / / Technology correct slower algorithm / correct faster algorithm / dynamic programming algorithm / time algorithm / polynomial-time algorithm / / SocialTag Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science

CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID:Add to Reading List