• :00Days
  • :00Hours
  • :00Mins
  • 00Seconds
A new era for learning is coming soonSign up for free
Log In Start studying!

Select your language

Suggested languages for you:
Deutsch (DE)
Deutsch (UK)
Deutsch (US)

Americas

Europe

Answers without the blur. Sign up and see all textbooks for free! → Illustration

Q4E

Expert-verified
Discrete Mathematics and its Applications
Found in: Page 589
Discrete Mathematics and its Applications

Discrete Mathematics and its Applications

Book edition 7th
Author(s) Kenneth H. Rosen
Pages 808 pages
ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Register for Free I’ll do it later
Illustration

Short Answer

Assuming that no new \(n\)-tuples are added, find all the primary keys for the relations displayed in

a) Table 3

b) Table 5

c) Table 6

d) Table 8

(a) The resultant answer is Course.

(b) The resultant answer is Course number.

(c) The resultant answer is Course number.

(d) The resultant answer is Departure time.

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :
TABLE OF CONTENTS

Step 1: Given data

Table 3,5,6,8 is given.

Step 2: Concept of sets

The concept of set is a very basic one. It is simple; yet, it suffices as the basis on which all abstract notions in mathematics can be built. \(A\) set is determined by its elements. If \(A\) is a set, write \(x \in A\) to say that \(x\) is an element of \(A\).

Step 3: Simplify the expression

(a)

A primary key is a domain that has a unique value for each \(n\)-tuple. In table 3, we note that student is not a primary key, because Glauser, Marcus and Miller are mentioned more than once in the table. In table 3, we note that major is not a primary key, because Biology, Mathematics and Computer Science are mentioned more than once in the table.

In table 3, we note that course is a primary key, because the course in each row of the table is different.

Step 4: Simplify the expression

(b)

In table 5, we note that professor is not a primary key, because Cruz, Farber, grammer and Rosen are mentioned more than once in the table.

In table 5, we note that Department is not a primary key, because Zoology, Psychology and Physics are mentioned more than once in the table. In table 5, we note that Course number is a primary key, because the course number in each row of the table is different.

Step 5: Simplify the expression

(c)

In table 6, we note that Department is not a primary key, because Mathematics, Psychology and Zoology are mentioned more than once in the table.

In table 6, we note that Course number is a primary key, because the course number in each row of the table is different.

In table 6, we note that Room is not a primary key, because N52l and Al00 are mentioned more than once in the table.

In table 6, we note that Time is not a primary key, because 3:00 P.M. and 4:00 P.M. are mentioned more than once in the table.

Step 6: Simplify the expression

(d)

In table 8, we note that Airline is not a primary key, because Nadir and Acme are mentioned more than once in the table.

In table 8, we note that Flight number is not a primary key, because 122 is mentioned more than once in the table. In table 8, we note that Gate is not a primary key, because 34 and 22 are mentioned more than once in the table.

In table 8, we note that Destination is not a primary key, because Detroit and Denver are mentioned more than once in the table. In table 8, we note that Departure time is a primary key, because the departure time in each row of the table is different.

Most popular questions for Math Textbooks

To determine an example of an irreflexive relation on the set of all people.

Show that if \(C\) is a condition that elements of the \(n\)-ary relation \(R\)and \(S\)may satisfy, then \({s_C}(R - S) = {s_C}(R) - {s_C}(S)\).

How can the directed graph representing the reflexive closure of a relation on a finite set be constructed from the directed graph of the relation?

In Exercises 25–27 list all ordered pairs in the partial ordering with the accompanying Hasse diagram.

25.

Show that the relation \(R\) on a set \(A\) is antisymmetric if and only if \(R \cap {R^{ - 1}}\) is a subset of the diagonal relation \(\Delta = \{ (a,a)\mid a \in A\} \).
Icon

Want to see more solutions like these?

Sign up for free to discover our expert answers
Get Started - It’s free

Recommended explanations on Math Textbooks

Decision Maths

Read explanation

Calculus

Read explanation

Probability and Statistics

Read explanation

Statistics

Read explanation

Mechanics Maths

Read explanation

Geometry

Read explanation

Pure Maths

Read explanation

94% of StudySmarter users get better grades.

Sign up for free
94% of StudySmarter users get better grades.