Mathematics · Geometric Progression
A database system uses a log-structured merge tree (LSM tree) with 4 levels (Level 0, Level 1, Level 2, and Level 3). If Level 0 can hold 100 entries and each subsequent level has a capacity 10 times larger than the previous level, what is the total capacity across all 4 levels?
- 11,11,000
- 21,11,100✓
- 31,00,000
- 41,10,000
Correct answer
1,11,100
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Geometric Progression?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Geometric Progression