Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold: The relation schema R is

Let R(A,B,C,D,E,P,G) be a relational schema in which the following FD

1.	Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold: The relation schema R is
A.	in BCNF
B.	in 3NF, but not in BCNF
C.	in 2NF, but not in 3NF
D.	not in 2NFView Answer
Answer» E.

Discussion

No Comment Found

Related MCQs

What data structure in a complier is used for managing information about variables and their attributes?
Which of the following statements are TRUE?I There exist parsing algorithms for some programming languages hose complex are less than θ(n 3)II A programming language which allows recursion can be implemented with static storage allocationIII No L-attributed definition can be evaluated in the framework of bottom-up parsingIV Code improving transformations can be performed at both source language and intermediate code level
An LALR(1) parser for a grammar can have shift-reduce (S-R) conflicts if and only if ___________
Which of the following are true?(i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation(ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function(iii) Recursion in programming languages cannot be implemented with dynamic storage allocation(iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records(v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
Some code optimizations are carried out on the intermediate code because _______________
Which of the following describes a handle (as applicable to LR-parsing) appropriately?
How many derivation trees are there?
Which of the following strings is generated by the grammar?
In a simplified computer the instructions are: Assume that all operands are initially in memory. The final value of the computation should be in memory. What is the minimum number of MOV instructions in the code generated for this basic block?
Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has LR(1) grammarWhich of the following is TRUE?

Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold: The relation schema R is

Discussion

No Comment Found

Related MCQs

Reply to Comment