In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:
The number of blocks used for index and the size of index
Size of Blocks and size of Address
Size of index
Size of Block
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Deadlocks situation occurs only when one of the transactions wants to obtain a(n) ____ lock on a data item.
Binary
Exclusive
Shared
Compatible
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A clustering index is defined on the fields which are of type
non-key and ordering
non-key and non-ordering
key and ordering
key and non-ordering
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which one is true about clustered index?
Clustered index is not associated with table
Clustered index is built on physically ordered non-key columns
Clustered index is not built on unique key columns
None of the mentioned
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which of the following statement(s) about indexing is/are CORRECT?

S1: Indexing is used to optimize the performance of a database by minimizing the number of disk accesses required when a query is processed.

S2: Indexing is used to locate and access the data in a database table quickly.

Only S1
Only S2
Both S1 and S2
Neither S1 nor S2
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Identify the CORRECT statements about the normalization process.

I. Reduces number of tables

II. Reduces database size

III. Reduces data constraints

IV. Reduces chances of data anomalies

Only II
I, II and IV
II and III
II and IV
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the relation R(A, B, C, D, E, F, G, H, I, J) and the set of functional dependencies

F = {{A,B}⟶{C}, {A}⟶{D,F}, {B}⟶{F}, {F}⟶{G,H}, {D}⟶{I,J}}

What is the key for R?

AB
BC
CD
EF
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider a table R(ABCDE) with the following functional dependencies:

A->C, B->D, AB->E. In terms of Normalization, this table is in

1 NF
2 NF
3 NF
None
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the relation R (ABCDE) and functional dependencies set {A → B, B → C, C → D, D → E}. What is the highest normal form of R?
1 NF
2 NF
3 NF
BCNF
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the relation scheme R(A, B, C, D) along with the set of functional dependencies F = {AB → C, AB → D, C → A, D → B}. Which of the following is not a candidate key of R?
AB
AC
AD
CD
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which aggregate function is used to count the number of rows in an SQL query?
COUNT()
COUNT(DISTINCT)
COUNT(UNIQUE)
COUNT(*)
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the two relations below in which primary keys are underlined. Identify all possible foreign key(s) from the options based on the two relations.

R(A, B, C)

S(B,C)

A
C
A,C
A,B,C
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A database indexes
Increases database size
Decreases database size
Doesn’t affect database size
Impacts database size differently in different cases
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
All rows correspond to students whose rollnum’s are between 20 and 30.

(i) SELECT * FROM Student WHERE rollnum are between 20 and 30;

(ii) SELECT * FROM Student WHERE rollnum IN(20,30)

Only (i)
Only (ii)
Both (i) and (ii)
None
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the following ‘Project’ table:

Pname

Pnumber

Plocation

dnum

A

B

C

BCT

Bitcoin

Ethereum

1

2

3

4

5

6

Mumbai

Delhi

Hyd

Chennai

Hyd

Chennai

5

5

5

4

1

4

Identify the CORRECT query for the following output?

Pname

BCT

Ethereum

SELECT Pname FROM TABLE Project WHERE dnum=4;
SELECT Pname FROM Project FOR dnum=4;
SELECT Pname FROM TABLE Project FOR dnum=4;
SELECT Pname FROM Project WHERE dnum=4;
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66