DAA Quiz 1

1. What is an algorithm?

• a) A step-by-step recipe for cooking

• b) A sequence of operations to solve a problem

• c) A physical machine to perform calculations

• d) A programming language

1. Which of the following is NOT a property of an algorithm?

• a) Finiteness

• b) Uniqueness

• c) Input

• d) Output

1. Which method of algorithm specification uses human language to describe the steps of an algorithm?

• a) Flowchart

• b) Pseudo code convention

• c) UML diagram

• d) Natural language

• What does the Big-Oh notation (O) express for an algorithm?

• • a) Upper bound of time complexity

• • b) Lower bound of time complexity

• • c) Exact time complexity value

• • d) Average time complexity

Which sorting algorithm repeatedly selects the minimum element from the unsorted part of the array and places it at the beginning?

• a) Insertion sort

• b) Selection sort

• c) Merge sort

• • d) Bubble sort

The Rabin-Karp string matching algorithm is based on:

• a) Dynamic programming

• b) Divide and conquer

• c) Hashing

• • d) Backtracking

Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?

f1(n) = 2^n

f2(n) = n^(3/2)

f3(n) = nLogn

f4(n) = n^(Logn)

• f3, f2, f4, f1

• f3, f2, f1, f4

• f2, f3, f1, f4

• f2, f3, f4, f1

In Greedy method we get ________ Feasible solutions

• one

• more than one

• zero

• hundred

divide and conqure approach solves subproblems recursively.

• False

• True

What is the Big-O Notation of "Divide & Conquer" Algorithms?

• O(n)

• O(2ⁿ)

• O(log n)

• O(n²)

• O(1)