Anand institute of mathematics & CS

CBSE NET: Previous Year Questions

DBMS
[2018-2004]
November-2017
Q.1Which of the following is/are true with reference to 'view' in DBMS?
(a) A 'view' is a special stored procedure executed when certain event occurs.
(b) A 'view' is a virtual table, which occurs after executing a pre-compiled query.
Code:
(1) Only (a) is true
(2) Only (b) is true
(3) Both (a) and (b) are true
(4) Neither (a) nor (b) are true

Q.2In SQL, .................. is an Aggregate function.

(1) SELECT(2) CREATE(3) AVG(4) MODIFY

Q.3Match the following with respect to RDBMS:

List - I
(a) Entity integrity
(b) Domain integrity
(c) Referential integrity
(d) Userdefined integrity
List - II
(i) enforces some specific business rule that do not fall into entity or domain
(ii) Rows can't be deleted which are used by other records
(iii) enforces valid entries for a column
(iv) No duplicate rows in a table
Code:
(a) (b) (c) (d)
(1) (iii) (iv) (i) (ii)
(2) (iv) (iii) (ii) (i)
(3) (iv) (ii) (iii) (i)
(4) (ii) (iii) (iv) (i)

Q.4In RDBMS, different classes of relations are created using ...................

technique to prevent modification anomalies.
(1) Functional Dependencies
(2) Data integrity
(3) Referential integrity
(4) Normal Forms

1
Q.5.................. SQL command changes one or more fields in a record.
(1) LOOK-UP(2) INSERT(3) MODIFY(4) CHANGE

Q.6Consider the following four schedules due to three transactions (indicated

by the subscript) using read and write on a data item X, denoted by r(X) and
w(X) respectively. Which one of them is conflict serializable?
S1 : r1(X); r2(X); w1(X); r3(X); w2(X)
S2 : r2(X); r1(X); w2(X); r3(X); w1(X)
S3 : r3(X); r2(X); r1(X); w2(X); w1(X)
S4 : r2(X); w2(X); r3(X); r1(X); w1(X)
(1) S1(2) S2(3) S3(4) S4

Q.7Suppose a database schedule S involves transactions T 1, T 2, .............,T n.

Consider the precedence graph of S with vertices representing the
transactions and edges representing the conflicts. If S is serializable, which
one of the following orderings of the vertices of the precedence graph is
guaranteed to yield a serial schedule?
(1) Topological order(2) Depth - first order
(3) Breadth - first order(4) Ascending order of transaction indices

Q.8If every non-key attribute is functionally dependent on the primary key,

then the relation is in ....................
(1) First normal form
(2) Second normal form
(3) Third normal form
(4) Fourth normal form

Q.9Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and

following functional dependencies exist.
CH → G
A → BC
B → CFH
E→A
F → EG
The relation R is ....................
(1) in 1NF but not in 2NF(2) in 2NF but not in 3NF
(3) in 3NF but not in BCNF(4) in BCNF

Q.10Given two relations R1(A, B) and R2(C, D), the result of following query
Select distinct A, B from R1, R2
is guaranteed to be same as R1 provided one of the following condition is
satisfied.
(1) R1 has no duplicates and R2 is empty.
(2) R1 has no duplicates and R2 is non - empty.
(3) Both R1 and R2 have no duplicates.
(4) R2 has no duplicates and R1 is non - empty.

2
Q.11Consider a schema R(A, B, C, D) and following functional dependencies.
A→B
B→C
C→D
D→B
Then decomposition of R into R1(A, B), R2(B, C) and R3(B, D) is ..................
(1) Dependency preserving and lossless join.
(2) Lossless join but not dependency preserving.
(3) Dependency preserving but not lossless join.
(4) Not dependency preserving and not lossless join.

January-2017
Q.1An attribute A of datatype varchar(20) has value 'Ram' and the attribute B of
datatype char(20) has value 'Sita' in oracle. The attribute A has .......... memory
spaces and B has .......... memory spaces.
(1) 20, 20(2) 3, 20(3) 3, 4(4) 20, 4

Q.2Integrity constraints ensure that changes made to the database by authorized

users do not result into loss of data consistency. Which of the following
statement(s) is (are) true w.r.t. the examples of integrity constraints?
(A) An instructor Id. No. cannot be null, provided Instructor Id. No. being primary key.
(B) No two citizens have same Adhar-Id.
(C) Budget of a company must be zero.

(1) (A), (B) and (C) are true.

(2) (A) false, (B) and (C) are true.
(3) (A) and (B) are true; (C) false.
(4) (A), (B) and (C) are false.

Q.3Let 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, R 1 and R2 in the
relational model are…
(1) 4(2) 6(3) 7(4) 3

Q.4Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then

the decomposition of R into R1(MN) and R2(PQ) is .............
(1) Dependency preserving but not lossless join.
(2) Dependency preserving and lossless join
(3) Lossless join but not dependency preserving
(4) Neither dependency preserving nor lossless join.

3
Q.5The order of a leaf node in a B+ tree is the maximum number of children it can
have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes
long and search field value takes 14 bytes long. The order of the leaf node
is............
(1) 16(2) 63(3) 64(4) 65
Answer: Marks to all

Q.6Consider following schedules involving two transactions:

S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X)
S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)
Which of the following statement is true?
(1) Both S1 and S2 are conflict serializable.
(2) S1 is conflict serializable and S2 is not conflict serializable.
(3) S1 is not conflict serializable and S2 is conflict serializable.
(4) Both S1 and S2 are not conflict serializable.

Q.7Which one is correct w.r.t. RDBMS?

(1) primary key ⊆ super key ⊆ candidate key
(2) primary key ⊆ candidate key ⊆ super key
(3) super key ⊆ candidate key ⊆ primary key
(4) super key ⊆ primary key ⊆ candidate key

Q.8Let pk(R) denotes primary key of relation R. A many-to-one relationship that

exists between two relations R1 and R2 can be expressed as follows:
(1) pk(R2)→pk(R1)
(2) pk(R1)→pk(R2)
(3) pk(R2)→R1∩R2
(4) pk(R1)→R1∩R2

Q.9For 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

Q.10If following sequence of keys are inserted in a B+ tree with K(=3) pointers:
8, 5, 1, 7, 3, 12, 9, 6
Which of the following shall be correct B+ tree?

4
 Answer: 1

Q.11Consider the following relation:

Works (emp_name, company_name, salary)
Here, emp_name is primary key.
Consider the following SQL query
Select emp_name
From Works T
where salary>(select avg (salary)
from Works S
where T.company_name=
S. Company_name)
The above query is for following:
(1) Find the highest paid employee who earns more than the average salary of all
employees of his company.
(2) Find the highest paid employee who earns more than the average salary of all
the employees of all the companies.
(3) Find all employees who earn more than the average salary of all employees of all
the companies.
(4) Find all employees who earn more than the average salary of all employees
of their company.

August-2016 (Re-test)
Q.1DBMS provides the facility of accessing data from a database through
(A) DDL (B) DML(C) DBA (D) Schema

5
 Q.2Relational 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.

Q.2Consider the following statements regarding relational database model:

(a) NULL values can be used to opt a tuple out of enforcement of a foreign key.
(b) Suppose that table T has only one candidate key. If Q is in 3NF, then it is also in
BCNF.
(c) The difference between the project operator (P) in relational algebra and the
SELECT keyword in SQL is that if the resulting table/set has more than one
occurrences of the same tuple, then P will return only one of them, while SQL
SELECT will return all.
One can determine that:
(A) (a) and (b) are true.
(B) (a) and (c) are true.
(C) (b) and (c) are true.
(D) (a), (b) and (c) are true.

Q.3Consider the following Entity-Relationship (E-R) diagram and three possible

relationship sets (I, II and III) for this E-R diagram:

If different symbols stand for different values (e.g., t 1 is definitely not equal to
t2), then which of the above could not be the relationship set for the E-R
diagram?
(A) I only
(B) I and II only
(C) II only
(D) I, II and III

Q.4Consider a database table R with attributes A and B. Which of the following

SQL queries is illegal?
(A) SELECT A FROM R;
(B) SELECT A, COUNT(*) FROM R;
(C) SELECT A, COUNT(*) FROM R GROUP BY A;
(D) SELECT A, B, COUNT(*) FROM R GROUP BY A, B;

6
Q.5Which of the following statements is/are True regarding some advantages that
an object-oriented DBMS (OODBMS) offers over a relational database?
I. An OODBMS avoids the “impedance mismatch” problem.
II. An OODBMS avoids the “phantom” problem.
III. An OODBMS provides higher performance concurrency control than most
relational databases.
IV. An OODBMS provides faster access to individual data objects once they have
been read from disk.
(A) II and III only (B) I and IV only(C) I, II, and III only (D) I, III and IV only

Q.7The Global conceptual Schema in a distributed database contains information

about global relations. The condition that all the data of the global relation
must be mapped into the fragments, that is, it must not happen that a data
item which belongs to a global relation does not belong to any fragment, is
called:
(A) Disjointness condition (B) Completeness condition
(C) Reconstruction condition (D) Aggregation condition

Q.8Suppose database table T1(P, R) currently has tuples {(10, 5), (15, 8), (25,
6)} and table T2 (A, C) currently has {(10, 6), (25, 3), (10, 5)}. Consider the
following three relational algebra queries RA1, RA2 and RA3:

The number of tuples in the resulting table of RA1, RA2 and RA3 are given by:
(A) 2, 4, 2 respectively (B) 2, 3, 2 respectively
(C) 3, 3, 1 respectively (D) 3, 4, 1 respectively

Q.9Consider the table R with attributes A, B and C. The functional dependencies

that hold on R are:
A → B, C → AB. Which of the following statements is/are True?
I. The decomposition of R into R1(C, A) and R2(A, B) is lossless.
II. The decomposition of R into R1(A, B) and R2(B, C) is lossy.
(A) Only I (B) Only II (C) Both I and II (D) Neither I nor II

Q.10Consider the following ORACLE relations:

One (x, y) = {<2, 5>, <1, 6>, <1, 6>, <1, 6>, <4, 8>, <4, 8>}
Two (x, y) = {<2, 55>, <1, 1>, <4, 4>, <1, 6>, <4, 8>, <4, 8>, <9, 9>, <1, 6>}
Consider the following two SQL queries SQ1 and SQ2:
SQ1: SELECT * FROM One)
EXCEPT
(SELECT * FROM Two);
SQ2: SELECT * FROM One)
EXCEPT ALL
(SELECT * FROM Two);
7
 For each of the SQL queries, what is the cardinality (number of rows) of the
result obtained when applied to the instances above?
(A) 2 and 1 respectively (B) 1 and 2 respectively
(C) 2 and 2 respectively (D) 1 and 1 respectively

Q.11Which one of the following pairs is correctly matched in the context of

database design?
List – I List – II
(Database term) (Definition)
I. Specialization A. Result of taking the union of two or more
disjoint (lower-level) entity sets to producea
higher-level entity set.
II. Generalization B. Express the number of entities to which another
entity can be associated via a relationship set.
III. Aggregation C. Result of taking a subset of a higher-level
entity set to form a lower-level entity set.
IV. Mapping cardinalities D. An abstraction in which relationship sets (along
with their associated entity sets) are treated as
higher-level entity sets, and can participate in
relationships.
Codes:
I II III IV
(A) D A B C
(B) D C B A
(C) C D A B
(D) C A D B

July-2016
Q.1In RDBMS, the constraint that no key attribute (column) may be NULL is
referred to as:
(A) Referential integrity (B) Multi-valued dependency
(C) Entity Integrity (D) Functional dependency

Q.2Which of the following statement(s) is/are FALSE in the context of Relational

DBMS?
I. Views in a database system are important because they help with access control
by allowing users to see only a particular subset of the data in the database.
II. E-R diagrams are useful to logically model concepts.
III. An update anomaly is when it is not possible to store information unless some
other, unrelated information is stored as well.
IV. SQL is a procedural language.
(A) I and IV only (B) III and IV only
(C) I, II and III only (D) II, III and IV only

8
 Q.3In 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.

Q.4Consider 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

Q.5Consider 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:
A B C D
a1 b1 c1 d1
a2 b3 c3 d1
a1 b2 c1 d2
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

Q.6In distributed databases, location transparency allows for database users,

programmers and administrators to treat the data as if it is at one location. A
SQL query with location transparency needs to specify:
(A) Inheritances
(B) Fragments
(C) Locations
(D) Local formats

9
Q.7Consider 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.

Q.8Which of the following statements is TRUE?

D1: The decomposition of the schema R(A,B,C) into R 1(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

Q.9Consider the following ORACLE relations:

R(A,B,C) = {<1,2,3>, <1,2,0>, <1,3,1>, <6,2,3>, <1,4,2>, <3,1,4>}
S(B,C,D) = {<2,3,7>, <1,4,5>, <1,2,3>, <2,3,4>, <3,1,4>}
Consider the following two SQL queries SQ1 and SQ2:
SQ1: SELECT R.B, AVG(S.B)
FROM R, S
WHERE R.A = S.C AND S.D < 7
GROUP BY R.B;
SQ2: SELECT DISTINCT S.B, MIN (S.C)
FROM S
GROUP BY S.B
HAVING COUNT (DISTINCT S.D) > 1;
If M is the number of tuples returned by SQ 1 and N is the number of tuples
returned by SQ 2 then
(A) M=4, N=2 (B) M=5, N=3 (C) M=2, N=2 (D) M=3, N=3

Q.10Semi-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.

10
 December-2015
Q.1Consider a “CUSTOMERS” database table having a column “CITY” filled with
all the names of Indian cities (in capital letters). The SQL statement that finds
all cities that have “GAR” somewhere in its name, is:
(A) Select *from customers where city=‟%GAR%‟;
(B) Select *from customers where city=‟$GAR$‟;
(C) Select *from customers where city like „%GAR%‟;
(D) Select *from customers where city as ‟%GAR‟;

Q.2 Match the following database terms to their functions:

List-I List-II
(a) Normalization (i) Enforces match of primary key to foreign key
(b) Data Dictionary (ii) Reduces data redundancy in a database
(c) Referential Integrity (iii) Define view(s) of the database for particular
user(s).
(d) External Schema (iv) Contains metadata describing database structure.
Codes:
(a) (b) (c) (d)
(A) (iv) (iii) (i) (ii)
(B) (ii) (iv) (i) (iii)
(C) (ii) (iv) (iii) (i)
(D) (iv) (iii) (ii) (i)

Q.3Which of the following provides the best description of an entity type?

(A) A specific concrete object with a defined set of processes (e.g. Jatin with
diabetes)
(B) A value given to a particular attribute (e.g. height-230 cm)
(C) A thing that we wish to collect data about zero or more, possibly real world
examples of it may exist.
(D) A template for a group of things with the same set of characteristics that
may exist in the real world

Q.4Data which improves the performance and accessibility of the database are
called:
(A) Indexes
(B) User Data
(C) Application Metadata
(D) Data Dictionary

Q.5 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

11
 Q.6Which of the following statements regarding the features of the object-
oriented approach to databases are true?
(a) The ability to develop more realistic models of the real world.
(b) The ability to represent the world in a non-geometric way.
(c) The ability to develop databases using natural language approaches.
(d) The need to split objects into their component parts.
(e) The ability to develop database models based on location rather than state and
behaviour.
Codes:
(A) (a), (b) and (c) (B) (b), (c) and (d)
(C) (a), (d) and (e) (D) (c), (d) and (e)

Q.7Consider 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

Q.8Suppose 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

Q.9 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

12
Q.10The distributed system is a collection of (P) and communication is achieved in
distributed system by (Q), where (P) and (Q) are:
(A) Loosely coupled hardware on tightly coupled software and disk sharing,
respectively.
(B) Tightly coupled hardware on loosely coupled software and shared memory,
respectively.
(C) Tightly coupled software on loosely coupled hardware and message
passing,respectively.
(D) Loosely coupled software on tightly coupled hardware and file sharing,
respectively.

Q.11Consider the following three tables R, S and T. In this question, all the join
operations are natural joins (⨝). (π) is the projection operation of a relation :

Possible answer tables for this question are also given as below:

What is the resulting table of πA,B(R⨝T) ⨝ πB,C(S⨝T) ?

(A) (a) (B) (b)(C) (c) (D) (d)

13
 June-2015
Q.1 An Assertion is a predicate expressing a condition we wish database to always
satisfy. The correct syntax for Assertion is:
(A) CREATE ASSERTION „ASSERTION Name‟ CHECK „Predicate‟
(B) CREATE ASSERTION „ASSERTION NAME‟
(C) CREATE ASSERTION, CHECK Predicate
(D) SELECT ASSERTION

Q.2Which of the following concurrency protocol ensures both conflict

serializability and freedom from deadlock?
(a) 2-phase Locking
(b) Time stamp - ordering
(A) Both (a) and (b) (B) (a) only
(C) (b) only (D) Neither (a) nor (b)

Q.3Drop Table cannot be used to drop a Table referenced by ..................

constraint.
(a) Primary key (b) Sub key (c) Super key (d) Foreign key

(A) (a) (B) (a), (b) and (c)(C) (d) (D) (a) and (d)

Q.4 Database applications were built directly on top of file system to overcome
the following drawbacks of using file-systems
(a) Data redundancy and inconsistency
(b) Difficulty in accessing Data
(c) Data isolation
(d) Integrity problems
(A) (a) (B) (a) and (d)
(C) (a), (b) and (c) (D) (a), (b), (c) and (d)

Q.5 For a weak entity set to be meaningful, it must be associated with another
entity set in combination with some of their attribute values, is called as:
(A) Neighbour Set
(B) Strong Entity Set
(C) Owner entity set
(D) Weak Set

Q.6 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 much minimum number of tables are required to represent this situation
in the Relational Model?
(A) 4 (B) 3 (C) 2 (D) 1

14
Q.7 The STUDENT information in a university is stored in the relation STUDENT
(Name, Sex, Marks, DEPT_Name)
Consider the following SQL Query SELECT DEPT_Name from STUDENT where
SEX='M' group by DEPT_Name having avg (Marks)>(SELECT avg (Marks) from
STUDENT). It returns the Name of the Department for which:
(A) The Average marks of Male students is more than the average marks of students
in the same Department
(B) The average marks of male students is more than the average marks of the
students in the University
(C) The average marks of male students is more than the average marks of male
students in the University
(D) The average marks of students is more than the average marks of male students
in the University

Q.8 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

Q.9 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

Q.10 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

Q.11 In the indexed scheme of blocks to a file, the maximum possible size of the
file depends on:
(A) The number of blocks used for index, and the size of index
(B) Size of Blocks and size of Address
(C) Size of Index
(D) Size of Block

15
 December-2014
Q.1 Division operation is ideally suited to handle queries of the type:
(A) customers who have no account in any of the branches in Delhi.
(B) customers who have an account at all branches in Delhi.
(C) customers who have an account in atleast one branch in Delhi.
(D) customers who have only joint account in any one branch in Delhi

Q.2 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.

Q.3 What kind of mechanism is to be taken into account for converting a weak
entity set into strong entity set in entity-relationship diagram?
(A) Generalization (B) Aggregation
(C) Specialization (D) Adding suitable attributes

Q.4 The best normal form of relation scheme R(A, B, C, D) along with the set of
functional dependencies F = {ABC, ABD, CA, DB} is
(A) Boyce-Codd Normal form (B) Third Normal form
(C) Second Normal form (D) First Normal form

Q.5 Identify the minimal key for relational scheme R(A, B, C, D, E) with
functional dependencies F = {AB, BC, ACD}
(A) A (B) AE (C) BE (D) CE

Q.6 Location transparency allows:

I. Users to treat the data as if it is done at one location.
II. Programmers to treat the data as if it is at one location.
III. Managers to treat the data as if it is at one location.
Which one of the following is correct?
(A) I, II and III (B) I and II only
(C) II and III only (D) II only

Q.7 Which of the following is correct?

I. Two phase locking is an optimistic protocol.
II. Two phase locking is pessimistic protocol
III. Time stamping is an optimistic protocol.
IV. Time stamping is pessimistic protocol.
(A) I and III (B) II and IV
(C) I and IV (D) II and III

16
Q.8............... rules used to limit the volume of log information that has to be
handled and processed in the event of system failure involving the loss of
volatile information.
(A) Write-ahead log
(B) Check-pointing
(C) Log buffer
(D) Thomas

Q.9 Let R = ABCDE is a relational scheme with functional dependency set F =

{AB, BC, ACD}. The attribute closures of A and E are
(A) ABCD, 
(B) ABCD, E
(C) , 
(D) ABC, E

Q.10 Which of the following is false?

(A) Every binary relation is never be in BCNF.
(B) Every BCNF relation is in 3NF.
(C) 1 NF, 2 NF, 3 NF and BCNF are based on functional dependencies.
(D) Multivalued Dependency (MVD) is a special case of Join Dependency (JD).

June-2014
Q.1 Manager's salary details are hidden from the employee. This is called as
(A) Conceptual level data hiding
(B) Physical level data hiding
(C) External level data hiding
(D) Local level data hiding

Q.2 Which of the following statements is false?

(A) Any relation with two attributes is in BCNF.
(B) A relation in which every key has only one attribute is in 2NF.
(C) A prime attribute can be transitively dependent on a key in 3NF relation.
(D) A prime attribute can be transitively dependent on a key in BCNF relation.

Q.3 A clustering index is created when................

(A) primary key is declared and ordered
(B) no key ordered
(C) foreign key ordered
(D) there is no key and no order

Q.4 Let R ={A, B, C, D, E, F} be a relation schema with the following

dependencies C→F,E→A,EC→D,A→B
Which of the following is a key for R?
(A) CD (B) EC (C) AE (D) AC

17
 Q.5 Match the following:
List-I List-II
a.DDL i. LOCK TABLE
b. DML ii. COMMIT
c. TCL iii. Natural Difference
d. BINARY Operation iv. REVOKE
Codes:
a b c d
(A) ii i iii iv
(B) i ii iv iii
(C) iii ii i iv
(D) iv i ii iii

Q.6 Consider the following relational schemes for a library database:

Book (Title, Author, Catalog_no, Publisher, Year, Price)
Collection(Title, Author, Catalog_no)

with the following functional dependencies:

I. Title Author → Catalog_noTitle Author → Catalog_no
II. Catalog_no → Title Author Publisher YearCatalog_no → Title Author Publisher Year
III. Publisher Title Year→ PricePublisher Title Year→ Price
Assume { Author, Title }{ Author, Title } is the key for both schemes. Which
of the following statements is true?
A. Both Book and Collection are in BCNF
B. Both Book and Collection are in 3NF only
C. Book is in 2NF and Collection in 3NF
D. Both Book and Collection are in 2NF only

Answer: C
It is given that {Author, Title} is the key for both schemas.
The given dependencies are:

 {Title, Author} --> {Catalog_no}

 Catalog_no --> {Title , Author , Publisher , Year }
 {Publisher , Title , Year} --> {Price}

First, let's take schema Collection ( Title , Author , Catalog_no ) :

{Title, Author} --> Catalog_no
{Title, Author} is a candidate key and hence super key also and by definition
of BCNF this is in BCNF.
Now , let's see Book (Title , Author , Catalog_no, Publisher , Year , Price ) :
{Title, Author}+ --> {Title, Author, Catalog_no, Publisher, Year, Price}
{Catalog_no}+--> {Title, Author, Publisher, Year , Price , Catalog_no}

18
So candidate keys are: Catalog_no, {Title, Author}
But in the given dependencies, {Publisher, Title, Year} --> Price, which has
Transitive Dependency. So, Book is in 2NF.

Q.7 Specialization Lattice stands for

A. An entity type can participate as a subclass in only one specialization.
B. An entity type can participate as a subclass in more than one
specialization.
C. An entity type that can participate in one specialization.
D. An entity type that can participate in one generalization.

Q.8 Consider the schema R=(S,T,U,V) and the dependencies S→T,T→U,U→V

and V→S. Let R=(R1 and R2) be a decomposition such that R1∩R2≠∅. The
decomposition is
A. not in 2NF
B. in 2NF but not 3NF
C. in 3NF but not in 2NF
D. in both 2NF and 3NF

R1∩R2≠ϕ. This makes the decomposition lossless join, as all the attributes are
keys, R1∩R2 will be a key of the decomposed relations (lossless condition says the
common attribute must be a key in at least one of the decomposed relation). Now, even
the original relation RR is in 3NF (even BCNF) as all the attributes are prime attributes
(in fact each attribute is a candidate key). Hence, any decomposition will also be
in 3NF3NF (even BCNF). Option D.

PS: Decomposition in 3NF3NF means decomposed relations are in 3NF3NF. But when
we consider any decomposed relation, we must also include any FD which are being
implied by the original relational schema. For example, in a decomposed
relation STU,STU, there will be a FD U→SU→S as well.

Q.9 Match the following:

LIST-I LIST-II

a. Timeout ordering protocol i. Wait for graph

b. Deadlock prevention ii. Roll back

c. Deadlock detection iii. Wait-die scheme

d. Deadlock recovery iv. Thomas Write Rule

19
A. a-iv; b-iii; c-i; d-ii
B. a-iii; b-ii; c-iv; d-i
C. a-ii; b-i; c-iv; d-iii
D. a-iii; b-i; c-iv; d-iii

Answer: A
E. LIST-I LIST-II
a. Timeout ordering protocol iv. Thomas Write Rule
b. Deadlock prevention iii. Wait-die scheme
c. Deadlock detection i. Wait for graph
d. Deadlock recovery ii. Roll back
Q.10 Which of the following concurrency control protocols ensure both
conflict serializability and freedom from deadlock?
A) 2-phase locking
B) Time-stamp ordering
1. I only
2. II only
3. Both I and II
4. Neither I nor II

December-2013
Q.1 The student marks should not be greater than 100. This is
(A) Integrity constraint
(B) Referential constraint
(C) Over-defined constraint
(D) Feasible constraint

Q.2 GO BOTTOM and SKIP-3 commands are given one after another in a
database file of 30 records. It shifts the control to
(A) 28th record
(B) 27th record
(C) 3rd record
(D) 4th record

Q.3 An ER Model includes

I. An ER diagram portraying entity types.
II. Attributes for each entity type
III. Relationships among entity types.
IV. Semantic integrity constraints that reflects the business rules about data not
captured in the ER diagram.
(A) I, II, III & IV (B) I&IV
(C) I, II & IV (D) I & III

20
Q.4 Based on the cardinality ratio and participation ............... associated with a
relationship type, choose either the Foreign Key Design, the Cross
Referencing Design or Mutual Referencing Design.
(A) Entity (B) Constraints (C) Rules (D) Keys

Q.5 Data Integrity control uses................

(A) Upper and lower limits on numeric data.
(B) Passwords to prohibit unauthorised access to files.
(C) Data dictionary to keep the data
(D) Data dictionary to find last access of data

Q.6 Consider the following ER diagram:

The minimum number of tables required to represent M, N, P, R 1, R2 is

(A) 2 (B) 3
(C) 4 (D) 5

Explanation:
Since R1 is many to one and participation of M is total, M and R1 can be combined
to form the table {M1, M2, M3, P1}. N is a week entity set, so it can be combined
with P.

Q.7 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))

Q.8 Find the false statement:

(A) The relationship construct known as the weak relationship type was defined by
Dey, Storey & Barron (1999).
(B) A weak relationship occurs when two relationship types are linked by either
Event-Precedent sequence or Condition-Precedent sequence
(C) Conceptual model is not accurate representation of "Universe of interest".
(D) Ternary, Quaternary and Quintary relationships are shown through a series of
application scenario's and vignette's

21
Q.9 Consider the table
Student(stuid, name, course, marks). Which one of the following two queries
is correct to find the highest marks student in course 5?
Q.1. Select S.stuid
From student S
Where not exists
(select * from student e where e course='5' and e marks ≥ s marks)
Q.2. Select S.stuid
From student S
Where s.marks > any (select distinct marks from student S where s.couse = 5)
(A) Q.1
(B) Q.2
(C) Both Q.1 and Q.2
(D) Neither Q.1 nor Q.2

Q.10 Armstrong (1974) proposed systematic approach to derive functional

dependencies. Match the following w.r.t. functional dependencies.
List - I
a. Decomposition rule
b. Union rule
c. Composition rule
d. Pseudo transitivity rule
List - II
i. If X→Y and Z→W then {X, Z}→{Y, W}
ii. If X→Y and {Y, W}→Z then {X, W}→Z
iii. If X→Y and X→Z then X→{Y, Z}
iv. If X→{Y, Z} then X→Y and X→Z
Codes:
a b c d
(A) iii ii iv i
(B) i iii iv ii
(C) ii i iii iv
(D) iv iii i ii

Q.11 Match the following:

List – I
a. Secondary Index
b. Non-procedural Query
c. Closure of set of Attributes
d. Natural JOIN
List - II
i. Functional Dependency
ii. B-tree
iii. Relational Algebraic Operation
iv. Domain Calculus

22
Codes:
a b c d
(A) i ii iv iii
(B) ii i iv iii
(C) i iii iv ii
(D) ii iv i iii

June-2013 (Re-test 8th Sept. 2013)

Q.1Thoma‟s-write rule is.................
(A) Two phase locking protocol (B) Timestamp ordering protocol
(C) One phase locking protocol (D) Sliding window protocol

Q.2 Usage of Preemption and Transaction Rollback prevents..................

(A) Unauthorised usage of data file
(B) Deadlock situation
(C) Data manipulation
(D) File pre-emption

Q.3 .................. constraints ensure that a value that appears in one relation for a
given set of attributes also appears for a certain set of attributes in another relation.
(A) Logical Integrity
(B) Referential Integrity
(C) Domain Integrity
(D) Data Integrity

Q.4 The SQL expression

Select distinct T, branch_name from branch T, branch S where T.assets>S.assets
and S.branch_city=”Mumbai” finds the names of
(A) All branches that have greater assets than some branch located in
Mumbai.
(B) All branches that have greater assets than all branches in Mumbai.
(C) The branch that has greatest asset in Mumbai.
(D) Any branch that has greater assets than any branch in Mumbai.

Q.5 Consider the following schemas:

Branch_Schema = (branch_name, assets, city)
Customer_Schema = (cutstomer_name, street, city)
Deposit_Schema = (branch_name, account_number, customer_name, balance)
Borrow_Schema = (branch_name, loan_number, customer_name, amount)
Which of the following tuple relational calculus finds all customers who have loan
amount more than Rs 12,000?
(A) {t(customer_name) | t∈borrow[?] t[amount]>12000}
(B) {t |t(customer_name) | t∈borrow[?] t[amount]>12000}
(C) {t |[?] ∈ borrow (t(customer_name=s(customer_ name))[?] [amount]>12000}
(D) {t |[?] ∈ borrow (t(customer_name)[?] s[amount] >12000}

23
Q.6 Match the following:
(a) Create (i) The E-R Model
(b) Select (ii) Relationship Model
(c) Rectangle (iii) DDL
(d) Record (iv) DML

Codes:
(a) (b) (c) (d)
(A) (iii) (iv) (i) (ii)
(B) (iv) (iii) (ii) (i)
(C) (iv) (iii) (i) (ii)
(D) (iii) (iv) (ii) (i)

Q.7 Match the following:

Codes:
(a) (b) (c) (d)
(A) (iii) (iv) (ii) (i)
(B) (iv) (iii) (ii) (i)
(C) (ii) (iii) (iv) (i)
(D) (iii) (iv) (i) (ii)

June-2013
Q.1 Manager's salary details are to be hidden from Employee Table. This
Technique is called as
(A) Conceptual level Datahiding
(B) Physical level Datahiding
(C) External level Datahiding
(D) Logical level Datahiding

Q.2 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

24
 Q.3 Which normal form is considered as adequate for usual database design?
(A) 2NF (B) 3NF
(C) 4NF (D) 5NF

Q.4 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

Q.5 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

Q.6 The employee information of an Organization is stored in the relation:

Employee (name, sex, salary, deptname)
Consider the following SQL query
Select deptname from Employee Where sex = „M‟ group by deptname having avg
(salary) > {select avg (salary) from Employee}
Output of the given query corresponds to
(A) Average salary of employee more than average salary of the organization.
(B) Average salary less than average salary of the organization.
(C) Average salary of employee equal to average salary of the organization.
(D) Average salary of male employees in a department is more than average
salary of the organization.

Q.7 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

December-2012
Q.1 Which of the following is true?
(A) A relation in BCNF is always in 3NF.
(B) A relation in 3NF is always in BCNF.
(C) BCNF and 3NF are same.
(D) A relation in BCNF is not in 3NF.

25
Q.2 Given a Relation POSITION (Posting-No, Skill), then query to retrieve all
distinct pairs of posting-nos. requiring skill is
(A) Select p.posting-No, p.posting-No
from position p
where p.skill = p.skill
and p.posting-No < p.posting-No
(B) Select p1.posting-No, p2.posting-No
from position p1, position p2
where p1.skill = p2.skill
(C) Select p1.posting-No, p2.posting-No
from position p1, position p2
where p1.skill = p2.skill
and p1.posting-No < p2.posting-No
(D) Select p1.posting-No, p2.posting-No
from position p1, position p2
where p1.skill = p2.skill
and p1.posting-No = p2.posting-No

Q.3 If a relation with a Schema R is decomposed into two relations R 1 and

R2 such that (R1UR2)=R1 then which one of the following is to be satisfied for a
lossless joint decomposition (→ indicates functional dependency)
(A) (R1∩R2)→R1 or R1∩R2→R2
(B) R1∩R2→R1
(C) R1∩R2→R2
(D) R1∩R2→R1 and R1∩R2→R2

Explanation:
Let R be a relation schema.
Let F be a set of functional dependencies on R.
Let R1 and R2 form a decomposition of R.
The decomposition is a lossless-join decomposition of R if at least one of the
following functional dependencies are in F+
1. R1∩R2→R1
2. R1∩R2→R2

Q.4 Which level of Abstraction describes how data are stored in the data
base?
(A) Physical level
(B) View level
(C) Abstraction level
(D) Logical level

Q.5 Third normal form is based on the concept of ………….

(A) Closure Dependency (B) Transitive Dependency
(C) Normal Dependency (D) Functional Dependency

26
Q.6 Referential integrity is directly related to
(A) Relation key(B) Foreign key
(C) Primary key(D) Candidate key

June-2012
Q.1 What deletes the entire file except the file structure?
(A) ERASE (B) DELETE(C) ZAP (D) PACK

Q.2 Which command is the fastest among the following?

(A) COPY TO <NEW FILE>
(B) COPY STRUCTURE TO <NEW FILE>
(C) COPY FILE <FILE 1><FILE 2>
(D) COPY TO MFILE-DAT DELIMITED

Q.3 B+ tree are preferred to binary tree in Database because

(A) Disk capacity are greater than memory capacities
(B) Disk access is much slower than memory access
(C) Disk data transfer rates are much less than memory data transfer rate
(D) Disks are more reliable than memory

Q.4A Transaction Manager is which of the following?

(A) Maintains a log of transactions
(B) Maintains before and after database images
(C) Maintains appropriate concurrency control
(D) All of the above

Q.5A / B+ tree index is to be built on the name attribute of the relation

STUDENT. Assume that all students names are of length 8 bytes, disk block
are of size 512 bytes and index pointers are of size 4 bytes. Given this
scenario what would be the best choice of the degree (i.e. the number of
pointers per node) of the B+ tree?
(A) 16 (B) 42(C) 43 (D) 44

Q.6What is Granularity?
(A) The size of database
(B) The size of data item
(C) The size of record
(D) The size of file

Q.7 Which level of Abstraction describes what data are stored in the
Database?
(A) Physical level
(B) View level
(C) Abstraction level
(D) Logical level

27
Q.8The problem that occurs when one transaction updates a database item
and then the transaction fails for some reason is …………….
(A) Temporary Select Problem
(B) Temporary Modify Problem
(C) Dirty Read Problem
(D) None

Q.9Consider a schema R(A, B, C, D) and functional dependencies AB and

CD. Then the decomposition R1(A, B) and R2(C, D) is
(A) Dependency preserving but not lossless join
(B) Dependency preserving and lossless join
(C) Lossless Join but not dependency preserving
(D) Lossless Join

December-2011
Q.1 B + tree are preferred to binary tree in database because
(A) Disk capacities are greater than memory capacities
(B) Disk access much slower than memory access
(C) Disk data transfer rates are much less than memory data transfer rate
(D) Disk are more reliable than memory

Q.2 What deletes the entire file except the file structure?
(A) ERASE
(B) DELETE
(C) ZAP
(D) PACK

Q.3 Which command classes text file, which has been created using “SET
ALTERNATIVE” <FILE NAME> “Command”?
(A) SET ALTERNATE OFF
(B) CLOSE DATABASE
(C) CLOSE ALTERNATE
(D) CLEAR ALL

Q.4 Which of the following statements is true, when structure of database file
with 20 records is modified?
(A) ? EOF ( ) Prints T
(B) ? BOF ( ) Prints F
(C) ? BOF ( ) Prints T
(D) ? EOF ( ) Prints F

28
Q.5 The SQL Expression
Select distinct T. branch name from branch T, branch S where T. assets > S.
assets and S. branch-city = DELHI, finds the name of
(A) all branches that have greater asset than any branch located in DELHI.
(B) all branches that have greater assets than allocated in DELHI.
(C) the branch that has the greatest asset in DELHI.
(D) any branch that has greater asset than any branch located in DELHI.

June-2011
Q.1 The basic variants of time-stampbased method of concurrency control are
(A) Total time stamp-ordering
(B) Partial time stamp ordering
(C) Multiversion Time stamp ordering
(D) All of the above

Q.2 A transaction can include following basic database access operations:

(A) Read_item(X) (B) Write_item(X)
(C) Both (A) and (B) (D) None of these

Q.3 Decomposition help in eliminating some of the problems of bad design

(A) Redundancy (B) Inconsistencies
(C) Anomalies (D) All of the above

Q.4 Which of the following can be accessed by transfer vector approach of

linking?
(A) External data segments
(B) External subroutine
(C) Data located in other procedure
(D) All of the above

Q.5 Block or Buffer caches are used to

(A) improve disk performance
(B) handle interrupts
(C) increase the capacity of main memory
(D) speed up main memory Read operations

Q.6 A file organization component VSAM file is

(A) Relative records data set
(B) Keyed sequential data set
(C) Entry sequential data set
(D) All of the above

29
 December-2010
Q.1 In generalisation, the differences between members of an entity is
(A) maximized
(B) minimized
(C) both (A) & (B)
(D) None of these

Q.2 The dependency preservation decomposition is a property to decompose

database schema D, in which each functional dependency XY specified in F,
(A) appeared directly in one of the relation schemas Ri in the decomposed D.
(B) could be inferred from dependencies that appear in some Ri.
(C) both (A) and (B)
(D) None of these

Q.3 Which of the following is an optimistic concurrency control method?

(A) Validation based
(B) Time stamp ordering
(C) Lock-based
(D) None of these

Q.4 Optical storage is a

(A) high-speed direct access storage device.
(B) low-speed direct access storage device.
(C) medium-speed direct access storage device.
(D) high-speed sequential access storage device.

Q.5 Which of the following is the process by which a user‟s access to physical
data in the application is limited, based on his privileges?
(A) Authorization
(B) Authentication
(C) Access Control
(D) All of these

June-2010
Q.1 x1 is a clone of x” means x1 is identical to x in terms of the physical
attributes namely, height, weight and complexion. Given, height, weight and
complexion only form a complete set of attributes for an entity, cloning is an
equivalence relation. What is your impression about this statement?
(A) The statement is true
(B) The statement is false
(C) The truth value of the statement cannot be computed
(D) None of these

30
Q.2 An entity instance is a single occurrence of an …………..
(A) entity type
(B) relationship type
(C) entity and relationship type
(D) None of these

Q.3 Generalization is ………… process.

(A) top-down (B) bottom up
(C) both (A) & (B) (D) None of these

Q.4 Match the following:

Set-I
I. 2 NF
II. 3 NF
III. 4 NF
IV. 5 NF
Set-II
(a) transitive dependencies eliminated
(b) multivalued attribute removed
(c) contain no partial functional dependencies
(d) contains no join dependency
Codes:
I II III IV
(A) (a) (c) (b) (d)
(B) (d) (a) (b) (c)
(C) (c) (d) (a) (b)
(D) (d) (b) (a) (c)

Q.5 Which data management language component enabled the DBA to define
the schema components?
(A) DML
(B) Sub-schema DLL
(C) Schema DLL
(D) All of these

Q.6 The PROJECT Command will create new table that has
(A) more fields than the original table
(B) more rows than original table
(C) both (A) & (B)
(D) none of these

Q.7 In a B tree of order 5, the following keys are inserted as follows:

7, 8, 1, 4, 13, 20, 2, 6 and 5
How many elements are present in the root of the tree?
(A) 1 (B) 2 (C) 3 (D) 4

31
 December-2009
Q.1 If she is my friend and you are her friend, then we are friends. Given this,
the friend relationship in this context is …………...
(i) commutative
(ii) transitive
(iii) implicative
(iv) equivalence
(A) (i) and (ii)
(B) (iii)
(C) (i), (ii), (iii) and (iv)
(D) None of these

Q.2 The E-R model is expressed in term of

I. Entities
II. The relationship among entities.
III. The attributes of the entities.
IV. Functional relationship.
(A) I, II
(B) I, II, IV
(C) II, II, IV
(D) I, II, III

Q.3 Specialization is …………… process.

(A) top-down
(B) bottom up
(C) both (A) and (B)
(D) none of these

Q.4 Match the following:

List-I
(1) Determinants
(2) Candidate key
(3) Non-redundancy
(4) Functional dependency
List-I
(a) No attribute can be added
(b) Uniquely identified a row
(c) A constraint between two attribute
(d) Group of attributes on the left hand side of arrow of function dependency.
(A) 1 – d, 2 – b, 3 – a, 4 – c
(B) 2 – d, 3 – a, 1 – b, 4 – c
(C) 4 – a, 3 – b, 2 – c, 1 – d
(D) 3 – a, 4 – b, 1 – c, 2 – d

32
Q.5A function that has no partial functional dependencies is in …………….
form.
(A) 3 NF
(B) 2 NF
(C) 4 NF
(D) BCNF

Q.6Which of the following statement is wrong?

I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.
(A) I, II, II
(B) II, III, IV
(C) III, IV, V
(D) II, IV, V

June-2009
Q.1 Which one is correct?
(i) DML includes a query language based on both relation algebra and tuple calculus
(ii) DML includes a query language based on tuple calculus
(iii) DML includes a query language based on relational algebra
(iv) DML includes a query language based on none of the relational algebra and
tuple calculus
(A) (i) only
(B) (ii) only
(C) (iii) only
(D) (iv) only

Q.2 Which construct in SQL is used to test whether a subquery has any tuples
in its result?
(A) UNIQUE
(B) EXISTS
(C) GROUP BY
(D) EXCEPT

Q.3 ORACLE supports:

(A) inner join and outer join only
(B) outer join and semi join only
(C) inner join, outer join , semi join only
(D) inner join, outer join, semi join and anti join

33
 December-2008
Q.1 An entity has:
(i) a set of properties
(ii) a set of properties and values for all the properties
(iii) a set of properties and the values for some set of properties may non-uniquely
identify an entity
(iv) a set of properties and the values for some set of properties may uniquely
identify an entity
Which of the above are valid?
(A) (i) only
(B) (ii) only
(C) (iii) only
(D) (iv) only

Q.2 Aggregation is:

(A) an abstraction through which relationships are treated as lower level entities
(B) an abstraction through which relationships are treated as higher level
entities
(C) an abstraction through which relationships are not treated at all as entities
(D) none of the above

Q.3 Suppose R is a relation schema and F is a set of functional dependencies

on R. Further, suppose R1 and R2 form a decomposition of R. Then the
decomposition is a lossless join decomposition of R provided that:
(A) R1∩R2→R1 is in F+
(B) R1∩R2→R2 is in F+
(C) both R1∩R2→R1 and R1∩R2→R2 functional dependencies are in F +
(D) at least one from R1∩R2→R1 and R1∩R2→R2 is in F+

June-2008
Q.1 A superkey for an entity consists of:
(A) one attribute only
(B) at least two attributes
(C) at most two attributes
(D) one or more attributes

Q.2 Which of the following set of keywords constitutes a mapping in SQL?

(A) SELECT, FROM, TABLE
(B) SELECT, FROM, WHERE
(C) CONNECT, TABLE, CREATE
(D) SELECT, TABLE, INSERT

34
Q.3 If a relation is in 2NF then:
(A) every candidate key is a primary key
(B) every non-prime attribute is fully functionally dependent on each relation
key
(C) every attribute is functionally independent
(D) every relational key is a primary key

Q.4 Which of the following is true?

(A) A relation in 3NF is always in BCNF
(B) A relation in BCNF is always in 3NF
(C) BCNF and 3NF are totally different
(D) A relation in BCNF is in 2NF but not in 3NF

Q.5 Consider the query : SELECT student_name FROM student_data WHERE

rollno (SELECT rollno FROM student_marks WHERE
SEM1_MARK=SEM2_MARK);
Which of the following is true?
(A) It gives the name of the student whose marks in semester 1 and semester 2 are
same.
(B) It gives all the names and roll nos of those students whose marks in semester 1
and semester 2 are same.
(C) It gives the names of all the students whose marks in semester 1 and
semester 2 are same.
(D) It gives roll numbers of all students whose marks in semester 1 and semester 2
are same.

Q.6 An example of a possible file attribute is:

(A) minimum size(B) permanent flag
(C) archive flag(D) EBCDIC flag

December-2007
Q.1 A primary key for an entity is:
(A) a candidate key (B) any attribute
(C) a unique attribute (D) a super key

Q.2 Aggregate functions in SQL are:

(A) GREATEST, LEAST and ABS (B) SUM, COUNT and AVG
(C) UPPER, LOWER and LENGTH (D) SQRT, POWER and MOD

Q.3 If a relation is in 2NF and 3NF forms then:

(A) no non-prime attribute is functionally dependent on other non-prime
attributes
(B) no non-prime attribute is functionally dependent on prime attributes
(C) all attributes are functionally independent
(D) prime attribute is functionally independent of all non-prime attributes

35
Q.4 The end of an SQL command is denoted by:
(A) an end-of-line character
(B) an „enter-key‟ marker
(C) entering F4 key
(D) a semicolon (;)

Q.5 Consider the query : SELECT student_name FROM students WHERE

class_name=(SELECT class_name FROM students WHERE
math_marks=100); what will be the output ?
(A) the list of names of students with 100 marks in mathematics
(B) the names of all students of all classes in which at least one
student has 100 marks in mathematics
(C) the names of all students in all classes having 100 marks in mathematics
(D) the names and class of all students whose marks in mathematics is 100

June-2007
Q.1Which of the following statements is wrong?
(A) 2-phase Locking Protocols suffer from deadlocks
(B) Time-Stamp Protocols suffer from more aborts
(C) Time-Stamp Protocols suffer from cascading roll back where as 2-Phase
locking Protocol do not
(D) None of these

Q.2 A recursive foreign key is a:

(A) references a relation (B) references a table
(C) references its own relation (D) references a foreign key

Q.3 A sub class having more than one super class is called:
(A) Category (B) Classification
(C) Combination (D) Partial Participation

Q.4 A relation R={A,B,C,D,E,F} is given with following set of functional

dependencies:
F={A→B,AD→C,B→F,A→E}. Which of the following is Candidate Key?
(A) A (B) AC
(C) AD (D) None of these

Q.5 Which statement is false regarding data independence?

(A) Hierarchical data model suffers from data Independence
(B) Network model suffers from data Independence
(C) Relational model suffers only from logical data Independence
(D) Relational model suffers only from physical data Independence

December-2006
36
Q.1 In DBMS, deferred update means:
(A) All the updates are done first but the entries are made in the log file later
(B) All the log files entries are made first but the actual updates are done later
(C) Every update is done first followed by a writing on the log file
(D) Changes in the views are deferred till a query asks for a view

Q.2 Which statement is false regarding data independence?

(A) Hierarchical data model suffers from data independence
(B) Network model suffers from data independence
(C) Relational model suffers only from logical data independence
(D) Relational model suffers only from physical data independence

Q.3 Two phase protocol in a database management system is:

(A) a concurrency mechanism that is not deadlock free
(B) a recovery protocol used for restoring a database after a crash
(C) Any update to the system log done in 2-phases
(D) not effective in Database

June-2006
Q.1 A relation R = {A, B, C, D, E, F} is given with following set of functional
dependencies:
F = {A→B, AD→C, B→F, A→E}
Which of the following is candidate key?
(A) A
(B) AC
(C) AD
(D) None of these

Q.2 Immediate updates as a recovery protocol is preferable, when:

(A) Database reads more than writes
(B) Writes are more than reads
(C) It does not matter as it is good in both the situations
(D) There are only writes

Q.3 Which of the following statement is wrong?

(A) 2-phase locking protocol suffers from deadlocks
(B) Time-Stamp protocol suffers from more abort
(C) Time stamp protocol suffers from cascading rollbacks where as 2-phase
locking protocol do not
(D) None of these

Q.4 Which data management language component enabled the DBA to define
the schema components?
(A) DML
(B) Subschema DLL
37
(C) Schema DLL
(D) All of these

December-2005
Q.1 A schema describes:
(A) data elements (B) records and files
(C) record relationship (D) all of the above

Q.2 One approach to standardizing storing of data:

(A) MIS (B) CODASYL
(C) Structured Programming (D) None of the above

Q.3 In a relational schema, each tuple is divided in fields called:

(A) Relations (B) Domains
(C) Queries (D) All the above

Q.4 An embedded pointer provides:

(A) Physical record key
(B) An inserted Index
(C) A secondary access path
(D) All the above

Q.5 A locked file can be:

(A) accessed by only one user
(B) modified by users with the correct password
(C) is used to hide sensitive information
(D) both (B) and (C)

June-2005
Q.1 If a data-item is declared as a protected access specifier then it can be
accessed:
(A) Anywhere in the program
(B) By the base and derived classes
(C) Only by base class
(D) Only by derived class

Q.2 An Entity - relationship diagram is a tool to represent:

(A) Data model
(B) Process model
(C) Event model
(D) Customer model

Q.3 Multi-valued dependency among attribute is checked at which level?

(A) 2 NF
(B) 3 NF

38
(C) 4 NF
(D) 5 NF

Q.4 A WINDOW into a portion of a data base is:

(A) Schema
(B) View
(C) Query
(D) Data Dictionary

December-2004
Q.1 The E-R model is expressed in terms of:
(i) Entities
(ii) The relationship among entities
(iii) The attributes of the entities
Then
(A) (i) and (iii)
(B) (i), (ii) and (iii)
(C) (ii) and (iii)
(D) None of the above

Q.2 Specialization is a ............... process.

(A) Top - down (B) Bottom -Up
(C) Both (A) and (B) (D) None of the above

Q.3 The completeness constraint has rules:

(A) Supertype, Subtype
(B) Total specialization, Partial specialization
(C) Specialization, Generalization
(D) All of the above

Q.4 The entity type on which the ................. type depends is called the
identifying owner.
(A) Strong entity (B) Relationship
(C) Weak entity (D) E - R

Q.5 Match the following:

(i) 5 NF (a) Transitive dependencies eliminated
(ii) 2 NF (b) Multivalued attribute removed
(iii) 3 NF (c) Contains no partial functional dependencies
(iv) 4 NF (d) Contains no join dependency

(A) i-a, ii-c, iii-b, iv-d

(B) i-d, ii-c, iii-a, iv-b
(C) i-d, ii-c, iii-b, iv-a
(D) i-a, ii-b, iii-c, iv-d

39
 JULY-2018
Q.1 In RDBMS, which type of Join returns all rows that satisfy the join
condition?
(1) Inner Join (2) Outer Join
(3) Semi Join (4) Anti Join

Q.2 Consider a relation book (title, price) which contains the titles and prices
of different books. Assuming that no two books have the same price, what
does the following SQL query list?
Select title
from book as B
where (select count (*)
from book as T
where T.price > B.price) < 7
(1) Titles of the six most expensive books.
(2) Title of the sixth most expensive books.
(3) Titles of the seven most expensive books.
(4) Title of the seventh most expensive books.

Q.3 In a Hierachical database, a hashing function is used to locate the

________.
(1) Collision
(2) Root
(3) Foreign Key
(4) Records

Q.4 Relations produced from E - R Model will always be in ________.

(1) 1 NF (2) 2 NF (3) 3 NF (4) 4 NF

Q.5 Consider the following schedules involving two transactions.

S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X)
S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)
Which one of the following statements is correct with respect to above?
(1) Both S1 and S2 are conflict serializable.
(2) Both S1 and S2 are not conflict serializable.
(3) S1 is conflict serializable and S2 is not conflict serializable.
(4) S1 is not conflict serializable and S2 is conflict serializable.

Q.6 For a database relation R(a, b, c, d) where the domains of a, b, c and d

include only atomic values, and only the following functional dependencies
and those that can be inferred from them hold :
a→c
b→d
The relation is in _________.

40
(1) First normal form but not in second normal form
(2) Second normal form but not in third normal form
(3) Third normal form
(4) BCNF

Q.7 A many-to-one relationship exists between entity sets r1 and r2. How will it
be represented using functional depedencies if Pk(r) denotes the primary key
attribute of relation r?
(1) Pk(r1) → Pk(r2)
(2) Pk(r2) → Pk(r1)
(3) Pk(r2) → Pk(r1) and Pk(r1) → Pk(r2)
(4) Pk(r2) → Pk(r1) or Pk(r1) → Pk(r2)

Q.8 Database systems that store each relation in a separate operating system
file may use the operating system‟s authorization scheme, instead of defining
a special scheme themselves. In this case, which of the following is false?
(1) The administrator enjoys more control on the grant option.
(2) It is difficult to differentiate among the update, delete and insert authorizations.
(3) Cannot store more than one relation in a file.
(4) Operations on the database are speeded up as the authorization procedure is
carried out at the operating system level.

Q.9 Let R1(a, b, c) and R2(x, y, z) be two relations in which a is the foreign key
of R1 that refers to the primary key of R2. Consider following four options.
(a) Insert into R1 (b) Insert into R2
(c) Delete from R1 (d) Delete from R2
Which of the following is correct about the referential integrity constraint with
respect to above?
(1) Operations (a) and (b) will cause violation.
(2) Operations (b) and (c) will cause violation.
(3) Operations (c) and (d) will cause violation.
(4) Operations (d) and (a) will cause violation.

29-Oct-18

X
Amit Khurana
HOD@PIAIM

41
42