Design and Analysis of Algorithms

Five steps in problem solving except

• Problem Analysis 

• Design a solution

• Implementation

• Testing

• Identify

What is the correct definition of an algorithm?

• An algorithm is a step by step instructions to solve a problem.
• An algorithm is a process of baking bread.
• An algorithm is a software used to compute numbers.
• An algorithm is the process of breaking problems.

What order of complexity does this graph represent?

• Exponential

• Polynomial

• Linear

• Logarithmic

What order of complexity does this graph represent?

• Exponential

• Polynomial

• Linear

• Constant

What is the time complexity of this algorithm?

• O(n)

• O(2ⁿ)

• O(log n)

• O(n²)

• O(1)

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

• O(n)

• O(2ⁿ)

• O(log n)

• O(n²)

• O(1)

What is the Big-O Notation of a combination lock with 4 digits, each digit having 1 of 10 possible values?

• O(n)

• O(10ⁿ)

• O(log n)

• O(n²)

• O(1)

Start
Put your hand on the doorknob
Turn the doorknob to the side until it unlocks the door
Push or pull  the door to open it
End
..................................................
What would be an appropiate title for this algorithm?

• How to push a door
• Steps to stand infront of a door
• Steps to touch a doorknob
• How to open a door

Quick sort running time depends on the selection of ____________.

• Size of array
• Pivot element
• Sequence of values
• None of the above

Which type of lists or data sets are binary searching algorithms used for?

• Unsorted lists or data sets
• Sorted lists or data sets