Opening the paper…

Database Management Systems, End Term

January 2024 term, 28 Apr 2024, Set QDB1

Learning mode

Question 1

+2−0Single correct

Select one option

A.
1
B.
2
C.
3
D.
4

Report a problem

to report a problem with this question.

Choose a question

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 19

Discussion

Submit this paper?

You cannot change your answers after submitting.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 2

Instructions

The palette shows the status of every question. Pick a number to go straight to it.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 2

Save & Next moves to the next question. Answers are saved as you go.
Mark for Review & Next flags the question to come back to. A flagged answer still counts.
Clear Response removes your answer to the question on screen.
The ← and → keys move to the previous and next question.

Figure from the original question paper Let us consider the following statistics for searching a condition within a given relation. - Number of blocks containing record of the relation $(b) = 400$ - Time to transfer one block $(t_b) = 0.6$ milliseconds - Time for one seek $(t_s) = 8$ milliseconds What will be the average cost of **selection query** on a **key attribute** using linear search file scan? Consider the relational schema: **prescription**(*doctor_id*, *doctor_name*, *patient_id*, *patient_name*, *medicine_id*, *medicine_name*), where the domains of all the attributes consist of atomic values. Consider the following FDs for the relation **prescription** . - $doctor\_id \rightarrow doctor\_name$, - $patient\_id \rightarrow patient\_name$, - $medicine\_id \rightarrow medicine\_name$, - $doctor\_id \rightarrow\rightarrow patient\_id$, - $doctor\_id \rightarrow\rightarrow medicine\_id$ From among the decompositions given, identify the one that is in 4NF.