EtYB7&vT"&$
%@ 6$ B $ 8
a2&) T"Y)51a2E0B7" 754G7Y"1#wf&()b1277tPT8xY651G7Y"777Px754w8E8B7rw(8X274 w
0
8 B 2 ' 8 t S) " D" S $ $ B 2 ' 1" 0 B 2 0@ B 1 $ t
BEY1VW277("754TSxV6E0bBHY"fV(6b1R7("777P754G5BX2Y6512E85)(8xV754321&T)Y'T%7("E1e&7#!
8 P@ 1 B 2 ) 8
COMPSCI 342-001 Data Structures and Algorithms (Fall 2011)
Homework 1 (70 points), Due on 9/07/2011 (Wednesday)
n
1. (10 points) Suppose that a computer does not know how to compute the value C2 directly
2
if n > 2, but the computer can return C2 = 1 in c
1
COMPSCI 342-001 Data Structures and Algorithms (Fall 2011)
Homework #2 (75 points), Due on 9/21/2011 (Wednesday), class time
Q1(10 points): Asymptotic Notations
(a)(6 points) Try to show 1 n2 20n 100 = (n2 ) using the basic denition of nota5
1
tion. Th
COMPSCI 342-001 Data Structure and Algorithms (Fall 2011)
Lab Assignment #1, Due on 9/09/2011, Friday (11PM)
Introduction:
This programming assignment asks you to design a cache implementation using linked list data
structure. That is, write a Cache class
COMPSCI 342-001 Data Structure and Algorithms (Fall 2011)
Lab Assignment #2, Due on 10/17/2011, Monday (11PM)
Introduction:
Suppose we are inserting n keys into a hash table of size m. Then the load factor
is dened to be n/m. For open addressing n m, wh