Question 4882 – UGC NET CS 2018-DEC Paper-2
November 5, 2023
Question 17079 – NTA UGC NET JUNE-2023 Paper-2
November 5, 2023
Question 4882 – UGC NET CS 2018-DEC Paper-2
November 5, 2023
Question 17079 – NTA UGC NET JUNE-2023 Paper-2
November 5, 2023

Question 17077 – NTA UGC NET JUNE-2023 Paper-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)

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.

A
(F*N)+P

B
(F+P)*N
C
F*N*P
D
F+P/N
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!