Question 6144 – Operating-Systems
May 16, 2024
Question 5318 – UGC NET CS 2013 Dec-paper-2
May 16, 2024
Question 6144 – Operating-Systems
May 16, 2024
Question 5318 – UGC NET CS 2013 Dec-paper-2
May 16, 2024

ER-Model

Question 9

What is the optimized version of the relation algebra expression πA1A2F1F2(r)))), where A1, A2 are sets of attributes in  with A1 ⊂ A2 and F1, F2 are Boolean expressions based on the attributes in r?

A
πA1(F1∧F2) (r))
B
πA1(F1∨F2) (r))
C
πA2(F1∧F2) (r))
D
πA2(F1∨F2) (r))
Question 9 Explanation: 
 Since A1 ⊂ A2 will get only attribute A1 as it is in the outside. So we can remove project A2.
 Two Selects with Boolean expression can be combined into one select with AND of two Boolean expressions.
Correct Answer: A
Question 9 Explanation: 
 Since A1 ⊂ A2 will get only attribute A1 as it is in the outside. So we can remove project A2.
 Two Selects with Boolean expression can be combined into one select with AND of two Boolean expressions.

Leave a Reply

Your email address will not be published. Required fields are marked *