1,094 views
0 0 votes
Consider relation R(A,B,C,D) with FD A->B C->D is decomposed in to R1(AB) and R2(CD)

then above decomposition is '

A) lossless but not dependency preserving

B) Dependence preserving and lossless

C) Dependency preserving but not lossless

D) Neither Dependency preserving nor lossless

1 Answer

Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
898
898 views
Tesla! asked Apr 21, 2018
898 views
Which of there is free from deadlock and starvation both?1) Both 2PL and time stamp ordering2) Only time stamp 3) only 2PL4) None
3 3 votes
0 0 answers
925
925 views
Tesla! asked Apr 22, 2018
925 views
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
2 2 votes
0 0 answers
1.2k
1.2k views
Tesla! asked Apr 22, 2018
1,171 views
For which one of the following reasons does internet protocol(IP) use the time-to-live(TTL) field in IP datagram header?Ensure packets reach destination within that timeD...
2 2 votes
0 0 answers
956
956 views
Tesla! asked Apr 22, 2018
956 views
A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections. However, it will only allow extern...