Data Structures and Algorithms - Design Techniques

1. The algorithm design technique used in the quick sort algorithm is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


2. A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is

  • Option : A
  • Explanation :
    If new record hashes onto one of the six locations 7, 8, 9, 10, 1 or 2, the location 2 will receive a new record. the probability is 6/10 (as 10 is total possible number of locations).
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


3. Consider a hashing function that resolves collision by quadratic probing. Assume the address space is indexed from 1 to 8. if a collision occurs at position 4, then the location will never be probed is?

  • Option : D
  • Explanation :
    We can verify that the 1st, 3rd, 5th, 7th ... probes check at location 5.
    2nd, 6th, 10th ... probes check at location 8.
    4nd, 8th, 12th ... probes check at location 4.
    Rest of the address space will never be probed.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


4. A hash table has space for 100 records. Then the probability of collision before the table is 10% full, is?

  • Option : A
  • Explanation :
    If there is only one record, then
    Probability of collision = 1/100

    If there are two records,
    then Probability of collision = 2/100

    and if there are 9 records,
    then Probability of collision = 9/100.
    ∴ Required probability =
    = 0.45
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


5. Which one of the following statements is false?

  • Option : B
  • Explanation :
    BFS and DFS both algorithm are used to find connected component of graph in linear time.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


  • Algorithms Questions can be used to give quizzes by any candidate who is preparing for UGC NET Computer Science
  • This Algorithms Questions section will help you test your analytical skills in a tricky method, thereby giving you an edge over other students
  • Any student who wants to prepare for DOEACC A Level, DOEACC B Level, and DOEACC C level can also use these Objective Type Questions Answer.
  • All candidates who have to appear for the Kendriya Vidyalaya Entrance exam can also refer to this mcq section.
  • You can also get access to the Algorithms MCQ ebook.
  • Algorithms Questions can be used in the preparation of JRF, CSIR, and various other exams.
  • You can also download pdf for these Algorithms multiple-choice questions Answers.
  • This Algorithms Multiple Choice Questions Answers section can also be used for the preparation of various competitive exams like UGC NET, GATE, PSU, IES, and many more.
  • Algorithms Questions can be used to gain a credit score in various undergraduate and postgraduate courses like BSc, MSc and MCA
  • Algorithms Questions for UGC NET Computer Science

    Algorithms MCQ

    Algorithms Multiple choice questions