Scribd
Upload
177 views

Database Management Quiz

This document contains 50 multiple choice questions related to relational databases and relational algebra. The questions cover topics such as relational algebra operators, SQL statements, database modeling concepts like entities and relationships, keys, integrity constraints, and normalization.

Uploaded by

Gokaran Jindal
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
177 views

Database Management Quiz

This document contains 50 multiple choice questions related to relational databases and relational algebra. The questions cover topics such as relational algebra operators, SQL statements, database modeling concepts like entities and relationships, keys, integrity constraints, and normalization.

Uploaded by

Gokaran Jindal
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 50

Q.

Relational Algebra does not have


(A) Selection operator.
operator.
(C) Aggregation operators. (D)
operator.

(B)

Projection

Division

Q.3 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.4 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.5 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.6 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.7 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.

Q.8 It is an abstraction through which relationships are


treated as higher level entities
(A) Generalization. (B) Specialization.
(C) Aggregation.
(D) Inheritance.

Q.9

What is data integrity?


(A) It is the data contained
non redundant.
(B) It is the data contained
accurate and consistent.
(C) It is the data contained
secured.
(D) It is the data contained
shared.

in database that is
in database that is
in database that is
in database that is

Q.10 In an E-R diagram double lines indicate


(A) Total participation.
(B) Multiple
participation.
(C) Cardinality N.
(D) None of the
above.

Q.11 The operation which is not considered a basic


operation of relational algebra is
(A) Join. (B) Selection.
(C) Union.
(D) Cross product.

Q.12 In SQL the statement select * from R, S is


equivalent to
(A) Select * from R natural join S.
(B) Select * from R cross join S.
(C) Select * from R union join S.
(D) Select * from R inner join S.

Q.13 As per equivalence rules for query transformation,


selection operation distributes over
(A) Union.
(B) Intersection.
(C) Set difference.
(D) All of the above.

Q.14 The metadata is created by the


(A) DML compiler
(B) DML preprocessor
(C) DDL interpreter (D) Query interpreter

Q.15 When an E-R diagram is mapped to tables, the


representation is redundant for
(A) weak entity sets (B) weak relationship sets
(C) strong entity sets (D) strong relationship
sets

Q.16 When , then the cost of computing is


(A) the same as R S (B) greater the R S
(C) less than R S
(D) cannot say
anything

Q.17 In SQL the word natural can be used with


(A) inner join
(B) full outer join
(C) right outer join
(D) all of the above

Q.18
If the closure of an attribute set is the entire
relation then the attribute set is a
(A) superkey (B) candidate key
(C) primary key(D) not a key

Q.19 DROP is a ______________ statement in SQL.


(A) Query
(B) Embedded SQL
(C) DDL (D) DCL

Q.20 If two relations R and S are joined, then the non


matching tuples of both R and S are ignored in
(A) left outer join
(B) right outer join
(C) full outer join
(D) inner join

Q.21 The keyword to eliminate duplicate rows from the


query result in SQL is
(A) DISTINCT (B) NO DUPLICATE
(C) UNIQUE
(D) None of the above

Q.22 Which one is correct statement?


Logical data independence provides following without
changing application programs:
(i)
Changes in access methods.
(ii) Adding new entities in database
(iii) Splitting an existing record into two or more
records
(iv) Changing storage medium
(A) (i) and (ii) (B) (iv) only, (C) (i) and (iv) (D) (ii) and
(iii)

Q.23
In an E-R, Y is the dominant entity and X is a
subordinate entity. Then which of the following is incorrect
:
(A) Operationally, if Y is deleted, so is X
(B) existence is dependent on Y.
(C) Operationally, if X is deleted, so is Y.
(D) Operationally, if X is deleted, & remains the same.

Q.24 Relational Algebra is


(A) Data Definition Language .
(B) Meta Language
(C) Procedural query Language
(D) None of the above

Q.25 Which of the following aggregate functions does not


ignore nulls in its results?.
(A) COUNT .
(B) COUNT (*)
(C) MAX
(D) MIN

Q.26 Consider the join of relation R with a relation S. If R


has m tuples and S has n tuples, then the maximum and
minimum size of the join respectively are
(A) m+n and 0 (B) m+n and |m-n|
(C) mn and 0
(D) mn and m+n

Q.27 Which of the following is a reason to model data?


(A) Understand each users perspective of data
(B) Understand the data itself irrespective of the
physical representation
(C) Understand the use of data across application
areas
(D) All of the above

Q.28 If an entity can belong to only one lower level entity


then the constraint is
(A) disjoint
(B) partial
(C) overlapping(D) single

Q.29 The common column is eliminated in


(A) theta join (B) outer join
(C) natural join (D) composed join

Q.30 Use of UNIQUE while defining an attribute of a table


in SQL means that the attribute values are
(A) distinct values
(B) cannot have
NULL
(C) both (A) & (B)
(D) same as
primary key

Q.31 The division operator divides a dividend A of degree


m+n by a divisor relation B of degree n and produces a
result of degree
(A) m 1 (B) m + 1
(C) m * m
(D) m

Q.32 Which of the following is not a characteristic of a


relational database model?
(A) Table
(B) Tree like
structure
(C) Complex logical relationship (D) Records

Q.33 In E-R Diagram total participation is represented by


(A) double lines
(B) Dashed lines
(C) single line (D) Triangle

Q.34 Union operator is a :


(A) Unary Operator
(C) Binary Operator

(B)
(D)

Ternary Operator
Not an operator

Q.35 Relations produced from an E-R model will always


be
(A) First normal form. (B) Second normal form.
(C) Third normal form.
(D) Fourth normal
form.

Q.36 Manager salary details are hidden from the


employee .This is
(A) Conceptual level data hiding.
(B) External level data hiding.
(C) Physical level data hiding.
(D) None of these.

Q.37 Which two files are used during operation of the


DBMS?
(A) Query languages and utilities
(B) DML and query language
(C) Data dictionary and transaction log
(D) Data dictionary and query language

Q.38 A list consists of last names, first names, addresses


and pin codes. If all people in the list have the same last
name and same pin code a useful key would be
(A) the pin code
(B) the last name
(C) the compound key first name and last name
(D)

Tr from next page

Q.39 The values of the attribute describes a


particular_____________
(A) Entity set (B) File
(C) Entity instance
(D) Organization

Q.40 Which of the following relational algebraic


operations is not from set theory?
(A) Union
(B) Intersection
(C) Cartesian Product (D) Select

Q.41 Which of the following ensures the atomicity of the


transaction?
(A) Transaction management component of DBMS
(B) Application Programmer
(C) Concurrency control component of DBMS
(D) Recovery management component of DBMS

Q.42 What will be the number of columns and rows


respectively obtained for the operation, A- B, if A B are
Base union compatible and all the rows of a are common
to B? Assume A has 4 columns and 10 rows; and B has 4
columns and 15 rows
(A) 4,0 (B) 0,0
(C) 4,5 (D) 8,5

Q.43 Relationships among relationships can be


represented in an-E-R model using
(A) Aggregation
(B) Association
(C) Weak entity sets (D) Weak relationship sets


Q.44 The clause alter table in SQL can be used to
A
add an attribute
B
delete an attribute
C
alter the default values of an attribute
D
all of the above


Q.45 Whenever two independent one-to-many
relationships are mixed in the same relation, a _______
arises.
(A) Functional dependency
(B) Multi-valued dependency
(C) Transitive dependency
(D) Partial dependency


Q.46 A table can have only one
(A) Secondary key
(B)
(C) Unique key
(D)

Alternate key
Primary key


Q.47 Which of the following constitutes a basic set of
operations for manipulating relational data?
(A) Predicate calculus
(B) Relational
calculus
(C) Relational algebra
(D) SQL


Q.48 An advantage of views is
(A) Data security
columns
(C) Hiding of complex queries
above

(B)

Derived

(D)

All of the


Q.49 _______ operator is used to compare a value to a list
of literals values that have been specified.
(A) Like
(B) COMPARE
(C) BETWEEN (D) IN


Q.50 Which one of the following is not database model:
(A) Relational Model (B) ER Model
(C) Network Model
(D) Step Model

You might also like