Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 20 published solutions
Question 2 MCQ · 3.0 marks
Consider a B-tree index to be built on the attribute **EmployeeID** of a table **Employees**, with the
following properties:
• The length of the attribute EmployeeID is 16 bytes.
• The size of each child pointer is 8 bytes.
• The size of each record pointer is 8 bytes.
• The size of each disk block is 488 bytes.
With the given information, what is the best choice for the order of the non-leaf nodes of the B-
tree?
A.
14
B.
15
C.
16
D.
17
A published solution is not available for this question yet.
Consider the table **BandRecords** as given below:
Let us create two different bitmap indices, one on the Tour attribute and the other on the Genre
attribute. Which of the following options will give the correct result if we
want to find all bands performing in **'RetroLive'** and having the genre **'Rock'**?
Note: Options are in the form of **Tour (operation) Genre**
A.
10000100 AND 00100100
B.
00000101 OR 11001001
C.
00001001 AND 11001001
D.
00001001 OR 00100100
A published solution is not available for this question yet.
Consider a relation schema **T**(A,B,C,D,E,F) and the set of functional dependencies,
**F**= {A → BC, C → D, D → C, B → E, E → F}.
This schema is decomposed into two relations **T1**(A,B,C,E) and **T2**(A,C,D,F).
Consider the following statements given below regarding the decomposition of **T1** and **T2**.
Choose the correct option(s).
A.
The decomposition of **T** into **T1** and **T2** is dependency preserving.
B.
The decomposition of **T** into **T1** and **T2** is lossless.
C.
The schema **T1** is in 2NF.
D.
The schema **T2** is in 3NF.
A published solution is not available for this question yet.
Consider the following monthly backup schedule used by a company:
If a failure occurs on the 24th day of the month after the backup for the day has been completed,
how many backup sets have to be loaded for a full recovery?
A.
10
B.
11
C.
9
D.
8
A published solution is not available for this question yet.
Choose the correct SQL query to find the names of departments where the total marks of students
is greater than the total marks in any department where the average marks
is less than 60.
A.B.C.D.
A published solution is not available for this question yet.
Consider a B+ tree index built on the key attribute of a data file having 62,50,000 records. Let the
order of the B+ tree be 50.
Find out the maximum number of nodes to be accessed to search a key from the given B+ tree.
A.
7
B.
23
C.
4
D.
5
A published solution is not available for this question yet.
Consider the given log records at an instance of time:
Suppose there is a system crash after the last log record. What will be the value of the expression
**(B-A)+(C-D)**, based on the values stored on the disk at that point?
A published solution is not available for this question yet.
Consider you have a file in your hard disk of size 900 KB. Seek time of your hard disk read head is 5
ms and rotational speed is 30,000 rpm. The disk has 250 sectors per track and 512 bytes per
sector. Considering the fact that the file data is stored in consecutive sectors, how much time will
be required to read the whole file after a read request is made? (answer in milliseconds and
calculate upto one decimal place)
A published solution is not available for this question yet.
Consider a system using the Most Recently Used (MRU) page replacement policy. The system has a
main memory buffer with 3 slots, and the page reference sequence is as follows:
2, 1, 3, 2, 4, 2, 1, 5, 2, 1, 4
Calculate the total number of page hits during this sequence.
A published solution is not available for this question yet.
Consider the following schedule S with five transactions T1, T2, T3, T4, T5:
Where, Ri(X) denotes a read operation by transaction Ti on a data item X, and Wi(X) denotes a write
operation by transaction Ti on a data item X.
What is the possible number of conflict serializable schedules of the above schedule S?
A published solution is not available for this question yet.
Consider the relation **R**(A, B, C, D, E, F) and the following functional dependencies set
F = {AB → C, C → D, D → E, E → F}
Find the total number of super keys of **R**.
A published solution is not available for this question yet.