2.1.Algorithms

Question 1

Linear Search

Answer 1

A search algorithm that works by checking each element in a list one by one, and returning the target value when found.

Question 2

Binary Search

Answer 2

A more efficient search algorithm that works on sorted lists, where the target value is compared with the midpoint to halve the search space.

Question 3

Midpoint

Answer 3

In binary search, the midpoint is calculated using the formula: (LowestIndex + HighestIndex) / 2.

Question 4

Bubble Sort

Answer 4

A simple sorting algorithm that compares adjacent elements and swaps them if they are in the wrong order, continuing until no swaps are needed.

Question 5

Pass (Bubble Sort)

Answer 5

A single cycle of the Bubble Sort algorithm where each pair of adjacent elements is compared and swapped if necessary.

Question 6

Merge Sort

Answer 6

A more efficient sorting algorithm that divides the dataset into smaller sub-sets, then merges them in the correct order.

Question 7

Insertion Sort

Answer 7

A sorting algorithm where elements are inserted into their correct position one at a time, by shifting larger elements to the right.

Question 8

Sorting Algorithms

Answer 8

Algorithms used to rearrange elements in a list or array into a specific order, such as ascending or descending.

Question 9

Decomposition

Answer 9

Breaking a large problem into smaller, manageable sub-problems to make it easier to solve.

Question 10

Abstraction

Answer 10

Removing unnecessary details and leaving only the most important aspects of a problem to focus on.

Question 11

Flowchart

Answer 11

A diagram used to represent algorithms, with shapes that indicate processes, decisions, and the flow of control.

Question 12

Pseudocode

Answer 12

A method of writing algorithms using simple, plain language to describe each step in the process.

Question 13

Efficiency (Algorithms)

Answer 13

The performance of an algorithm in terms of time and memory usage, with more efficient algorithms requiring fewer resources.

Question 14

Algorithm

Answer 14

A sequence of instructions used to perform a task or solve a problem.

Question 15

Searches

Answer 15

The number of comparisons or steps taken by a search algorithm to find a target value in a list.

Question 16

Sorting

Answer 16

The process of arranging items in a specific order, typically ascending or descending.

Question 17

Merge Sort Efficiency

Answer 17

Merge sort is more efficient than bubble sort and insertion sort when sorting large datasets, but uses more memory.

Question 18

Bubble Sort Efficiency

Answer 18

Bubble sort is easier to understand than merge or insertion sort but is very inefficient with longer lists or datasets.

Question 19

Insertion Sort Efficiency

Answer 19

Insertion sort is simple to implement but very inefficient with large datasets.

Question 20

Recursive Algorithm

Answer 20

An algorithm that calls itself with modified parameters to solve smaller instances of a problem.

Question 21

Divide and Conquer

Answer 21

A method used in merge sort where the dataset is divided into smaller sub-datasets, processed separately, and then merged.

Question 22

Big-O Notation

Answer 22

A mathematical notation used to describe the performance or complexity of an algorithm in terms of time and space.

Question 23

Best, Worst, and Average Case

Answer 23

Terms used to describe the efficiency of an algorithm in different situations: best case (minimum), worst case (maximum), and average case.