Computer Science 186 - Spring 1994 - Vahdat - Midterm 1

Computer Science 186 - Spring 1994 - Vahdat - Midterm 1 -...

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

View Full Document Right Arrow Icon
<!--CS 186, Midterm, Spring 1994--> CS 186 Spring 1994 Midterm Professor Gunther A. Vahdat Problem #1 (15 Credits) Suppose you are database administrator at a large university that is (still) using a hierarchical database system. You have chosen the following scheme to represent information about its faculty, students, departments, and courses. Problem #2 (15 Credits) Let R denote a relational database scheme and F a set of functional dependencies defined on R . Furthermore, let G denote a minimal cover of F . (a) Prove that any attribute that does not appear in any functional dependency in G belongs to every key of R . (b) Prove that if there is a functional dependency in the minimal cover G in which all attributes of R appear, then R is in third normal form with respect to F . Problem #3 (15 Credits) Give an example for a relational database scheme R and a set F of functional dependencies defined on R , such that (i) R is not in third normal form (3NF) with respect to F , and (ii) there are at least two ways to decompose
Background image of page 1

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

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

This note was uploaded on 05/17/2009 for the course CS 186 taught by Professor Staff during the Spring '08 term at Berkeley.

Page1 / 2

Computer Science 186 - Spring 1994 - Vahdat - Midterm 1 -...

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

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