Suppose you have given relation R(A, B, C, D, E) with{R \(\bowtie\) (R.B = S.B AND (R.C <> S.C OR R.D <> S.D))S= φ} where relation S is the same as R and f is the empty set. Which of the following decompositions of R into a collection of relational schema are in BCNF?
-
Solution
The relational algebra condition is just short for B → CD
∴{A, B, E} is a key and the relation can be decomposed along the above FD to produce {{B, C, D}, {B, A, E}}
The Josephson tunnelling device illustrates principles associated with the advanced storage technique
Let access time of cache is 10–7. Time require for block access is 10–6 and 0.8000 is the hit ratio. What is the average time for the CPU to access a word in two level memory?
-
Solution
Average time to access a word in two level memory
= tA+ (1 – H)tB
= 10–7+ (1– 0.8000) × 10–6
= 3 × 10–7 = 0.3 × 10–6
Working set (t, k) at an instant of time t,is
Consider the graph given below
The number of different MSTs obtained using Prim’s algorithm starting from vertex a are _______.
-
Solution
2
In a single pass assembler, most of the forward references can be avoided by putting the restriction
In which way a macro processor for assembly language can be implemented?
Consider an error free satellite channel used to send 1024 bytes data frames in one direction, with very short ACK coming back the other ways, what is the rate of the channel,if the maximum throughput for window size of 2 is 8 kbps.Assume propagation time is to be 250 ms.
-
Solution
Which of the following regular expressions denotes a language comprising all possible strings of even length over the alphabet (0, 1)?
Which of the following statements is wrong?