This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 373: Combinatorial Algorithms, Fall 2000 Homework 3 (due October 17, 2000 at midnight) Name: Net ID: Alias: U 3 / 4 1 Name: Net ID: Alias: U 3 / 4 1 Name: Net ID: Alias: U 3 / 4 1 Starting with Homework 1, homeworks may be done in teams of up to three people. Each team turns in just one solution, and every member of a team gets the same grade. Since 1unit graduate students are required to solve problems that are worth extra credit for other students, 1unit grad students may not be on the same team as 3/4unit grad students or undergraduates. Neatly print your name(s), NetID(s), and the alias(es) you used for Homework 0 in the boxes above. Please also tell us whether you are an undergraduate, 3/4unit grad student, or 1unit grad student by circling U, 3 / 4 , or 1, respectively. Staple this sheet to the top of your homework. Required Problems 1. Suppose you have to design a dictionary that holds 2048 items. (a) How many probes are used for an unsuccessful search if the dictionary is implemented as a sorted array? Assume the use of Binary Search. (b) How large a hashtable do you need if your goal is to have 2 as the expected number of probes for an unsuccessful search? (c) How much more space is needed by the hashtable compared to the sorted array? Assume that each pointer in a linked list takes 1 word of storage. 2. In order to facilitate recompiling programs from multiple source files when only a small num ber of files have been updated, there is a UNIX utility called ‘make’ that only recompiles those files that were changed after the most recent compilation, and any intermediate files in the compilation that depend on those that were changed. A Makefile is typically composed of acompilation that depend on those that were changed....
View
Full Document
 Spring '09
 A
 Graph Theory, undirected graph

Click to edit the document details