6 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 10
Correct 4
Incorrect 3
Viewed 3

Answers

Guest
Guest
Raghuveer Dhakad
Raghuveer Dhakad - 3 years ago

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

purushotham
purushotham - 3 years ago

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

Nazia Sayed
Nazia Sayed - 3 years ago

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

Sayed badruzama
Sayed badruzama - 3 years ago

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

Tilkamanjhi Sarai
Tilkamanjhi Sarai - 3 years ago

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

Related Questions

Which of the following mode declaration is used in C++ to open a file for input ?

  • [A] ios : : app
  • [B] in : : ios
  • [C] ios : : file
  • [D] ios : : in

The 'C' language is

  • [A] Context free language
  • [B] Context sensitive language
  • [C] Regular language
  • [D] None of the above

The Power Set of the set {Ø}

  • [A] �?
  • [B] { �?, {�?}}
  • [C] {0}
  • [D] {o, �?,{�?}}

Basis path testing falls under

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