Searching Algorithms and Complexity

Sneha is looking for her favorite book in a shelf filled with various books. What is linear search and how does it work?

• Linear search uses a hash table to find elements efficiently.

• Linear search requires the list to be sorted before searching.

• Linear search is a sequential search algorithm that checks each element in a list one by one.

• Linear search is a binary search algorithm that divides the list in half.

Vanya is looking for a specific book in a library that has its books sorted by title. She wants to find the book quickly. Explain how she can use the binary search algorithm to locate the book.

• Binary search requires an unsorted list to function properly.

• Binary search checks every element in the list sequentially.

• Binary search can only be used with numerical data types.

• Binary search is an efficient algorithm for finding an item from a sorted list of items by repeatedly dividing the search interval in half.

Naira is searching for her favorite book in a library that has a collection of n books arranged randomly. What is the time complexity of her search in the worst case?

• O(log n)

• O(1)

• O(n)

• O(n^2)

Neha is searching for a specific book in a library that has a collection of books organized in alphabetical order. What is the time complexity of her search using binary search in the worst case?

• O(log n)

• O(1)

• O(n log n)

• O(n)

Arjun is looking for a specific book in a library. He can either check each book one by one (linear search) or use the library's catalog to find the book quickly (binary search). How does the efficiency of linear search compare to binary search?

• Binary search is less efficient than linear search.

• Linear search is faster than binary search.

• Binary search is more efficient than linear search.

• Both searches have the same efficiency.

Myra is searching for a specific book in her messy room. In which scenarios would she prefer linear search over binary search?

• When the data is unsorted or when dealing with small datasets.

• When the dataset is structured as a tree

• When the data is sorted and large

• When searching for multiple elements at once

Vanya is searching for her favorite book in a library that has a collection of books arranged in a single row. What is the best case time complexity of her linear search for the book?

• O(n^2)

• O(n)

• O(log n)

• O(1)

Kiara is searching for a specific book in a well-organized library. She knows that the books are arranged in alphabetical order. What is the best case time complexity of her search using the binary search method?

• O(n^2)

• O(n)

• O(log n)

• O(1)

Aashi is searching for a specific book in a library. She knows that the books are arranged in a random order on the shelves. Describe a situation where binary search cannot be used in this context.

• Binary search requires data to be in descending order.

• Binary search can be applied to any type of data.

• Binary search is used for linear data structures.

• Binary search cannot be used on unsorted data.

Arnav is searching for a specific book in a library. How does the input size affect the performance of his linear search?

• The performance of linear search decreases exponentially with increasing input size.

• Linear search performance is unaffected by input size.

• The performance of linear search improves with increasing input size.

• The performance of linear search decreases linearly with increasing input size.