Objective: Identify functional dependencies in two relations and express them using arrow notation.
A dependency X -> Y means that any two valid rows agreeing on X must also agree on Y. It is a rule for every permitted state of the data, not a pattern proved by a few example rows. List the useful nontrivial dependencies implied by the rules below; you do not need to list every dependency derived by augmentation.
Book(BookID, Title, Publisher, Year, ISBN)
Computer(CompID, CPU, Memory, Storage, Monitor)
Book: Each row represents one cataloged edition and format, not an individual physical copy. Every row has a unique BookID and a unique, non-null ISBN. Each has one title, publisher, and publication year. Different editions may share a title. Assume no further uniqueness constraints.
Computer: Each row represents one device's current configuration. CompID is the only candidate key. CPU is its processor model, Memory and Storage are recorded total capacities, and Monitor is its one designated monitor model (or the single value 'None'). Different computers may have identical specifications. Hardware history and multiple monitor assignments are outside this simplified inventory.
This exercise is worth 10 points: 5 points for each relation. Compare your response with the detailed rubric on the result page.
Type or paste your answer, then select Submit to compare it with the model answer. This is self-assessment; submitting does not automatically grade your work.