Notice: Solutions are password protected. The username & password will be announced in class
#
Due Date
Description
Solutions
#1
Thursday 1/23/03
Topic: Entity-Relationship Diagrams
You should solve exercises 2.4, 2.6 and 2.8 from the course Textbook (3rd Edition).
The exercise should be turned IN CLASS (otherwise it is considered late)
#2
Tuesday 2/11/03
Topic: Relational Algebra
Please download the exercise here:
Tuesday 2/18/03
Midterm : Chapters 1-4 (Rel. algebra).
#3
Thursday 2/27/03
Topic: SQL
You should solve exercises 5.2 and 5.4 from the course Textbook (3rd Edition).
The exercise should be turned IN CLASS (otherwise it is considered late)
#4
Thursday, 3/13/03
Topic: Indexing Problem 1: Do exercise 10.4 from the Textbook. Problem 2: A PARTS file with Part# as hash key includes records with the
following Part# values:
2369, 3760, 4692, 4871, 5659, 1821, 1074, 7115, 1620, 2428, 3943, 4750,
6975, 4981,
9208. Load these records into dynamic hash files based on :
(i) linear hashing and
(ii) extendible hashing.
In both cases start with 8 buckets. Use the least significant bits for bucket allocation.
Each bucket is one disk block (page) and holds two records.
For extendible hashing, show the structure of the directory and the global
and local depths at each stage
(i.e., when the directory doubles and/or a bucket splits).
For linear hashing,
show when new buckets are added as well as the hashing function(s) used.
The exercise should be turned IN CLASS (otherwise it is considered late)
Wed. March 19, 3-6pm
Final :
Includes Chapters : 5,8,9,10,11,12,13 and 14
Print 
Top