UNIT 1-Algorithmic Problem Solving,Tower of hanoi

What is iteration in algorithmic problem solving?

• Repeating a set of instructions or steps multiple times

• Executing instructions in random order

• Skipping a set of instructions

• Performing a single instruction only once

How do you use iteration to solve a problem?

• By skipping the code execution

• By executing the code only once

• By repeatedly executing a block of code until a certain condition is met.

• By executing the code in reverse order

Can you give an example of a problem that can be solved using iteration?

• Multiplying all elements in an array

• Sorting an array in ascending order

• Finding the sum of all elements in an array

• Finding the average of all elements in an array

What is recursion in algorithmic problem solving?

• A technique where a function calls itself to solve a problem

• A technique where a function calls a built-in method to solve a problem

• A technique where a function calls another function to solve a problem

• A technique where a function calls a random function to solve a problem

How is recursion different from iteration?

• Recursion is only used in programming languages, while iteration is used in mathematics

• Recursion involves a function calling itself, while iteration involves a loop that repeats a set of instructions.

• Recursion involves using a loop, while iteration involves calling a function

• Recursion and iteration are the same thing

Can you explain the concept of recursion with a simple example?

• No, recursion is a programming concept where a function calls another function to solve a problem

• Yes, recursion is a programming concept where a function calls itself to solve a smaller instance of the same problem.

• Recursion is a programming concept where a function calls the main function to solve a problem

• Recursion is a programming concept where a function calls a built-in library function to solve a problem

What is the Towers of Hanoi problem?

• A mathematical puzzle involving three rods and a number of disks of different sizes

• A type of food in Italy

• A type of ancient building in Asia

• A famous dance in India

How many pegs are used in the Towers of Hanoi problem?

• 10

• 7

• 3

• 5

What is the minimum value in a list?

• The minimum value in a list is the average of all the values in the list.

• The minimum value in a list is the smallest value present in the list.

• The minimum value in a list is the largest value present in the list.

• The minimum value in a list is the sum of all the values in the list.

How do you find the minimum value in a list using algorithmic problem solving?

• Iterate through the list and keep track of the smallest value encountered

• Sort the list in descending order and select the last element as the minimum value

• Select a random value from the list and assume it to be the minimum without comparison

• Use the maximum value in the list as the starting point and compare it with each element