If a table satisfies a FD A ? B (where A,B are sets of attributes), then no two rows of the table that have the same values for the attributes in A can have the same values for the attributes in B. (True / False)
Yes, A functional dependency A->B in a relation holds if two tuples having same value of attribute A alsohave same value for attribute B.

False
If a table satisfies a FD A ? B (where A,B are sets of attributes), then...
Given the following Schema S = (R, FD) where R = (A, B, C, D, E, F) and FD contains the following dependencies: A -> BC B ->C C -> D D ->E C -> E E -> F DE -> F C -> F 1. Find a minimal cover of F 2. Find a key for the schema 3. Find a 3N decomposition of the schema that satisfies the lossless join decomposition and dependency preservation properties 4. Find a...
class Bool(Expr): """A boolean constant literal. === Attributes === b: the value of the constant """ b: bool def __init__(self, b: bool) -> None: """Initialize a new boolean constant.""" self.b = b # TODO: implement this method! def evaluate(self) -> Any: """Return the *value* of this expression. The returned value should the result of how this expression would be evaluated by the Python interpreter. >>> expr = Bool(True) >>> expr.evaluate() True """ return self.b def __str__(self) -> str: """Return a...
Database Questions (Please help if you can) For the same query task, different DBMSs may use different SQL statements. true (b) false Given a table, any column of this table can be used as a key of the table. true (b) false It is allowed to have multiple keys in a table. true (b) false When we create a table in a DBMS, if we do not explicitly specify the database, the table can never be created the DBMS does...
12. The intersection of sets A and B, is denoted as A U B. a) true b) false 13. The following expression 1 - A = AC is a) true b) false 14. The following expression A U Ac is a) true b) false 15. When two sets have no elements in common they are known as disjoint sets. a) true b) false 16. When you have two sets A and B, the union of A and B was written...
Question 16 Data sets can have more than one median a. True b. False Question 17 The median divides the data set, sequentially, by values below and values above the mode a. True b. False Question 18 This measure of central tendency provides the arithmetic average a. mode b. median c. mean d. distribution Question 19 Nominal data can be measured using the mean a. True b. False Question 20 The median represents the 50th percentile of a data set...
I would prefer 34. being answered
33. For the big order database table, list FDs with the column CustNo as the determinant that are not true due to the sample data. For each FD, identify the sample rows that contradict it. Remember that it takes two rows to contradict an FD. The sample data are repeated in Table 7-P4 for your reference Table 7-P4: Sample Data for the Big Order Database Table OrdNo temNo atyOrd PlantNo CustNo CustBa CustDisc ReordPt...
True or false
The WHERE clause of the DELETE command is used to identify the rows to be deleted from the table? If the WHERE clause of the DELETE command is omitted, then all rows in the referenced table will be removed? If a user has a shared block on a table, this will prevent any other user from obtaining a shared or exclusive lock on the same table?
Mark True/False for functional dependencies of the following table R(A, B, C, D, E), where we assume that it is the intent of the designer that exactly this set of rows should list in the table. A B C D E a1 b1 c1 d1 e1 a2 b2 c2 d2 e2 a1 b1 c1 d1 e2 a2 b2 c3 d4 e2 (a) A --> B (b) B --> A (c) C--> A (d) D --> A (e) CD --> B
Find the size of the concept space and sample space with 10 attributes. Assume each attribute can only take TRUE or FALSE values.
Given the following grammar, FIRST and FOLLOW sets and LL Parser table, trace the parse of the string “fd xcor + ycor rt ycor” and draw the parse tree. FIRST(S) = FIRST(B) = FIRST(D) = { fd, rt } FIRST(A) = { fd, rt, ε } FIRST(E) = { xcor, ycor } FIRST(F) = { +, -, ε } FOLLOW(S) = { $ } S --> BA FOLLOW(A) = { $ } A --> BA | ε FOLLOW(B) = {...