An instance of a relation is a time varying set of …………………. A) Tuples B) Rows C) Both of them D) None of them

An instance of a relation is a time varying set of ………………….
A) Tuples
B) Rows
C) Both of them
D) None of them
by

1 Answer

Answer :

C) Both of them
by

Related questions

The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ……………….. A) Degree, Cardinality B) Cardinality, Degree C) Rows, Columns

Description : The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ……………….. A) Degree, Cardinality B) Cardinality, Degree C) Rows, Columns

Last Answer : B) Cardinality, Degree

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

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

………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Description : ………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Last Answer : B) Schema

The number of attributes in relation is called as its ..................... A) Cardinality B) Degree C) Tuples D) Entity

Description : The number of attributes in relation is called as its ..................... A) Cardinality B) Degree C) Tuples D) Entity

Last Answer : B) Degree

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity. (C) A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included. (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

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

What type of data is: a=[(1,1),(2,4),(3,9)]? a) Array of tuples b) List of tuples c) Tuples of lists d) Invalid type

Description : What type of data is: a=[(1,1),(2,4),(3,9)]? a) Array of tuples b) List of tuples c) Tuples of lists d) Invalid type

Last Answer : b) List of tuples

What is the output of the following code? >>> a=(2,3,4) >>> sum(a,3) a) Too many arguments for sum() method b) The method sum() doesn’t exist for tuples c) 12 d) 9

Description : What is the output of the following code? >>> a=(2,3,4) >>> sum(a,3) a) Too many arguments for sum() method b) The method sum() doesn’t exist for tuples c) 12 d) 9

Last Answer : c) 12

What is the output of the following piece of code when executed in Python shell? >>> a=("Check")*3 >>> a a) (‘Check’,’Check’,’Check’) b) * Operator not valid for tuples c) (‘CheckCheckCheck’) d) Syntax erro

Description : What is the output of the following piece of code when executed in Python shell? >>> a=("Check")*3 >>> a a) (‘Check’,’Check’,’Check’) b) * Operator not valid for tuples c) (‘CheckCheckCheck’) d) Syntax erro

Last Answer : c) (‘CheckCheckCheck’)

Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ? (A) 5 (B) 10 (C) 15 (D) 50

Description : Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ?  (A) 5 (B) 10 (C) 15 (D) 50

Last Answer : (A) 5 

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.

Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height>180); If the SQL queries (a) and (b) above, return 10 rows and 7 rows in the result set respectively, then what is one possible number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Description : Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height ... number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Last Answer : (C) 10

Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this

Description : Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this

Last Answer : C) this

State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Description : State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Last Answer : B) i-false, ii-true

Process is ........................ A) A program in execution B) An instance of a program running on a computer. C) The entity that can be assigned to and executed D) All of the above.

Description : Process is ........................ A) A program in execution B) An instance of a program running on a computer. C) The entity that can be assigned to and executed D) All of the above.

Last Answer : D) All of the above.

Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Description : Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Last Answer : (B) 38

The relation "divides" on a set of positive integers is .................. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only

Description : The relation "divides" on a set of positive integers is .................. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only

Last Answer : (B) Anti symmetric and transitive Explanation: The ‘divide’ operation is antisymmetric because if a divides b does not necessarily implies that b divides a. If a divides b and b divides c then a divides c. So, it is transitive as well.

Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set. (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Description : Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent ... . (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Last Answer : (B) Data Redundancy

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

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

State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Description : State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

Which can be used to delete all the rows if a table? A) Delete * from table_name B) Delete from table_name C) Delete table_name D) all rows cannot be deleted at a time.

Description : Which can be used to delete all the rows if a table? A) Delete * from table_name B) Delete from table_name C) Delete table_name D) all rows cannot be deleted at a time.

Last Answer : A) Delete * from table_name

The ............ operator preserves unmatched rows of the relations being joined. A) Inner join B) Outer join C) Union D) Union join

Description : The ............ operator preserves unmatched rows of the relations being joined. A) Inner join B) Outer join C) Union D) Union join

Last Answer : B) Outer join

…………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate

Description : …………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate

Last Answer : A) Unique predicate

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

In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1

Description : In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1

Last Answer : (A) rows or columns

Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique? (A) Only the joining attributes are sent from one site to another and then all of the rows are returned. (B) All of the attributes are sent from one site to another and then only the required rows are returned. (C) Only the joining attributes are sent from one site to another and then only the required rows are returned. (D) All of the attributes are sent from one site to another and then only the required rows are returned.

Description : Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique? (A) Only the joining attributes are sent from one site to ... the attributes are sent from one site to another and then only the required rows are returned.

Last Answer : (C) Only the joining attributes are sent from one site to another and then only the required rows are returned.

Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct? (A) T1 < T2 (B) T1 > T2 (C) T1 = T2 (D) Nothing can be said about the relation between T1 and T2.

Description : Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct? (A) T1 < T2 (B) T1 > T2 (C) T1 = T2 (D) Nothing can be said about the relation between T1 and T2.

Last Answer : (A) T1 < T2

The rate of ……………. Is always an important factor for management especially in relation to the rate of return A) Cost B) Benefit C) Sales D) Investment

Description : The rate of ……………. Is always an important factor for management especially in relation to the rate of return A) Cost B) Benefit C) Sales D) Investment

Last Answer : D) Investment

………………….. operator is basically a join followed by a project on the attributes of first relation. A) Join B) Semi-Join C) Full Join D) Inner Join

Description : ………………….. operator is basically a join followed by a project on the attributes of first relation. A) Join B) Semi-Join C) Full Join D) Inner Join

Last Answer : B) Semi-Join

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 .................. normal form normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. A) First B) Second C) Third D) Fourth

Description : A .................. normal form normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. A) First B) Second C) Third D) Fourth

Last Answer : C) Third

The RDBMS terminology for a row is (A) tuple. (B) relation. (C) attribute. (D) degree.

Description : The RDBMS terminology for a row is (A) tuple. (B) relation. (C) attribute. (D) degree.

Last Answer : (A) tuple

_____ produces the relation that has attributes of R1 and R2 (A) Cartesian product (B) Difference (C) Intersection (D) Product

Description : _____ produces the relation that has attributes of R1 and R2 (A) Cartesian product (B) Difference (C) Intersection (D) Product

Last Answer : A) Cartesian product

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 thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

Description : The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

Last Answer : (D) O(logn log logn)

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 

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

Description : 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

Last Answer : (B) D1x D2x… xDn

A Network Schema (A) restricts to one to many relationship (B) permits many to many relationship (C) stores Data in a Database (D) stores Data in a Relation

Description : A Network Schema (A) restricts to one to many relationship (B) permits many to many relationship (C) stores Data in a Database (D) stores Data in a Relation

Last Answer : (B) permits many to many relationship

The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if: (a) R1⋂R2→(R1-R2) (b) R1→R2 (c) R1⋂R2→(R2-R1) (d) R2→R1⋂R2 (A) (a) and (b) happens (B) (a) and (d) happens (C) (a) and (c) happens (D) (b) and (c) happens

Description : The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if: (a) R1⋂R2→(R1-R2) (b) R1→R2 (c) R1⋂R2→(R2-R1) (d) R2→R1⋂R2 (A) (a) and (b) happens (B) (a) and (d) happens (C) (a) and (c) happens (D) (b) and (c) happens

Last Answer : (C) (a) and (c) happens 

The Relation Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because : (A) Non key attribute V_name is dependent on V_no which is part of composite key (B) Non key attribute V_name is dependent on Qty_sup (C) key attribute Qty_sup is dependent on primary_key unit price (D) key attribute V_ord_no is dependent on primary_key unit price

Description : The Relation Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because : (A) Non key attribute V_name is dependent on V_no which is part of composite key (B) ... Qty_sup is dependent on primary_key unit price (D) key attribute V_ord_no is dependent on primary_key unit price

Last Answer : (A) Non key attribute V_name is dependent on V_no which is part of composite key

Select the ‘False’ statement from the following statements about Normal Forms: (A) Lossless preserving decomposition into 3NF is always possible (B) Lossless preserving decomposition into BCNF is always possible (C) Any relation with two attributes is in BCNF (D) BCNF is stronger than 3NF

Description : Select the ‘False’ statement from the following statements about Normal Forms: (A) Lossless preserving decomposition into 3NF is always possible (B) Lossless preserving decomposition into BCNF is always possible (C) Any relation with two attributes is in BCNF (D) BCNF is stronger than 3NF

Last Answer : (B) Lossless preserving decomposition into BCNF is always possible