Search Header Logo

Python MCQ Challenge

Authored by Ajith Ajith

Information Technology (IT)

University

Used 1+ times

Python MCQ Challenge
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?