UGC NET · PAPER 2
UGC NET Paper 2 Computer Science – Unit 4: Database Management Systems PYQ (December 2023)
Q13. "CREATE TABLE T" in SQL is an example of:
- Normalization
- DML
- DDL
- Primary key
Q49. Which of the following statements are CORRECT?
(A) Granularity is the size of data items in a database.
(B) Two operations in a schedule are said to be in conflict if they belong to the same transaction.
(C) Two schedules are said to be conflict equivalent if the order of any two conflicting operations is the same in both schedules.
(D) Write operations that are performed without performing the write operation are known as blind writes.
Choose the correct answer from the options given below:
(A) Granularity is the size of data items in a database.
(B) Two operations in a schedule are said to be in conflict if they belong to the same transaction.
(C) Two schedules are said to be conflict equivalent if the order of any two conflicting operations is the same in both schedules.
(D) Write operations that are performed without performing the write operation are known as blind writes.
Choose the correct answer from the options given below:
- (A) and (B) Only
- (A), (B) and (C) Only
- (A), (B) and (D) Only
- (B) and (C) Only
Q50. Which of the following statements is/are NOT CORRECT?
(A) The first record in each block of the data file is known as the actor record.
(B) A dense index has index entries for every search-key value in the data file.
(C) Searching is harder in a B+ tree than in a B-tree as all external nodes are linked to each other.
(D) In extendible hashing, the size of the directory is 2^(d−1), where d is the global depth.
Choose the correct answer from the options given below:
(A) The first record in each block of the data file is known as the actor record.
(B) A dense index has index entries for every search-key value in the data file.
(C) Searching is harder in a B+ tree than in a B-tree as all external nodes are linked to each other.
(D) In extendible hashing, the size of the directory is 2^(d−1), where d is the global depth.
Choose the correct answer from the options given below:
- (A), (B) and (C) Only
- (A), (C) and (D) Only
- (A), (B) and (D) Only
- (A), (B), (C) and (D) Only
Q69. Match List I with List II
| List I | List II |
|---|---|
| (a) BCNF iff | (I) every JD is implied by the candidate keys |
| (b) 5NF iff | (II) all underlying domains contain scalar values only |
| (c) 1NF iff | (III) every MVD is implied by the candidate keys |
| (d) 4NF iff | (IV) every FD is implied by the candidate keys |
- (a)-(III), (b)-(II), (c)-(I), (d)-(IV)
- (a)-(IV), (b)-(I), (c)-(II), (d)-(III)
- (a)-(II), (b)-(III), (c)-(IV), (d)-(I)
- (a)-(IV), (b)-(I), (c)-(III), (d)-(II)
Directions (Q96–100): Consider the relations X(S, Si, C) and Y(S, P, D):
| X | ||
|---|---|---|
| S | Si | C |
| J | 1 | M |
| B | 2 | N |
| R | 3 | H |
| T | 4 | G |
| Y | ||
|---|---|---|
| S | P | D |
| J | S1 | CA |
| B | P1 | AB |
| R | D1 | DC |
| A | H1 | MD |
Q96. Find the number of tuples obtained by applying the operation X ⟕X.S = Y.S Y (left outer join).
- 1
- 3
- 4
- 6
Q97. The result of the operation X ⟖X.S = Y.S Y (right outer join) will be:
S Si C P D J 1 M S1 CA B 2 N P1 AB R 3 H D1 DC T 4 G NULL NULL
S Si C P D J 1 M S1 CA B 2 N P1 AB R 3 H D1 DC A NULL NULL H1 MD
S Si C P D J 1 M S1 CA B 2 N P1 AB R 3 H D1 DC T 4 G NULL MD
- None of these
Q98. Which join is used to get all the tuples of relations X and Y, with NULL values for the corresponding missing values?
- Left outer join
- Right outer join
- Natural join
- Full outer join
Q99. The number of tuples obtained by applying a right outer join on relations X and Y is:
- 16
- 5
- 3
- 4
Q100. The number of tuples obtained by applying the Cartesian product over X and Y is:
- 16
- 12
- 04
- 32