Q.1 Which of the following relational algebra operations do not require the participating
tables to be union-compatible?
(A) Union (B) Intersection
(C) Difference (D) Join
Q.2 Which of the following is not a property of transactions?
(A) Atomicity (B) Concurrency
(C) Isolation (D) Durability
Q.3 Relational Algebra does not have
(A) Selection operator. (B) Projection operator.
(C) Aggre gation operators. (D) Division operator.
Q.4 Checkpoints are a part of
(A) Recovery measures. (B) Security measures.
(C ) Concurrency measures. (D) Authorization measures.
Q.5 Tree structures are used to store data in
(A) Network model. (B) Relational model.
(C) Hierarchical model. (D) File based system.
Q.6 The language that requires a user to specify the data to be retrieved without specifying
exactly how to get it is
(A) Procedural DML. (B) Non-Procedural DML.
(C) Procedural DDL. (D) Non-Procedural DDL.
Q.7 Precedence graphs help to find a AC14/AT11
(A) Serializable schedule. (B) Recoverable schedule.
(C) Deadlock free schedule. (D) Cascadeless schedule.
Q.8 The rule that a value of a foreign key must appear as a value of some specific table is
called a
(A) Referential constraint. (B) Index.
(C) Integrity constraint. (D) Functional dependency.
Q.9 The clause in SQL that specifies that the query result should be sorted in ascending or
descending order based on the values of one or more columns is
(A) View (B) Order by
(C) Group by (D) Having
Q.10 What is a disjoint less constraint?
(A) It requires that an entity belongs to no more than one level entity set.
(B) The same entity may belong to more than one level.
(C) The database must contain an unmatched foreign key value.
(D) An entity can be joined with another entity in the same level entity set.
Q.11 According to the levels of abstraction, the schema at the intermediate level is called
(A) Logical schema. (B) Physical schema.
(C) Subschema. (D) Super schema.
e. none
Q.12 It is an abstraction through which relationships are treated as higher level entities
(A) Generalization. (B) Specialization.
(C) Aggregation. (D) Inheritance.
Q.13 A relation is in ____________ if an attribute of a composite key is dependent on an
attribute of other composite key.
(A) 2NF (B) 3NF
(C) BCNF (D) 1NF
Q.14 What is data integrity?
(A) It is the data contained in database that is non redundant.
(B) It is the data contained in database that is accurate and consistent.
(C) It is the data contained in database that is secured.
(D) It is the data contained in database that is shared.
Q.15 What are the desirable properties of a decomposition
(A) Partition constraint. (B) Dependency preservation.
(C) Redundancy. (D) Security.
Q.16 In an E-R diagram double lines indicate
(A) Total participation. (B) Multiple participation.
(C) Cardinality N. (D) None of the above.
Q.17 The operation which is not considered a basic operation of relational algebra is
(A) Join. (B) Selection.
(C) Union. (D) Cross product.
Q.18 Fifth Normal form is concerned with
(A) Functional dependency. (B) Multivalued dependency.
(C) Join dependency. (D) Domain-key.
Q.19 Block-interleaved distributed parity is RAID level
(A) 2. (B) 3
(C) 4. (D) 5.
Q.20 Immediate database modification technique uses
(A) Both undo and redo. (B) Undo but no redo.
(C) Redo but no undo. (D) Neither undo nor redo.
tables to be union-compatible?
(A) Union (B) Intersection
(C) Difference (D) Join
Q.2 Which of the following is not a property of transactions?
(A) Atomicity (B) Concurrency
(C) Isolation (D) Durability
Q.3 Relational Algebra does not have
(A) Selection operator. (B) Projection operator.
(C) Aggre gation operators. (D) Division operator.
Q.4 Checkpoints are a part of
(A) Recovery measures. (B) Security measures.
(C ) Concurrency measures. (D) Authorization measures.
Q.5 Tree structures are used to store data in
(A) Network model. (B) Relational model.
(C) Hierarchical model. (D) File based system.
Q.6 The language that requires a user to specify the data to be retrieved without specifying
exactly how to get it is
(A) Procedural DML. (B) Non-Procedural DML.
(C) Procedural DDL. (D) Non-Procedural DDL.
Q.7 Precedence graphs help to find a AC14/AT11
(A) Serializable schedule. (B) Recoverable schedule.
(C) Deadlock free schedule. (D) Cascadeless schedule.
Q.8 The rule that a value of a foreign key must appear as a value of some specific table is
called a
(A) Referential constraint. (B) Index.
(C) Integrity constraint. (D) Functional dependency.
Q.9 The clause in SQL that specifies that the query result should be sorted in ascending or
descending order based on the values of one or more columns is
(A) View (B) Order by
(C) Group by (D) Having
Q.10 What is a disjoint less constraint?
(A) It requires that an entity belongs to no more than one level entity set.
(B) The same entity may belong to more than one level.
(C) The database must contain an unmatched foreign key value.
(D) An entity can be joined with another entity in the same level entity set.
Q.11 According to the levels of abstraction, the schema at the intermediate level is called
(A) Logical schema. (B) Physical schema.
(C) Subschema. (D) Super schema.
e. none
Q.12 It is an abstraction through which relationships are treated as higher level entities
(A) Generalization. (B) Specialization.
(C) Aggregation. (D) Inheritance.
Q.13 A relation is in ____________ if an attribute of a composite key is dependent on an
attribute of other composite key.
(A) 2NF (B) 3NF
(C) BCNF (D) 1NF
Q.14 What is data integrity?
(A) It is the data contained in database that is non redundant.
(B) It is the data contained in database that is accurate and consistent.
(C) It is the data contained in database that is secured.
(D) It is the data contained in database that is shared.
Q.15 What are the desirable properties of a decomposition
(A) Partition constraint. (B) Dependency preservation.
(C) Redundancy. (D) Security.
Q.16 In an E-R diagram double lines indicate
(A) Total participation. (B) Multiple participation.
(C) Cardinality N. (D) None of the above.
Q.17 The operation which is not considered a basic operation of relational algebra is
(A) Join. (B) Selection.
(C) Union. (D) Cross product.
Q.18 Fifth Normal form is concerned with
(A) Functional dependency. (B) Multivalued dependency.
(C) Join dependency. (D) Domain-key.
Q.19 Block-interleaved distributed parity is RAID level
(A) 2. (B) 3
(C) 4. (D) 5.
Q.20 Immediate database modification technique uses
(A) Both undo and redo. (B) Undo but no redo.
(C) Redo but no undo. (D) Neither undo nor redo.
No comments:
Post a Comment