5 years ago in UGC CS - December 2012

The maximum number of keys stored in a B-tree of order m and depth d is

[A] md + 1 �?? 1
[B] md+1 �?? 1 / m �?? 1
[C] (m �?? 1) (md + 1 �?? 1)
[D] md �?? 1 / m �?? 1
Loading...
Next Question

Overall Stats

Attempted 9
Correct 4
Incorrect 3
Viewed 2

Answers

Guest
Guest
Raghuveer Dhakad
Raghuveer Dhakad - 2 years ago

Raghuveer Dhakad from Delhi, India is saying md + 1 �?? 1 is correct answer

purushotham
purushotham - 2 years ago

purushotham from India is saying (m �?? 1) (md + 1 �?? 1) is correct answer

Nazia Sayed
Nazia Sayed - 2 years ago

Nazia Sayed from Mumbai, India is saying md + 1 �?? 1 is correct answer

Sayed badruzama
Sayed badruzama - 2 years ago

Sayed badruzama from Mumbai, India is saying md + 1 �?? 1 is correct answer

Tilkamanjhi Sarai
Tilkamanjhi Sarai - 2 years ago

Tilkamanjhi Sarai from Pune, India is saying md+1 �?? 1 / m �?? 1 is correct answer

Related Questions

RAD stands for ______.

  • [A] Rapid and Design
  • [B] Rapid Aided Development
  • [C] Rapid Application Development
  • [D] Rapid Application Design

Basis path testing falls under

  • [A] system testing
  • [B] white box testing
  • [C] black box testing
  • [D] unit testing

Which of the following memory allocation scheme suffers from external fragmentation ?

  • [A] Segmentation
  • [B] Pure demand paging
  • [C] Swapping
  • [D] Paging

Which API is used to draw a circle ?

  • [A] Circle ( )
  • [B] Ellipse ( )
  • [C] Round Rect ( )
  • [D] Pie ( )