DBMS Gate2010

1:30 hrs
DBMS TEST -- 3
NAME OF STUDENT REG.NO
BY :- GIRIRAJ SHARMA
QUALIFIED IN := { THREE TIMES GATE 99.6%ILE, THREE TIMES DRDO, TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }
CAREER MAKER ( GATE + PSU's + CDAC )

ADDRESS:- CITY CENTER GWALIOR (M.P.) 474011
Email :-career.maker@yahoo.com
CAREER MAKER
1
DBMS TEST PAPER (GATE +PSU )
Choose the symbol that corresponds to a discriminator attribute. (a) (b) attribute attribute
(c)
2.
attribute
(d)
attribute
Which one of the following four E-R diagrams is the typical result you obtain when you initially start with an E-R diagram containing just two entities, A and C, in a Many-toMany relationship, and then introduce an associative entity (B). (1) (2) (3) (4) A 1 1 B 1 1 C
A A A
1 M M M
M 1 M
B B B
M 1 M
1 M M
C C C
3.
Which of the following design elements does not require an entire table to implement? (a) A Many-to-Many relationship (b) A weak entity (c) An identifying relationship (d) A multi-valued attribute Which of the following most certainly implies the need for an entire table to implement? (a) A binary relationship (b) A ternary relationship (c) A recursive relationship (d) An identifying relationship
What is the highest normal form level satisfied by the following table design? A. 1NF B. 2NF C. 3NF
4.
5.
A1
A2
A3
A4
A5
D. BCNF
CAREER MAKER ( GATE + PSU's + CDAC ) BY GIRIRAJ SHARMA QUALIFIED IN { THREE TIMES GATE 99.6%ILE, THREE TIMES DRDO,
email:- career.maker@yahoo.com
TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }
CAREER MAKER
6.
Consider two tables: Album and Song, that are related by a 1-to-Many relationship. Given this type of relationship, in which table should the corresponding foreign key be placed? A) Foreign key needed only in Album table B) Foreign key needed only in Song table C) Foreign key needed in both tables D) Composite entity must be added, and then foreign keys will be required in both the Album and Song tables E) No foreign keys should be used. Consider the following table design, with its associated functional dependencies (shown with arrows). The tables primary key is underlined.
7.
A1
A2
A3
A4
A5
D. BCNF 8.
Consider the following table design, with its associated functional dependencies (shown with arrows). The tables primary key is underlined.
A1
A2
A3
A4
A5
D. BCNF 9.
What is the highest normal form level (1NF, 2NF, or 3NF) satisfied by the following table? Given key information: the pair (A1,A3) is a composite primary key
A. 1NF B. 2NF C. 3NF
A1
A2
A3
A4
A5
D. BCNF 10.
What is the highest normal form level (1NF, 2NF, or 3NF) satisfied by the following table? Given key information: the pair (A1,A3) is a composite primary key.
A1
A2
A3
A4
A5
D. BCNF
CAREER MAKER
11.
You are given a relational table scheme that has 3 attributes. At most how many candidate keys can that table have? b) 2 a) 1 c) 3 d) 4 f) 6 e) 5
12.
What normal form (1st, 2nd, 3rd?) is each of the following table designs in?
D. BCNF 13.
What normal form 1st 2nd 3rd? is each of the followin table designs in?
D. BCNF 14.
What normal form 1st 2nd 3rd? is each of the followin table desig ns in?
D. BCNF 15.
D. BCNF 16.
D. BCNF 17.
= 8 " 8 6 6 8L 6 6 " " 6 6 1 & ( , 8 8 $ % " 6 %
CAREER MAKER
18. (A) non-key and ordering (C) key and ordering
A clustering index is defined on the fields which are of type (B) non-key and non-ordering (D) key and non-ordering
,+
19.
/ ? > 1 ! # 3: 9
) ) 3 9 !"# 3,
20.
# ) : 4
9 !$ 3. #
! 4 P 9 4 ?) !% 3< #
M7 1 9 9 ? & <
* , * % 1 % 1 * % 1 1 1*
1 1 T < =
%
&
= & > B
21.
>
# + %# + # + * + #
22.
* ) "( $ "( . ) "( $ "( & )

0 ( . B ! & 0 ! 0 E C # 8 7. 5 6 &&
%2 / % ' ' * (* * ' * % * % 1 ! ! % * % 1 % * % 1 ) ! ! % * % 1 % * % 1 ) ( (
2 )& - &, & $F &$F &

0 4 J 4 . # ( , % 0 ) E 5 6 &
! % *( *( * ! ! ) ( *( * 7 7 - '#(#) # 2 % * % 1 ! % % 1 4 )
&$:
& - &, &

7 J 7 J # E 7 . , +,( , ( ,0 7 0 C 0 0 . 0 5'6 &
%* N
$F
&
( ( + . 7
23.
, +,( 2 ( , 5 6 &
24.
!
CAREER MAKER
25.
5 . , 6 1 # /( '

= 9 6 99 (
' (
' (
9 ' 9 6 9 ( 7 8 ' ' . 7 8 G ,. ' / 7'8 / 1 E
26.
: 7 8
27.
# F " 6 8$ >8 8' >8' > ' $ $
6@ >$ >
$>$ $ $8$' $ 8 $
G 8$ >8$ 8 8'
8' >8' $ $
28.
*! * *$ * % % *$ * , 1$ ! $ 1$ !
- '#(#)#+ !& / !& / !& / *$ * 1$ !
* - '( *% % 1$ ! % % * ,
% $ * * *- )+ !& / , , % %
'
*)
*
29.
*$ *
Consider the following relational schemes for a library database:
Book
( Title, Author, Catalog_ no, Publisher, Year, Pr ice ) Collection ( Title, Author, Catalog_ no )
with in the I. II. III. following functional dependencies: Title Author Catalog_no Catalog_no Title Author Publisher Year Publisher Title Year Pr ice
Assume {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 is in 3NF (D) Both Book and Collection are in 2NF only
30.
) *
!"# " 9 !$ " # ! # ") !% " ) # 9? 9 9 9
$5 8 9 ) ) &5 8 ?9 ?9 ,5 8 $5 8
CAREER MAKER
31.
> BJ = = " $ $
* $ * $ $

J =*8
&BJ " " % % > BJ

* * * / % $ * * # # *! % / ! %*$ * # K % () # 1 ! * % 7 # 1 " 2 # 2 %2 / % " / ! ** * * $ 9 ' % ! * !& B * 7 .@ " < ( / .@ " . &. 3( & & & & % * / < < . . @ 3 5 3 &5 ,
&BJ > BJ
" "
32.
-% . * 2 K !
2 % * & % % 1$ ! * /+ 3 5
+$ * ()
33.
% & & "( "(
&
"( 3 "( &
34.
9 + % & % & + . + + +
5 . ' , + + + 6 . . . 1 9 9 '
*% + 1
& +
+ +
. G . 9 ( 9 ( 9 9 / I / , (
% & % &
'( / 9 ( . . .
+ .
(
35.
, 7 8 7 8 7 8 7'8
9 . 6 9
36.
! !& !"# $ !$ ! # ! # ! !% $ #
! " ( %) Q (() Q& ( %) Q& (() Q & (() Q
( %) Q& ( %) Q& (() Q & (() Q (() Q

!& > > !& !& >
( %) ( %)
> >
!&
>
CAREER MAKER
37.
Consider two transactions T1 and T2, and four schedules S1, S2, S3, S4 of T1 and T2 as given below:
T1 : R1 x W1 x W1 y T2 : R2 x R 2 y W2 y S1 : R1 x R 2 x R2 y W1 x W1 y W2 y S2 : R1 x R2 x R2 y W1 x W2 y W1 y S3 : R1 x W1 x R2 x W1 y R2 y W2 y S4 : R2 x R2 y R1 x W1 x W1 y W2 y
Which of the above schedules are conflict-serializable? (A) S1 and S2

38.
(B) S2 and S3
? ? * & ) )* ? / 0 &) & H% H% H% H% ? ? * )0
(C) S3 only
& I) $ 3 G )
(D) S4 only
G ' ? ( ? ? ) ?
? ? ? * 0 ? 0 ? ? ? 0 *
39.
9 0 5 6 $ 5'6 $
2 >
. 2 5 6 0 2 4 5 6 < 4 ,
40.
Which of the following statements is false about the relationship s in the ER model? (A) A relationship can involve more than two entities. (B) A relationship can have no attributes. (C) A relationship can involve only one entity. (D) A relationship can have no participant entities. Which of the following is true about the weak entity in the ER model? (A) (B) (C) (D) A weak entity has a key. A weak entity must involve an existence dependency. An existence dependency must involve a weak entity. identified with its own attributes. A weak entity can be uniquely
41.
CAREER MAKER
42.
Which of the following is the main characteristic of left outer join? (A) (B) (C) (D) Keeping all the tuples of the left join table. Keeping all the tuples of the right join table. Allowing repeated attributes in the result. Comparing tuples with conditions other than equality
Consider the following ER diagram
ID_acc
balance
ID
name
name
limit
account
belongs
main card holder
affiliate
dependent
address
limit
aff_date
43.
The minimum no of tables needed to represent above ER-Diagram

(A) 2 (B) 3 (C) 4 (D) 5
44.
Which of the following is a correct attribute s et for one of the tables for the correct answer to the above question? (A) { name, limit } (B) { name, limit, ID } (C) { name, limit, ID, aff_date } (D) none
45.
What is thr candidate key of given FD diagram ? (A) { V, W } (B) { V,W,Z } (C) {W,Z } (D) { V, Z }
46.
BCNF decomposition of above question are contains following tables? (A) (V, X) (A, B, C) (A, B, C) (A, B, C) (A, B, C) (V, W, Z, A) (V, W, Z, A) (V, W, Z, A) (V, W, Z, A) (V, W, Y) (V, W, Y) (V, W, Y)
(B) (V, X) (C) (V, X) (D) (V, X)
CAREER MAKER
47. Concider the following SQL queries
Q1: SELECT DISTINCT E.eid FROM Emp E, Works W, Dept D WHERE E.eid = W.eid AND W.did = D.did AND D.budget = 100000 Q2: SELECT DISTINCT E.eid FROM Emp E, Works W, Dept D1, Dept D2 WHERE E.eid = W.eid AND W.did = D1.did AND W.did = D2.did D1.budget > 50000 AND D2.budget < 200000
State which of the following holds, and briey explain your answer:
(A) Q 1 Q 2 (B) Q 2 Q 1 (C) Q 1 ,Q 2 are equivalent (D) None 48. For R(A,B,C,D,) and functional dependencies AB C , AB D, C A, D B the relation is in ? (A) 2NF 49. (B) 3NF (C) BCNF (D) 1NF
For R(A,B,C,D,E) and functional dependencies A BC , BC E , and E D A The redundancies possible in this relation due to FD's
? ! D ! ; $! ! * * ! 6 ! % 6
I
50.
Concider a B+ tree where each node can hold at most 4 pointers and 3 keys when
the following keys are inserted in the following order: 1, 10, 2, 11, 3, 4, 8, 5, 7, 6
the no of level in the resulting tree ? (A) 2 (B) 3 (C) 4 (D) 5

DBMS Gate2010

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

DBMS Gate2010

Hochgeladen von

Copyright:

Verfügbare Formate

1:30 hrs

NAME OF STUDENT REG.NO

CAREER MAKER ( GATE + PSU's + CDAC )

DBMS TEST PAPER (GATE +PSU )

TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }

DBMS TEST PAPER (GATE +PSU )

TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }

DBMS TEST PAPER (GATE +PSU )

TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }

DBMS TEST PAPER (GATE +PSU )

* ) "( $ "( . ) "( $ "( & )

2 )& - &, & $F &$F &

& - &, &

TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }

DBMS TEST PAPER (GATE +PSU )

- '#(#)#+ !& / !& / !& / *$ * 1$ !

Consider the following relational schemes for a library database:

!"# " 9 !$ " # ! # ") !% " ) # 9? 9 9 9

TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }

DBMS TEST PAPER (GATE +PSU )

&BJ " " % % > BJ

% & & "( "(

"( 3 "( &

! " ( %) Q (() Q& ( %) Q& (() Q & (() Q

( %) Q& ( %) Q& (() Q & (() Q (() Q

TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }

DBMS TEST PAPER (GATE +PSU )

Which of the above schedules are conflict-serializable? (A) S1 and S2

DBMS TEST PAPER (GATE +PSU )

main card holder

The minimum no of tables needed to represent above ER-Diagram

(B) (V, X) (C) (V, X) (D) (V, X)

TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }

DBMS TEST PAPER (GATE +PSU )

the no of level in the resulting tree ? (A) 2 (B) 3 (C) 4 (D) 5

TWO TIMES IN HAL, ONE TIMES IN,NTPC,MTNL,JTO,SAIL, etc }

Das könnte Ihnen auch gefallen

- '#(#)#+ !& / !& / !& / $ 1$ !