Question

THE STATE
10S
derigating trees and fields
an escere turn the Babur Nama that describes the
Destions the emperoroorved in northern lodia:
a great paban cocery stored on level and
this cous and canned Sards are, it nowhere
For cinc at a necessity m
cro and orchind Auman crops grow by the
therans themselves and strangen is that song
on nomains however to young trees
de tow by means of trackets or wheels
in Lahore Dip (both in present day Pakistan and those
pat people water by means of a wheel. They make tso
Ses od rope long enough suit the depths of the well fix
series of 003 beracun them, and on these tasten pitchers
Thereth the wood and attached pachers are put over
be one end of the wheel ade a second heel is
dose so another on an uprigrale. The last wheel
ock turns useeth catch in the teeth of the second
arid thus the wheel with the pitchers is turned. A
chosser where the water empties from the pitchers and
Som this the water is conveyed everywhere.
in Asra, Chandu az, Bayanaan present day Unar Pradesh)
At the
and those parts again, people water with a bucket
03-edge they set up a fork of wood having a roller adjusted
era cen the lasts be a rope to a large bucket, put the rupe
ra rober, and be its other end to the bullock One person
must drive the bullock another empty the bucket
Compare the
Irrigation devices
observed by Bastar with
what you have learnt
about itigation in
Vijayanagara
(Chapter 7). What kind
of resources would each
of these systems
require? Which systems
could ensure the
participation of peases
In improwing
agricultural technology?
Ha 8.2
A reconstructed Persian
theel described here​

Answer 1

Answer:

The order of a leaf node in a tree B+ ? is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?

(A) 63

(B) 64

(C) 67

(D) 68

Answer: (A)

Explanation:

Disk Block size = 1024 bytes

Data Record Pointer size, r = 7 bytes

Value size, V = 9 bytes

Disk Block ptr, P = 6 bytes

Let order of leaf be m. A leaf node in B+ tree contains at most m record pointers, at most m values, and one disk block pointer.

r*m + V*m + p <= 1024

16m <= 1018

m =< 63