Question 4882 – UGC NET CS 2018-DEC Paper-2
November 5, 2023NTA UGC NET JUNE-2023 Paper-2
November 5, 2023NTA UGC NET JUNE-2023 Paper-2
| Question 2 |
The total cost of retrieving records in sorted order using an unclustered B+ tree is
(P-Average number of records per data page
N-Data pages
F-Ratio of the size of a data entry to the size of a data record)
(P-Average number of records per data page
N-Data pages
F-Ratio of the size of a data entry to the size of a data record)
| (F*N)+P | |
| (F+P)*N
| |
| F*N*P
| |
| F+P/N |
Question 2 Explanation:
The total cost of retrieving records in sorted order using an unclustered B+ tree is given by:
(F + P) * N
Where:
F is the ratio of the size of a data entry to the size of a data record.
P is the average number of records per data page.
N is the number of data pages.
So, the correct answer is (F + P) * N.
Correct Answer: B
Question 2 Explanation:
The total cost of retrieving records in sorted order using an unclustered B+ tree is given by:
(F + P) * N
Where:
F is the ratio of the size of a data entry to the size of a data record.
P is the average number of records per data page.
N is the number of data pages.
So, the correct answer is (F + P) * N.
Subscribe
Login
0 Comments