Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2≠Ø. The decomposition is:(A) Not in 2NF(B) In 2NF but not in 3NF(C) In 3NF but not in 2NF(D) In both 2NF and 3NF

Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→

1.	Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2≠Ø. The decomposition is:(A) Not in 2NF(B) In 2NF but not in 3NF(C) In 3NF but not in 2NF(D) In both 2NF and 3NF
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Consider two events E1 and E2 such that probability of E1, Pr[E1]=1/2, probability of E2, Pr[E2]=1/3, and probability of E1 and E2, Pr[E1 and E2]=1/5, Which of the following statement is/are True?(A) Pr[E1 and E2] is 2/3(B) Events E1 and E2 are independent.(C) Events E1 and E2 are not independent.(D) Pr[E1/E2]= 4/5
Which of the following is/are advantages of virtual memory?a) Faster access to memory on an average.b) Processes can be given protected address spaces.c) Linker can assign addresses independent of where the program will be loaded in physical memory.d) Programs larger than the physical memory size can be run.(A) a and b(B) b and c(C) b and d(D) All of the above
Which of the following expressions is not equivalent to X‾ ?(A) x NAND x(B) x NOR x(C) x NAND 1(D) x NOR 1
Which of the following function implements the Karnaugh map shown below?(A) a(B) b(C) c(D) d
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support:a)Address translationb)DMA for disk transferc)At least two modes of CPU execution (privileged and non-privileged).d)Demand Paging(A) Only A(B) Both A, B(C) A, B and C(D) A, B and D
Let LD be the set of all languages accepted by a PDA by final state and LF the set of all languages accepted by empty stack. Which of the following is true?(A) a(B) b(C) c(D) d
Listed below are some operating system abstractions (in the left column) and the hardware components or mechanism (in the right column) that they are abstractions of. Which of the following matching of pairs is correct?A. Thread 1. InterruptB. Virtual address space 2. MemoryC. File system 3. CPUD. Signal 4. Disk(A) A-2, B-4, C-3, D-1(B) A-1, B-2, C-3, D-4(C) A-3, B-2, C-4, D-1(D) A-4, B-1, C-2, D-3
Context free languages are closed under-(A) Union, Intersection(B) Union, Kleene closure(C) Intersection, Complement(D) Complement, Kleene closure
Consider the regular expression (0+1)(0+1)… n times. The minimum state finite automaton that recognizes the language represented by this regular expression contains:(A) n states(B) n+1 states(C) n+2 states(D) None of the above
Which of the following disk strategies is likely to give the best throughput?(A) Farthest cylinder next(B) Nearest cylinder next(C) First come first served(D) Elevator algorithm

Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2≠Ø. The decomposition is:(A) Not in 2NF(B) In 2NF but not in 3NF(C) In 3NF but not in 2NF(D) In both 2NF and 3NF

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment