searching mcq | searching mcq questions | searching mcq in data structure

searching mcq,searching mcq questions,searching mcq in data structure,searching mcq with answers pdf,searching mcq with answers,searching mcq pdf,binary search mcq,linear search mcq,searching mcq in python with answers,searching mcq in python with answers pdf,searching mcq in python online test,mcq search with answer,python mcq online test with answers,searching mcq in python with answers for beginners

1. What is the primary goal of searching in computer science?

A) To delete elements from a list
B) To sort a list
C) To locate a specific element in a list
D) To multiply elements in a list

ANSWER= C) To locate a specific element in a list

2. Which of the following is another name for linear search?

A) Quick search
B) Divide and conquer search
C) Serial search
D) Binary search

ANSWER= C) Serial search

3. In linear search, how many comparisons are required in the worst case for a list of n elements?

A) n/2
B) n
C) 𝑙𝑜𝑔2𝑛
D) 1

ANSWER= B) n

4. Linear search is most suitable when the list is:

A) Sorted
B) Encrypted
C) Small and unsorted
D) Large and ordered

ANSWER= C) Small and unsorted

5. Which loop is used in the linear search algorithm provided in the chapter?

A) for loop
B) while loop
C) do-while loop
D) nested loop

ANSWER= B) while loop

6. In which case will linear search make only one comparison?

A) When the key is the middle element
B) When the list is sorted
C) When the key is the last element
D) When the key is the first element

ANSWER= D) When the key is the first element

7. In linear search, if the key is not present in the list, the number of comparisons will be:

A) 0
B) 1
C) n
D) n-1

ANSWER= C) n

8. What is returned by the linearSearch() function if the key is not found?

A) 0
B) -1
C) None
D) The index of last element

ANSWER= C) None

9. Binary search works only on:

A) Encrypted lists
B) Hashed lists
C) Sorted lists
D) Lists with no duplicates

ANSWER= C) Sorted lists

10. What is the mid index calculated as in the binary search algorithm?

A) (first + last) / 2
B) (first + last) % 2
C) (first + last) // 2
D) (first + last) * 2

ANSWER= C) (first + last) // 2

11. In the best case, binary search takes how many iterations to find the key?

A) 0
B) 1
C) 𝑙𝑜𝑔2𝑛
D) n

ANSWER= B) 1

12. What happens when the middle element in binary search equals the key?

A) The list is reversed
B) The key is ignored
C) The search continues
D) The key is found and search terminates

ANSWER= D) The key is found and search terminates

13. What is the time complexity of binary search in the worst case?

A) O(n²)
B) O(n)
C) O(log n)
D) O(1)

ANSWER= C) O(log n)

14. Binary search reduces the list size by:

A) One element each time
B) Two elements each time
C) Half each time
D) None of the above

ANSWER= C) Half each time

15. What is a requirement for the binary search algorithm to work properly?

A) The list must be hashed
B) The list must be unsorted
C) The key must be negative
D) The list must be sorted

ANSWER= D) The list must be sorted

16. What does hashing use to calculate the position of an element?

A) Key length
B) Sorting function
C) Hash function
D) Index counter

ANSWER= C) Hash function

17. What is the formula for the remainder method used in hashing?

A) element // table size
B) element % table size
C) element + table size
D) element - table size

ANSWER= B) element % table size

18. What is the term used when two elements in hashing map to the same index?

A) Mapping
B) Modulo clash
C) Collision
D) Duplication

ANSWER= C) Collision

19. What is a perfect hash function?

A) A function that sorts a list
B) A function that encrypts elements
C) A function that generates only even indices
D) A function that maps all elements to unique indices

ANSWER= D) A function that maps all elements to unique indices

20. Which search technique is fastest in theory when there are no collisions?

A) Linear search
B) Binary search
C) Hash-based search
D) Sequential search

ANSWER= C) Hash-based search

21. Assertion (A): Linear search is suitable for small and unsorted lists. Reason (R): Linear search checks every element sequentially from the beginning of the list.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is true, but R is false.
D) A is false, but R is true.

ANSWER= A) Both A and R are true, and R is the correct explanation of A.

22. Assertion (A): Linear search performs the minimum work when the key is at the end of the list. Reason (R): Linear search stops after finding the first occurrence of the key.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is false, but R is true.
D) Both A and R are false.

ANSWER= C) A is false, but R is true.

23. Assertion (A): Binary search is faster than linear search on large datasets. Reason (R): Binary search reduces the list size by half in every iteration.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is false, but R is true.
D) Both A and R are false.

ANSWER= A) Both A and R are true, and R is the correct explanation of A.

24. Assertion (A): Binary search works efficiently on unsorted data. Reason (R): Binary search compares the key only with the first and last elements.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is false, but R is true.
D) Both A and R are false.

ANSWER= D) Both A and R are false.

25. Assertion (A): In binary search, if the key is not found, the list size continues to reduce until one element remains. Reason (R): Binary search stops only when first > last.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is true, but R is false.
D) Both A and R are false.

ANSWER= A) Both A and R are true, and R is the correct explanation of A.

26. Assertion (A): Hashing provides constant time search irrespective of the list size. Reason (R): Hashing directly accesses the element by calculating its position using a hash function.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is false, but R is true.
D) Both A and R are false.

ANSWER= A) Both A and R are true, and R is the correct explanation of A.

27. Assertion (A): A perfect hash function guarantees that no two elements map to the same index. Reason (R): Perfect hash functions are collision-prone.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is true, but R is false.
D) Both A and R are false.

ANSWER= C) A is true, but R is false.

28. Assertion (A): Binary search modifies the list by deleting elements that are not required. Reason (R): The search area reduces by half in each iteration.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is false, but R is true.
D) Both A and R are false.

ANSWER= C) A is false, but R is true.

29. Assertion (A): Collisions in hashing occur when two keys are stored at the same index. Reason (R): The modulo division method always avoids collisions.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is true, but R is false.
D) Both A and R are false.

ANSWER= C) A is true, but R is false.

30. Assertion (A): Binary search is efficient only if the list is sorted. Reason (R): Sorting allows binary search to determine which half to discard.

A) Both A and R are true, and R is the correct explanation of A.
B) Both A and R are true, but R is not the correct explanation of A.
C) A is false, but R is true.
D) Both A and R are false.

ANSWER= A) Both A and R are true, and R is the correct explanation of A.