This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Page 4 of 6 Required:
1. Prepare (draw) the relational database design that will replace this spreadsheet in FIRST
NORMAL FORM, making sure that you,
a. Identify the primary key. [5%]
b. Identify any partial dependencies. [5%]
c. Identify any transitive dependencies. [5%]
d. Redraw your design in THIRD NORMAL FORM (you need not worry about
Important Note: You are not to enhance or change the data structure in any way. Question 3. Concurrency Control (10 marks)
Consider the following transactions schedule.
T1 T2 T3 read (D) T4
write (E) read (E)
write (D) read (A)
read (B) read (C)
write (E) write (B)
write (B) (3a) Is the above schedule serializable ? Draw a Precedence Graph to show why serializable or
why not (with one sentence explanation). A simple YES or NO will NOT do. . [5 %] COMM 437 Mid-Term Exam (Fall 2006 Term 1) Page 5 of 6 (3b) Use Topological Sorting to show the order of transactions. [5 %] COMM 437 Mid-Term Exam (Fall 2006 Term 1) Page 6 of 6...
View Full Document
- Spring '14