If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+…. +Dn (B) D1x D2x… xDn (C) D1U D2U….UDn (D) D1- D2-….-Dn

If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+…. +Dn (B) D1x D2x… xDn (C) D1U D2U….UDn (D) D1- D2-….-Dn
by

1 Answer

Answer :

(B) D1x D2x… xDn
by

Related questions

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: Image I: {B} II: {B, C} III: {A, D} IV: {C, D} If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Description : Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: I: {B} II: {B, C} III: {A, D} IV: {C, D} If ... the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Last Answer : (C) II only

What will be the output? d1 = {"john":40, "peter":45} d2 = {"john":466, "peter":45} d1 > d2 a) True b) False c) Error d) None

Description : What will be the output? d1 = {"john":40, "peter":45} d2 = {"john":466, "peter":45} d1 > d2 a) True b) False c) Error d) None

Last Answer : c) Error

What will be the output? d1 = {"john":40, "peter":45} Page No 40 d2 = {"john":466, "peter":45} d1 == d2 a) True b) False c) None d) Error

Description : What will be the output? d1 = {"john":40, "peter":45} Page No 40 d2 = {"john":466, "peter":45} d1 == d2 a) True b) False c) None d) Error

Last Answer : b) False

Which of the following statements is TRUE? D1: The decomposition of the schema R(A,B,C) into R1(A,B) and R2(A,C) is always lossless. D2: The decomposition of the schema R(A,B,C,D,E) having AD→B, C→DE, B→AE, AE→C into R1(A,B,D) and R2(A,C,D,E) is lossless. (A) Both D1 and D2 (B) Neither D1 and D2 (C) Only D1 (D) Only D2

Description : Which of the following statements is TRUE? D1: The decomposition of the schema R(A,B,C) into R1(A,B) and R2(A,C) is always lossless. D2: The decomposition of the schema R(A,B,C,D,E) having AD→B, C→DE, B→AE, AE→C ... ,D,E) is lossless. (A) Both D1 and D2 (B) Neither D1 and D2 (C) Only D1 (D) Only D2

Last Answer : (D) Only D2

In a relational schema, each tuple is divided into fields called A) Relations B) Domains C) Queries D) All of the above

Description : In a relational schema, each tuple is divided into fields called A) Relations B) Domains C) Queries D) All of the above

Last Answer : B) Domains

In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple.

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : C) i-False, ii-True

A particle experiences constant acceleration for 20 seconds after starting from rest. If it travels a distance D1 in the first 10 seconds and distance D2 in the next 10 seconds then, (a) D2 = D1 (b) D2 = 2D1 (c) D2 = 3D1 (d) D2 = 4D1 -Science

Description : A particle experiences constant acceleration for 20 seconds after starting from rest. If it travels a distance D1 in the first 10 seconds and distance D2 in the next 10 seconds then, (a) D2 = D1 (b) D2 = 2D1 (c) D2 = 3D1 (d) D2 = 4D1 -Science

Last Answer : (c) is the answer

In a rhombus if d1 = 16 cm, d2 = 12 cm, then the length of the side of the rhombus is (a) 8 cm (b) 9 cm (c) 10 cm (d) 12 cm

Description : In a rhombus if d1 = 16 cm, d2 = 12 cm, then the length of the side of the rhombus is (a) 8 cm (b) 9 cm (c) 10 cm (d) 12 cm

Last Answer : (c) 10 cm

For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Description : For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Last Answer : (A) In 1NF not in 2NF 

For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are: A→C B→D The relation R is in ................ (1) First normal form but not in second normal form (2) Both in first normal form as well as in second normal form (3) Second normal form but not in third normal form (4) Both in second normal form as well as in third normal form

Description : For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are: A→C B→D The ... form but not in third normal form (4) Both in second normal form as well as in third normal form

Last Answer : First normal form but not in second normal form

A relational database developer refers to a record as (A) a criteria. (B) a relation. (C) a tuple. (D) an attribute.

Description : A relational database developer refers to a record as (A) a criteria. (B) a relation. (C) a tuple. (D) an attribute.

Last Answer : C) a tuple

A compound pipe of diameter d1, d2 and d3 having lengths l1, l2 and l3 is to be replaced by an equivalent pipe of uniform diameter d and of the same length (l) as that of the compound pipe. The size of the equivalent pipe is given by (A) l/d² = + + (B) l/d³ = + ) + (C) = + + (D)

Description : A compound pipe of diameter d1, d2 and d3 having lengths l1, l2 and l3 is to be replaced by an equivalent pipe of uniform diameter d and of the same length (l) as that of the compound pipe. The size of the equivalent pipe is given by (A) l/d² = + + (B) l/d³ = + ) + (C) = + + (D)

Last Answer : Answer: Option D

18.The total extension of a taper rod of length ‘L’ and end diameters ‘D1’ and ‘D2’, subjected to a load (P), is given of a. 4PL/ΠE. D1D2 b. 3PL/ΠE. D1D2 c. 2PL/ΠE. D1D2 d. PL/ΠE.D1D2 Where E=Young’s modulus of elasticity

Description : 18.The total extension of a taper rod of length ‘L’ and end diameters ‘D1’ and ‘D2’, subjected to a load (P), is given of a. 4PL/ΠE. D1D2 b. 3PL/ΠE. D1D2 c. 2PL/ΠE. D1D2 d. PL/ΠE.D1D2 Where E=Young’s modulus of elasticity

Last Answer : a. 4PL/ΠE. D1D2

In the treatment of parkinsonism, bromocriptine differs from levodopa in the following respects except: A. It does not need conversion to an active metabolite B. It has a longer duration of action C. It activates dopamine D2 receptors, with little/antagonistic action on D1 receptors D. It does not produce behavioral/psychiatric side effect

Description : In the treatment of parkinsonism, bromocriptine differs from levodopa in the following respects except: A. It does not need conversion to an active metabolite B. It has a longer duration of ... with little/antagonistic action on D1 receptors D. It does not produce behavioral/psychiatric side effect

Last Answer : D. It does not produce behavioral/psychiatric side effects

6.12 The most prominent action of bromocriptine is: A. Dopamine D2 agonism B. Dopamine D2 antagonism C. Dopamine D1 antagonism D. α adrenergic antagonism

Description : 6.12 The most prominent action of bromocriptine is: A. Dopamine D2 agonism B. Dopamine D2 antagonism C. Dopamine D1 antagonism D. α adrenergic antagonism

Last Answer : A. Dopamine D2 agonism

Dopaminergic D1 and D2 as well as adrenergic α and β1, but not β2 receptors are activated by: A. Dopamine B. Dobutamine C. Methoxamine D. Phenylephrine

Description : Dopaminergic D1 and D2 as well as adrenergic α and β1, but not β2 receptors are activated by: A. Dopamine B. Dobutamine C. Methoxamine D. Phenylephrine

Last Answer : A. Dopamine

Dopaminergic D1 and D2 as well as adrenergic α and β 1, but not β 2 receptors are activated by: A. Dopamine B. Dobutamine C. Methoxamine D. Phenylephrine

Description : Dopaminergic D1 and D2 as well as adrenergic α and β 1, but not β 2 receptors are activated by: A. Dopamine B. Dobutamine C. Methoxamine D. Phenylephrine

Last Answer : A. Dopamine

What will be the output of the following Python code snippet? d1 = {"john":40, "peter":45} d2 = {"john":466, "peter":45} d1 > d2 a) True b) False c) Error d) None

Description : What will be the output of the following Python code snippet? d1 = {"john":40, "peter":45} d2 = {"john":466, "peter":45} d1 > d2 a) True b) False c) Error d) None

Last Answer : Answer: c Explanation: Arithmetic > operator cannot be used with dictionaries.

What will be the output of the following Python code snippet? d1 = {"john":40, "peter":45} d2 = {"john":466, "peter":45} d1 == d2 a) True b) False c) None d) Error

Description : What will be the output of the following Python code snippet? d1 = {"john":40, "peter":45} d2 = {"john":466, "peter":45} d1 == d2 a) True b) False c) None d) Error

Last Answer : Answer: b Explanation: If d2 was initialized as d2 = d1 the answer would be true.

Assume that D1 and D2 in figure are ideal diodes. The value of current I is

Description : Assume that D1 and D2 in figure are ideal diodes. The value of current I is A)0mA B) 0.25mA C) 0.5 mA D)1.0mA 

Last Answer : Assume that D1 and D2 in figure are ideal diodes. The value of current I is 0mA

The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys

Description : The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys

Last Answer : C) Relations

In a relational model, relations are termed as (A) Tuples. (B) Attributes (C) Tables. (D) Rows.

Description : In a relational model, relations are termed as (A) Tuples. (B) Attributes (C) Tables. (D) Rows.

Last Answer : (C) Tables

Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any attributes of their own. How many minimum number of tables are required to represent this situation in the Relational Model? (A) 4 (B) 3 (C) 2 (D) 1

Description : Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any ... are required to represent this situation in the Relational Model? (A) 4 (B) 3 (C) 2 (D) 1

Last Answer : (B) 3 

Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to represent M, N, R1 and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Description : Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to ... and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Last Answer : Answer: 4

The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table

Description : The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table

Last Answer : (C) Same number of rows as the original table

Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are equivalent. (A) I and II are correct. (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Last Answer : (D) Only I is correct.

Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to the column B in table R. One can determine that: (A) I, III and IV are the same query. (B) II, III and IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Description : Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to ... IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Last Answer : (D) I, III and III are the same query.

A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty

Description : The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty

Last Answer : D) The right subtree can be empty

Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y

Description : Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y

Last Answer : A) Subset of X

A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Description : A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Last Answer : (D) maximal, minimal 

The Sieder-Tate correlation for heat transfer in turbulent flow in pipe gives Nu α Re 0.8 , where, Nu is the Nusselt number and Re is the Reynolds number for the flow. Assuming that this relation is valid, the heat transfer co-efficient varies with the pipe diameter (D) as (A) D-1.8 (B) D-0.2 (C) D0.2 (D) D1.8

Description : The Sieder-Tate correlation for heat transfer in turbulent flow in pipe gives Nu α Re 0.8 , where, Nu is the Nusselt number and Re is the Reynolds number for the flow. Assuming that this relation is valid, the heat transfer co-efficient ... pipe diameter (D) as (A) D-1.8 (B) D-0.2 (C) D0.2 (D) D1.8

Last Answer : (B) D-0.2

When does the growth rate of a population following the logistic model equal zero ? The logistic model is given as dN/dt = rN(1-N/K):

Description : When does the growth rate of a population following the logistic model equal zero ? The logistic model is given as dN/dt = rN(1-N/K):

Last Answer : When does the growth rate of a population following the logistic model equal zero ? The logistic ... when death rate is greater than birth rate.

When does the growth rate of a population following the logistic model equal zero? The logistic model is given as dN/dt = rN(1–N/K) (a) when N/K equals zero (b) when death rate is greater than birth rate (c) when N/K is exactly one (d) when N nears the carrying capacity of the habitat.

Description : When does the growth rate of a population following the logistic model equal zero? The logistic model is given as dN/dt = rN(1–N/K) (a) when N/K equals zero (b) when death rate is greater than birth rate (c) when N/K is exactly one (d) when N nears the carrying capacity of the habitat.

Last Answer : (a) when N/K equals zero

Consider the following two commands C1 and C2 on the relation R from an SQL database: C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 retains relation R, but deletes all tuples in R. III. C1 deletes not only all tuples of R, but also the schema for R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Description : Consider the following two commands C1 and C2 on the relation R from an SQL database:  C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 ... R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Last Answer : (C) II and III only

Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project

Description : Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project

Last Answer : D) Project

Which of the following is not a logical database structure? A) Chain B) Network C) Tree D) Relational

Description : Which of the following is not a logical database structure? A) Chain B) Network C) Tree D) Relational

Last Answer : A) Chain

A top-to-bottom relationship among the items in a database is established by a A) Hierarchical schema B) Network schema C) Relational Schema D) All of the above

Description : A top-to-bottom relationship among the items in a database is established by a A) Hierarchical schema B) Network schema C) Relational Schema D) All of the above

Last Answer : A) Hierarchical schema

Cartesian product in relational algebra is (A) a Unary operator. (B) a Binary operator. (C) a Ternary operator. (D) not defined.

Description : Cartesian product in relational algebra is (A) a Unary operator. (B) a Binary operator. (C) a Ternary operator. (D) not defined.

Last Answer : (B) a Binary operator.

In the relational modes, cardinality is termed as: (A) Number of tuples. (B) Number of attributes. (C) Number of tables. (D) Number of constraints

Description : In the relational modes, cardinality is termed as: (A) Number of tuples. (B) Number of attributes. (C) Number of tables. (D) Number of constraints

Last Answer : (A) Number of tuples

Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential

Description : Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential 

Last Answer : (D) Sequential

Consider the following schemas: Branch = (Branch-name, Assets, Branch-city) Customer = (Customer-name, Bank-name, Customer-city) Borrow = (Branch-name, loan-number, customer account-number) Deposit = (Branch-name, Account-number, Customer-name, Balance) Using relational Algebra, the query that finds customers who have balance more than 10,000 is ................. (A) πcustomer-name(σbalance> 10000(Deposit)) (B) σcustomer-name(σbalance> 10000(Deposit)) (C) πcustomer-name(σbalance> 10000(Borrow)) (D) σcustomer-name(σbalance> 10000(Borrow))

Description : Consider the following schemas: Branch = (Branch-name, Assets, Branch-city) Customer = (Customer-name, Bank-name, Customer-city) Borrow = (Branch-name, loan-number, customer account-number) Deposit = ... )) (C) πcustomer-name(σbalance> 10000(Borrow)) (D) σcustomer-name(σbalance> 10000(Borrow))

Last Answer : (A) πcustomer-name(σbalance> 10000(Deposit)) 

Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B) Object-oriented databases store computational instructions in the same place as the data. (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases. (D) Object-oriented databases store more types of data than relational databases and access that data faster.

Description : Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B ... Object-oriented databases store more types of data than relational databases and access that data faster.

Last Answer : (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases.

Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) eliminating number of anomalies that could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced.

Description : Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) ... could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced. 

Last Answer : reducing the number of joins required to satisfy a query.

Let R and S be two fuzzy relations defined as: Image Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

Can one export a subset of a table? (for DBA

Description : Can one export a subset of a table? (for DBA

Last Answer : From Oracle8i one can use the QUERY= export parameter to selectively unload a subset of the data from a table. Look at this example: exp scott/tiger tables=emp query=\"where deptno=10\"

If `aN = {ax|x in N}` and `bN nn cN = dN`, where `b,c epsilon N`, then

Description : If `aN = {ax|x in N}` and `bN nn cN = dN`, where `b,c epsilon N`, then

Last Answer : If `aN = {ax|x in N}` and `bN nn cN = dN`, where `b,c epsilon N`, then