Start learning →

Many index designs give which kind of lookup time?

ALogarithmic
BExponential
CQuadratic
DFactorial
Answer & Solution
Correct answer: A. Logarithmic
Tree-based index designs halve the search range at each step, which gives logarithmic lookup time.
Practise this question with Quill — SSC CGL →

Keep practising Indexing, Address Matching, Date and City Matching

Browse all Indexing, Address Matching, Date and City Matching questions for SSC CGL, or explore more Reasoning topics.

Start a Indexing, Address Matching, Date and City Matching lesson →
Related questions