Question 1

What is the main advantage of using a binary search over a linear search when searching for an item in a sorted list?

Accepted Answer

Binary search is faster on average.

Answer

Binary search is easier to implement.

Answer

Binary search works with unsorted lists.

Answer

Binary search requires less memory.

Question 2

In what scenario is a linear search preferred over a binary search?

Accepted Answer

When the list is unsorted.

Answer

When the list contains only unique elements.

Answer

When the list is sorted.

Answer

When the list is large.

Question 3

What is the primary characteristic that distinguishes binary search from linear search?

Accepted Answer

Binary search divides the search space in half each time.

Answer

Binary search checks each element sequentially.

Answer

Binary search does not require a sorted list.

Answer

Binary search only works with strings.

Question 4

Which searching algorithm would be more efficient for finding an element in a small, unsorted dataset?

Accepted Answer

Linear search.

Answer

Hash search.

Answer

Quick search.

Answer

Binary search.

Question 5

Why does a binary search require a list to be sorted before the search begins?

Accepted Answer

Binary search uses the order to eliminate half the remaining elements.

Answer

Binary search swaps elements as it searches.

Answer

Binary search creates an index for unsorted data.

Answer

Binary search relies on checking every element.

Question 6

Which searching algorithm performs consistently in O(n) time complexity regardless of dataset order?

Accepted Answer

Linear search.

Answer

Hash search.

Answer

Binary search.

Answer

Quick search.

Question 7

How does the number of comparisons in a binary search change with each step?

Accepted Answer

It decreases exponentially.

Answer

It stays the same.

Answer

It decreases linearly.

Answer

It increases exponentially.

Question 8

What is a disadvantage of using a linear search compared to a binary search?

Accepted Answer

Linear search is slower on average with large datasets.

Answer

Linear search requires sorting the data first.

Answer

Linear search is more complex to implement.

Answer

Linear search only works with numeric data.

Question 9

What type of data structure must be in place to effectively implement a binary search?

Accepted Answer

The data structure must be sorted.

Answer

The data structure must be doubly linked.

Answer

The data structure must be circular.

Answer

The data structure must be indexed.

Question 10

In which scenario would a binary search be ineffective despite having a sorted list?

Accepted Answer

When frequent insertions and deletions occur.

Answer

When elements are strings and not numbers.

Answer

When the list is very large.

Answer

When all elements are unique.

Question 11

Which of the following best describes the process of decomposition in computational thinking?

Accepted Answer

Breaking a complex problem into smaller, manageable parts.

Answer

Writing code without planning.

Answer

Creating a single large solution to a problem.

Answer

Ignoring the details and focusing on the big picture.

Question 12

What is the primary goal of abstraction in computational thinking?

Accepted Answer

To reduce complexity by focusing on the essential features of a problem.

Answer

To ensure every detail is captured for analysis.

Answer

To combine multiple solutions into one large system.

Answer

To increase the complexity of a solution.

Question 13

Which of the following statements best describes algorithmic thinking?

Accepted Answer

Creating a step-by-step strategy to solve a problem.

Answer

Ignoring steps to solve problems intuitively.

Answer

Identifying patterns by trial and error.

Answer

Breaking down problems into parts without strategy.

Question 14

What does the process of abstraction allow you to do when dealing with complex systems?

Accepted Answer

Focus on important details while ignoring irrelevant ones.

Answer

Swap details between different systems for efficiency.

Answer

Include all details of a system for accuracy.

Answer

Break the system into smaller subsystems.

Question 15

How does decomposition assist in solving complex computational problems?

Accepted Answer

It divides the problem into manageable parts.

Answer

It abstracts the problem for clarity.

Answer

It randomly selects parts to solve first.

Answer

It merges all parts into a single solution.

Question 16

In computational thinking, what is the importance of algorithmic thinking?

Accepted Answer

It provides a logical sequence of steps to solve a problem.

Answer

It breaks the problem into incoherent segments.

Answer

It helps to hide details for simplification.

Answer

It combines various solutions into one.

Question 17

What is an advantage of using decomposition in computer science?

Accepted Answer

It helps to identify and solve smaller problems independently.

Answer

It focuses on unimportant details.

Answer

It increases the complexity of the problem.

Answer

It requires all team members to work on a single solution.

Question 18

Which of the following is an example of algorithmic thinking in daily life?

Accepted Answer

Planning a route with step-by-step directions to a destination.

Answer

Listing all possible routes randomly.

Answer

Ignoring the steps and hoping to arrive somewhere.

Answer

Combining multiple destination addresses in one task.

Question 19

In the context of computational thinking, what does abstraction help to achieve during problem solving?

Accepted Answer

It helps to highlight essential aspects while removing unnecessary complexity.

Answer

It focuses solely on the non-essential aspects.

Answer

It adds complexity to the system by including more details.

Answer

It ensures that every detail is considered and analyzed.

Question 20

What role does abstraction play in computational thinking when developing software?

Accepted Answer

It simplifies the problem by focusing on key elements and ignoring the unnecessary details.

Answer

It merges all software features into a single module.

Answer

It enhances complexity by adding more details.

Answer

It breaks down software into minute, detailed components.

Related quizzes

Related quizzes