Course Name: Database Management System

Assignment 5 - Week 5 (Jan 2025)

Number of questions: 10 Total mark: 10 X 2 = 20

Question 1
Which of the followings can be the solution(s) of Password Leakage in Database Servers?

a) Storing encrypted passwords in database and in scripts.

b) Reusing passwords across different sites.

c) Single factor authentication using passwords.

d) Two-factor authentication (password plus one-time password sent by SMS).

Answer: a), d)
Explanation: Refer to lecture slide 22.

1
Question 2
Which of the following statement(s) is/are incorrect?

a) Javascript is a Client-Side Scripting language.

b) World Wide Web is a language used for designing web pages.

c) Hyper Text Transfer Protocol is a connection-oriented protocol.

d) J2EE platform supports parallel processing.

Answer: b), c)
Explanation: World Wide Web is distributed information system based on hypertext. Hyper Text
Transfer Protocol is connectionless. So, these two options are wrong.
Refer to Module 21.
So, options b) and c) are the answer.

2
Question 3
Consider the following table DEFAULTER (ID, NAME, AMOUNT). If we want to create an index
on DID column, which type of indexing will be preferred?

DEFAULTER
DID NAME AMOUNT
415 AISHA 20000
124 JOHN 5000
347 EDWARD 100
145 RAY 200
209 AKASH 900

a) Sparse index

b) Secondary index

c) Dense index

d) Clustering index

Answer: c)
Explanation: When the file is not sorted on the indexed field or when the index file is small,
compared to the size of the memory, it is preferable to use dense indexing. The above table has only
5 records and DID field is not in sorted order.
Hence, option c) is correct.

3
Question 4
A magnetic disk has 16 platter surfaces, 256 tracks per surface, 512 sectors per track, and 1024 bytes
per sector. How many number of bits will be required to address a sector?

a) 17

b) 21

c) 27

d) 31

Answer: b)
Explanation: Number of platter surfaces = 16
Number of tracks per surface = 256
Number of sectors per track = 512
Therefore, total number of sectors
= Total number of platter surfaces x Number of tracks per surface x Number of sectors per track
= 16 x 256 x 512 sectors
= 24+8+9 sectors
=221
So, Number of required bits to address the sector = 21 bits
Hence, option b) is correct.

4
Question 5
Availability of Redundant Arrays of Independent Disks system is 97%. Mean Time Between Failure
(MTBF) is 36 days. What is the approximate Mean Time To Repair (MTTR) of the system?

a) 10.80 Hours

b) 26.72 Hours

c) 34.92 Hours

d) 88.36 Hours

Answer: b)
Explanation: Mean time between failures is the average time between failures.
Mean time between failures (MTBF) = total available time / number of failures.
Mean time to repair is the average time taken to repair the system.
Mean time to repair(MTTR)= total unavailable time /number of failures
Availability = Total available time /(total available time +total unavailable time)
M T BF
(M T BF +M T T R) = 97%
36∗24∗100
(36∗24+M T T R) = 97
36 ∗ 24 + M T T R = 36∗24∗100
97
MTTR = (36∗24∗100)−(36∗24∗97)
97 hours
MTTR = 26.72 hours
Hence, option b) is correct.

5
Question 6
In a Coding Competition, participants individually can enroll their names for the competition.
There are many groups in the competition depending on the age of the participants. A participant
can participate in only one group and a group can consist of multiple participants. Each group
has a unique name and a participant also has a unique id. The result of each group will be main-
tained separately. Which of the following statement(s) are correct?

a) Entity Group will not have any primary key.

b) Participate will be a one-to-many relationship between Group and Participants.

c) Participate will be a many-to-many relationship between Group and Participant.

d) Gname can be the foreign key of Participate relation between Group and Participant.

Answer: b), d)
Explanation: If we draw the ER diagram of it, we can see there will be a one-to-many relationship
between Group and Participant.
Gname is the primary key of the entity Group table. Hence, can be the foreign key of Participate
relation between Group and Participant.

So, options b) and d) are the answer.

6
Question 7
A flash storage system uses the size of a page 4 KB and 32-bit page-address for its operation. More-
over, the flash translation table is stored as an array. If the size of the flash memory is 64 GB, what
will be the size of the flash translation table?

a) 64 MB

b) 32 MB

c) 24 MB

d) 16 MB

Answer: a)
Explanation: Size of the flash memory = 64 GB = 64 x 230 bytes
Size of a page = 4 KB = 4 x 210 bytes
30
Number of pages = 64×24×210
= 16 x 220
Size of page address = 32 bits = 4 bytes
Therefore, the size of the flash translation table = 16 x 220 x 4 bytes = 64 MB
Hence, option a) is correct.

7
Question 8
Consider the following string of reference:

12, 25, 31, 42, 12, 25, 50, 12, 25, 31, 42, 50

Find the number of replacements (where an existing value is replaced by a new value because the
buffer is full) incurred using the least recently used (LRU) buffer replacement algorithm with 3 empty
buffer frames.

a) 12

b) 10

c) 8

d) 7

Answer: d)
Explanation:
Buffer Comments
12 12 is added to empty buffer
12 25 25 is added to empty buffer
12 25 31 31 is added to empty buffer
42 25 31 12 is least recently used. Hence, replaced by 42
42 12 31 25 is least recently used. Hence, replaced by 12
42 12 25 31 is least recently used. Hence, replaced by 25
50 12 25 42 is least recently used. Hence, replaced by 50
50 12 25 No replacement, 12 present
50 12 25 No replacement, 25 present
31 12 25 50 is replaced, as 12, 25 are recently used
31 42 25 12 is replaced, as it is least recently used element
31 42 50 25 is replaced
Hence, altogether 7 replacements have been done. So, option d) is the answer.

8
Question 9
Consider a file organization, where the size of one record is 48 bytes, the size of the disk block pointer
is 10 bytes, and the size of one disk block is 512 bytes. If organization of the file is sequential and
unspanned (one block can store only whole records), maximum how many records can be stored in
one block?

a) 12

b) 11

c) 10

d) 9

Answer: c)
Explanation: The file organization is unspanned. So, one block can store N numbers of whole
records and one block pointer.
One record size(V) = 48 bytes
Disk block size = 512 bytes
Disk block pointer (p) = 10 bytes
Actual Storage size of one block = (512-10) =502 bytes
N = 502/48 = 10
So, maximum 10 records can be stored in a block.

9
Question 10
Identify the correct statement(s) about the following RAID levels?

a) RAID 0 provides byte-level striping with mirroring.

b) RAID 1 provides disk mirroring without striping.

c) RAID 3 provides byte-level striping with dedicated parity checking.

d) RAID 5 provides Byte-level striping without parity bits.

Answer: b), c)
Explanation: RAID 0 provides block-level striping without parity or mirroring and RAID 5 provides
block-level striping with distributed parity. Therefore, these two statements are given in options a)
and d) are incorrect.
Hence, options b) and c) are the answers.

10