1. The E-R model is expressed in terms of: (Dec – 2004)
(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
Answer:
- B
2. The
completeness constraint has rules: (Dec – 2004)
a. Super
type, Subtype
b. Total
specialization, Partial specialization
c. Specialization,
Generalization
d. All
of the above
Answer:
- B
3. The
entity type on which the................. Type depends is called the
identifying owner. (Dec- 2004)
a. Strong
entity
b. Relationship
c. Weak
entity
d. E
– R
Answer:
- C
4. Match
the following: (Dec – 2004)
(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
Answer:
- B
5.
An
Entity - relationship diagram is a tool to represent: (June –
2005)
a. Data
model
b. Process
model
c. Event
model
d. Customer
model
Answer:
- A
6.
Multi-valued dependency among
attribute is checked at which level? (June – 2005)
a. 2
NF
b. 3
NF
c. 4
NF
d. 5
NF
Answer:
- C
7.
A
WINDOW into a portion of a data base is: (June – 2005)
a. Schema
b. View
c. Query
d. Data
Dictionary
Answer:
- B
8. A schema describes: (Dec- 2005)
a. Data
elements
b. records
and files
c. record
relationship
d. all
of the above
Answer:
- D
9. One approach to standardizing storing of data: (Dec- 2005)
a. MIS
b. CODASYL
c. Structured
Programming
d. None
of the above
Answer:
- B
10. In a relational schema, each tuple is divided in
fields called: (Dec- 2005)
a. Relations
b. Domains
c. Queries
d. All
the above
Answer:
- B
11. An
embedded pointer provides (Dec-
2005)
a. Physical
record key
b. An
inserted Index
c. A
secondary access path
d. All
the above
Answer:
- C
12. A
locked file can be: (Dec-
2005)
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)
Answer:
- A
13. 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? (June
– 2006)
a.
A
b.
AC
c.
AD
d.
None of these
Answer: - C
14. Immediate
updates as a recovery protocol is preferable, when: (June – 2006)
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
Answer: - B
15. Which
of the following statement is wrong? (June – 2007)
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
Answer: - C
16. Which
data management language component enabled the DBA to define the schema
components? (June
– 2007)
a.
DML
b.
Subschema DLL
c.
Schema DLL
d.
All of these
Answer: - C
17. In DBMS, deferred update means: (June – 2007)
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
Answer: - B
18. Which
statement is false regarding data independence? (June – 2007)
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
Answer: - C
19. Two
phase protocol in a database management system is: (June – 2007)
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
Answer: - A
20. A
recursive foreign key is a: (June – 2007)
a.
References a relation
b.
references a table
c.
references its own relation
d.
references a foreign key
Answer: - C
21. A
primary key for an entity is: (Dec – 2007)
a. A candidate key
b. any
attribute
c. a
unique attribute
d. a
super key
Answer:
- C
22. Aggregate
functions in SQL are: (Dec – 2007)
a.
GREATEST, LEAST and ABS
b.
SUM, COUNT and AVG
c.
UPPER, LOWER and LENGTH
d.
SQRT, POWER and MOD
Answer: - B
23. If a relation is in 2NF and 3NF forms then: (Dec – 2007)
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
Answer: - A
24. The
end of an SQL command is denoted by: (Dec – 2007)
a.
An end-of-line character
b.
an ‘enter-key’ marker
c.
entering F4 key
d.
A semicolon (;)
Answer: - D
25. 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 ? (Dec – 2007)
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
Answer: - B
26. A
super key for an entity consists of: (June – 2008)
a.
One attribute only
b.
at least two attributes
c.
at most two attributes
d.
one or more attributes
Answer:
- D
27. Which
of the following set of keywords constitutes a mapping in SQL? (June – 2008)
a.
SELECT, FROM, TABLE
b.
SELECT, FROM, WHERE
c.
CONNECT, TABLE, CREATE
d.
SELECT, TABLE, INSERT
Answer: - B
28. If
a relation is in 2NF then: (June – 2008)
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
Answer: - B
29. Which
of the following is true? (June -2008 )
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
Answer: - B
30. 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? (June – 2008)
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.
Answer: - C
31. An
entity has: (Dec – 2008)
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
Answer: -D
32. Aggregation
is: (Dec – 2008)
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
Answer: - B
33. Suppose
R is a relation schema and F is a set of functional dependencies on R. Further,
suppose R1and R2 form a decomposition of R. Then the
decomposition is a lossless join decomposition of R provided that: (Dec – 2008)
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+
at least one from R1∩R2→R1 and R1∩R2→R2 is in F+
at least one from R1∩R2→R1 and R1∩R2→R2 is in F+
Answer: - D
34. (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
which one is correct? (June -2009)
(i)
only
(ii)
(ii) only
(iii)
(iii) only
(iv)
(iv) only
Answer:
- A
35. There
exists a construct which returns a value ‘true’ if the argument sub query is: (June
-2009)
a. Empty
b. non-empty
c. in
error
d. none
of the above
Answer:
- B
36. Which
construct in SQL is used to test whether a sub query has any tuples in its result? (June – 2009)
a. UNIQUE
b. EXISTS
c. GROUP
BY
d. EXCEPT
Answer:
- B
37. The
E-R model is expressed in term of (Dec – 2009)
I.
Entities
II.
II. The relationship among entities.
III.
III. The attributes of the entities.
IV.
IV. Functional relationship.
a.
I, II
b.
I, II, IV
c.
II, II, IV
d.
I, II, III
Answer: - D
38. Specialization
is …………… process. (Dec – 2009)
a.
Top-down
b.
bottom up
c.
both (A) and (B)
d.
none of these
Answer: - A
39. Match
the following: (Dec – 2009)
(1)
Determinants - (a)
No attribute can be added
(2) Candidate key - (b) uniquely identified a row
(3) Non-redundancy - (c) A constraint
between two attribute
(4) Functional dependency - (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
Answer: - A
40. A
function that has no partial functional dependencies is in ……………. form.
(Dec – 2009)
(Dec – 2009)
a.
3 NF
b.
2 NF
c.
4 NF
d.
BCNF
Answer: - B
41. Which
of the following statement is wrong? (Dec – 2009)
I.
2-phase locking protocol suffers from
dead lock.
II.
Time stamp protocol suffers 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
Answer: - C
42. An
entity instance is a single occurrence of a ………….. (June –
2010)
a.
Entity type
b.
relationship type
c.
entity and relationship type
d.
None of these
Answer: - A
43. Generalization
is ………… process. (June – 2010)
a. Top-down
b. bottom
up
c. both
(A) & (B)
d. None
of these
Answer:
- B
44. Match
the following: (June – 2010)
I.
2 NF - (a) transitive dependencies
eliminated
II. 3 NF - (b)
multivalued attribute removed
III. 4 NF - (c)
contain no partial functional dependencies
IV. 5 NF - (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)
Answer:
- B
45. Which
data management language component enabled the DBA to define the schema components? (June – 2010)
a.
DML
b.
Sub-schema DLL
c.
Schema DLL
d.
All of these
Answer: - C
46. The
PROJECT Command will create new table that has (June – 2010)
a.
More fields than the original table
b.
more rows than original table
c.
both (A) & (B)
d.
none of these
Answer: - D
47. In
generalization, the differences between members of an entity is (Dec –
2010)
a.
Maximized
b.
Minimized
c.
both (A) & (B)
d.
None of these
Answer: - A
48. The
dependency preservation decomposition is a property to decompose database
schema D, in which each functional dependency X®Y specified in F, (Dec –
2010)
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
Answer: - C
49. 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? (Dec – 2010)
a.
Authorization
b.
Authentication
c.
Access Control
d.
All of these
Answer: - C
