Problem solving: Unit 2-3

Question 1

• What are the two types of algorithms?

Answer 1

• sorting algorithms.
• searching algorithms.

Question 2

What is a construct?

Answer 2

• a smaller part from which something is built.

Question 3

• What are the two sorting algorithms?

Answer 3

• bubble sort.
• merge sort.

Question 4

• what is traversal?

Answer 4

• travel across or through something.

Question 5

-what is recursion?

Answer 5

• a process that is repeated.

Question 6

• what is brute force?

Answer 6

• an algorithm design that does not include any techniques to improve performance, but instead relies on computing power to try all possibilities until the solution to a problem is found.

Question 7

• what is divide and conquer?

Answer 7

• an algorithm design that works by dividing a problem into smaller and smaller sub-problems, until they are easy to solve, the solution are then combined to give a solution to the complete problem.

Question 8

• what are the two searching algorithms?

Answer 8

• linear search.
• binary search.

Question 9

What is iteration?

Answer 9

• a construct that means a process is repeated. An action is repeated until a condition is met or a particular outcome is reached.

Question 10

What is selection?

Answer 10

• a construct that allows a choice to be made between different alternatives.

Question 11

Compare binary search and linear search?

Answer 11

• binary search is more efficient, wheras linear search will have multiple comparisons to be made.
• ## binary search must be conducted in a sorted list, wheras linear search could be done in an unsorted list

Question 12

What is the limitation of Merge Sort? Bubble Sort?

Answer 12

limitation of merge sort is that it diffcult to code than, while bubble sort is more time consuming.