DAA -MCQ

Advait is organizing a large library of books and wants to find the most efficient way to sort them and search for specific titles. The algorithms like merge sort, quick sort and binary search are based on

• Greedy algorithm

• Divide and Conquer algorithm

• Hash table

• Parsing

Dhruv is working on a large project that requires him to break it down into smaller tasks. He follows the Divide and conquer process to manage his workload effectively. The step(s) in this process are:

• Conquer/Solve

• Merge/Combine

• Divide/Break

• Both B and C

Divya is organizing a large community event and needs to manage various tasks. In the Divide and Conquer process, breaking the event planning into smaller sub-tasks is the responsibility of

• Divide/Break

• Sorting/Divide

• Conquer/Solve

• Merge/Combine

Alisha is organizing a large event and needs to sort a list of participants efficiently. She knows that some sorting algorithms use a divide and conquer approach. Which one of the below sorting methods cannot be used by Alisha for her event?

• mergesort

• quicksort

• heapsort

• binary search

Myra is trying to understand the time complexity of an algorithm for her computer science project. What is meant by the time complexity of an algorithm?

• The amount of time required to solve a particular problem

• How difficult a problem is to solve

• How many lines of code are required to solve a problem

• How quickly a solution can be developed

Myra is trying to understand how to measure the time complexity of her algorithms for a school project. What method should she use?

• Big-O notation

• Big-N notation

• N notation

• Small-O notation

Sneha is organizing a large collection of books for her library. She wants to sort them efficiently using a method that divides the collection into smaller parts and then combines them back together. Identify the sorting algorithm that applies the divide-and-conquer method.

• Linear Sort

• Merge Sort

• Heap Sort

• Binary Sort

Myra is organizing her collection of books by their publication years. She decides to use a sorting method to arrange them in order. Which type of sort algorithm is she using?

• Insertion

• Bubble

• Merge

During a computer science class, Kabir asked his teacher, "What is pseudocode?"

• Another way to write an algorithm.

• Uses symbols to represent an algorithm

• source code

• binary code

Rohan is organizing a library of books. How does a merge sort work to help him sort the books?

• It sorts a list by comparing neighbouring items to see which is out of order

• It takes one item from the list and places it in the correct place

• It finds an item of data in a list

• It divides the list into sublists and then merges pairs of sublists together to sort the data.