NEW
Font size
WorksheetsPython MCQ Challenge
Total questions: 15
Worksheet time: 8mins
SNS Engineering College maintains a list of student roll numbers. To check if roll number 2025 exists, which search is more efficient if the list is already sorted?
Linear Search
Binary Search
Random Search
Hash Search
You have a Python list of Tamil movies:
movies = ["Vikram", "Leo", "Jailer", "Master", "Beast"]
If you want to check whether "Leo" is present, which searching technique is most suitable for an unsorted list?
Binary Search
Linear Search
Interpolation Search
Hash Search
In a cricket match scorecard, player scores are stored in sorted order:
scores = [15, 22, 35, 50, 60, 72, 85, 100]
Which search will find score = 72 faster?
Linear Search
Binary Search
Random Guessing
Sequential Check
Coimbatore colleges are stored in a list:
colleges = ["PSG", "KCT", "SNS", "SKCET", "Sri Krishna"]
Which Python statement is best for searching "SNS" directly?
"SNS" in colleges
colleges.index("SNS")
Both a and b
None
If a movie ticket booking system uses binary search, what condition must be true for the movie seat numbers list?
List must be sorted
List must be unsorted
List must have unique values
List must contain only integers
players = ["Dhoni", "Kohli", "Raina", "Rohit", "Jadeja"]
name = "Kohli"
for i in range(len(players)):
if players[i] == name:
print("Found at", i)
What type of search is implemented?
Binary Search
Linear Search
Jump Search
Hashing
In Anna University results portal, students search their register number. If register numbers are stored in a sorted list, which algorithm reduces search time from O(n) to O(log n)?
Linear Search
Binary Search
Bubble Sort
Quick Search
In IPL cricket, searching for "CSK" in a team list:
teams = ["MI", "CSK", "RCB", "KKR", "SRH"]
Which Python function directly gives index of "CSK"?
Which scenario best fits linear search in Python?
Finding a movie in an unsorted movie list
Finding student rank from a sorted rank list
Searching roll number in binary tree
Searching books in a hash table
Tamil Nadu bus seat numbers are stored sorted as:
seats = [1, 2, 3, 4, 5, 6, 7, 8]
If you apply binary search for seat 6, how many maximum comparisons?
1
2
3
8
arr = [10, 20, 30, 40, 50]
x = 40
low, high = 0, len(arr)-1
while low <= high:
mid = (low+high)//2
if arr[mid] == x:
print("Found")
break
elif arr[mid] < x:
low = mid+1
else:
high = mid-1
Which algorithm is this?
Linear Search
Binary Search
Hash Search
Jump Search
SNS Engineering library database stores unsorted book IDs. A student searches for ID 145. Which search is most suitable?
Linear Search
Binary Search
Fibonacci Search
Jump Search
In a cricket team, players’ names are unsorted. Searching for "Dhoni" in Python with:
if "Dhoni" in players:
print("Found")
What is the time complexity?
O(1)
O(log n)
O(n)
O(n log n)
If students = [101, 102, 103, 104, 105], then students.index(104) will return:
103
104
3
Error
A cinema theatre booking system stores seat numbers sorted from 1–500. To find seat 250, which is fastest?
Linear Search
Binary Search
Sequential Search
Random Guess
