Algorithms and Programs

Question 1

Algorithm

Answer 1

An algorithm is a set of mechanical and sequential steps that are followed in order to receive some form of input and process it to form an output. Two ways of representing an algorithm are Pseudocode and Flowchart.

Question 2

Lossy compression

Answer 2

File is compressed to a smaller size but some information is lost during the process.

Question 3

Lossless compression

Answer 3

Reduces the file size without losing any information.

Question 4

Linear search

Answer 4

Linear search doesn’t require data to be in order, it only requires equality comparisons. Linear search requires sequential access. The problem with this method is that it isn’t very efficient, especially with large data sets it can take a large amount of time.

Question 5

Binary search

Answer 5

Binary search is a much more efficient way of searching through a list of items compared to a linear search. You can only use binary sear5ch if the data is already ordered. Binary search is a very powerful algorithm because of how fast it is, this is because, with each comparison, the algorithm eliminates half of the data.

Question 6

Bubble sort

Answer 6

The bubble sort algorithm works by passing through the data, comparing each
value with the following one and swapping them if necessary. Several
passes are made until the data is in order.

Question 7

Insertion sort

Answer 7

The insertion sort algorithm uses two lists, one for sorted elements and one for unsorted elements. Comparisons are made and data is inserted in the right position in the sorted list. Other items are then moved along. This process is then repeated.