Start learning →

SSC CGL Indexing, Address Matching, Date and City Matching — practice questions

Explore 57 free Indexing, Address Matching, Date and City Matching questions in SSC CGL Reasoning. Open each question or exercise to read its content, reference answers and available explanation.

Practise Indexing, Address Matching, Date and City Matching with Quill →

Indexing, Address Matching, Date and City Matching questions and exercises with answers

Showing questions 1–30 of 57.

What is the main benefit of adding an index to a database column?Read the answer and worked solution →Searching N items with no index takes how many operations on average?Read the answer and worked solution →Many index designs give which kind of lookup time?Read the answer and worked solution →How many clustered indexes can one database relation have?Read the answer and worked solution →The leaf level of a non-clustered index holds what?Read the answer and worked solution →In a non-clustered index, how does row order relate to index order?Read the answer and worked solution →Which index type reorders the stored rows to match the index?Read the answer and worked solution →A bitmap index suits a column whose values do what?Read the answer and worked solution →Which index keeps one entry per block rather than per record?Read the answer and worked solution →A reverse-key index stores the key 24538 as which value?Read the answer and worked solution →Reverse-key indexes are especially useful for which kind of data?Read the answer and worked solution →An inverted index maps which item to which?Read the answer and worked solution →A secondary index covers fields that are which kind?Read the answer and worked solution →An index declared as what creates an implicit no-duplicates constraint?Read the answer and worked solution →Database systems usually auto-create an index on columns declared as what?Read the answer and worked solution →A phone book is ordered by city, then surname. Which lookup is easy?Read the answer and worked solution →An index on city, surname, first name is searched by city and first name. Which field narrows it?Read the answer and worked solution →A leading wildcard defeats an index because indexes assume text runs which way?Read the answer and worked solution →An index is best described as a copy of what?Read the answer and worked solution →An index built on upper(last_name) stores what?Read the answer and worked solution →In a book index, headings are paired with which kind of pointer?Read the answer and worked solution →The Latin word index originally meant what?Read the answer and worked solution →Where is a back-of-book index usually placed?Read the answer and worked solution →Index headings are phrased so they can be found in what order?Read the answer and worked solution →'Felidae. See Cats' and 'Cats. See Felidae' show which indexing fault?Read the answer and worked solution →Which fault is indexing a passing remark about a person under that name?Read the answer and worked solution →Entering 'processors, word' for 'word processors' is which fault?Read the answer and worked solution →Good indexing suggests how many entries for each topic?Read the answer and worked solution →When does an embedded index save the most time?Read the answer and worked solution →In a library catalog index, the pointers are which items?Read the answer and worked solution →

Worked practice questions

What is the main benefit of adding an index to a database column?

  1. Automatic data backup
  2. Faster data writing
  3. Lower storage use
  4. Faster data retrieval
Show answer and solution

Correct answer: D. Faster data retrieval

An index lets the system locate rows quickly instead of checking each one, though it costs extra writes and storage.

Open this question →

Searching N items with no index takes how many operations on average?

  1. O(N squared) time
  2. O(1) constant time
  3. O(log N) time
  4. O(N) linear time
Show answer and solution

Correct answer: D. O(N) linear time

Without an index every item may have to be examined, so the average cost grows in direct proportion to N.

Open this question →

Many index designs give which kind of lookup time?

  1. Logarithmic
  2. Exponential
  3. Quadratic
  4. Factorial
Show answer and solution

Correct answer: A. Logarithmic

Tree-based index designs halve the search range at each step, which gives logarithmic lookup time.

Open this question →

How to practise

  1. Choose a Indexing, Address Matching, Date and City Matching question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

More Reasoning topics

Coding DecodingVenn DiagramsNumber SeriesDistance and DirectionAnalogiesAnalogyBlood RelationsNumber Series, Coding and Decoding and Odd Man Out