[home page]

NAME$\underset{¯}{}$

 
CSE 670: Final Exam
 
Tu, June 3, 5:30–7:18
Open Notes, Open Books
The exam consists of $\underset{¯}{four}$ problems
Answers not appearing in designated spaces WILL NOT be graded

• Problem #1 (10 points) Map the given ER-diagram into relational data schemas. The outcome should not include more than six schemas.
  

• Problem #2 (10 points) Consider the following relation.

  $$
  $$
  $R$		$A$		$B$		$C$		$D$		$E$
  $$
  $$
  $$		$a_1$		$b_1$		$c_1$		$d_1$		$e_1$
  $$		$a_1$		$b_2$		$c_5$		$d_3$		$e_1$
  $$		$a_2$		$b_2$		$c_2$		$d_1$		$e_1$
  $$		$a_3$		$b_1$		$c_3$		$d_2$		$e_1$
  $$		$a_3$		$b_1$		$c_4$		$d_2$		$e_1$

  Which of the following functional dependencies $R$ satisfies?
  1. $\left\{B,D\right\}\to \left\{A\right\}$

  2. $\left\{C\right\}\to \left\{A,B,E\right\}$

  3. $\left\{D\right\}\to \left\{A\right\}$

  4. $\left\{D\right\}\to \left\{E\right\}$

  5. $\left\{E\right\}\to \left\{D\right\}$

• Problem #3 (10 points) Consider the relation $R=\left\{A,B,C,D\right\}$ with the functional dependencies:

  $AB$	$\to$	$CD$
  $A$	$\to$	$D$

  1. Is $R$ in 2NF? Justify your answer.

  2. Is $R$ in 3NF?Justify your answer.

  3. Is the decomposition $R_1=\left\{A,D\right\}$ and $R_2=\left\{A,B,C\right\}$ of $R$ lossless join? Prove your answer.

  4. Provide a minimal cover to the given set of functional dependencies.

• Problem #4 (10 points)
  1. Consider the relations

     $$
     $$
     $X$		$A$		$B$
     $$
     $$
     $$		$1$		$a$
     $$		$2$		$b$
     $$		$3$		$c$

     $$
     $$
     $Y$		$A$		$B$		$C$
     $$
     $$
     $$		$$		$$		$$
     $$		$$		$$		$$
     $$		$$		$$		$$

     $$
     $$
     $Z$		$B$		$C$
     $$
     $$
     $$		$1$		$a$
     $$		$2$		$b$
     $$		$3$		$c$

     and the relation $R=\left\{\right.$y.B $|$ $Y\left(y\right)$ and ($\exists x$) ($\exists z$) ( $X\left(x\right)$ and $Z\left(z\right)$ and ($x.A=y.C$) and ($z.C=y.A$ )) $\left.\right\}$ Show all the potential entries in the relation $Y$ when $R=\left\{b\right\}$.

  2. Provide a Java program with embedded SQL code which performs the following operations.
     1. Reads a table’s name
     2. Prints the value of the first attribute of the odd records in the table, followed by the value of the first attribute of the even records in the table.

     Don’t include the code that establishes the connection with the database. Also, don’t use arrays or recursion or any other mechanism to collect data into memory.