4.2 Connecting Computational Thinking and Program and Design

Question 1

Parallel Array

Answer 1

2 separate arrays which store related data on the same indexes

Question 2

Sequential Search

Answer 2

Iterating through the array one by one until the desired number is found
O(n)

Question 3

Binary Search

Answer 3

-Requires a sorted array
-Array is divided in half. If the targeted number is below the middle number then the first half is spilt again until the number is found and vice versa for when it’s bigger.
O (log n)

Question 4

Bubble Sort

Answer 4

-Array is iterated
-If the number is bigger than its neighbour it is swapped
-After the iteration, the highest number is bubbled to the top
O (n^2)

Question 5

Selection Sort

Answer 5

-The array is spilt into 2 sub-arrays
-The first sub-array has the sorted items and the second sub-array has the unsorted items
-It works by repeatedly finding the minimum element from an unsorted list and moving it to the beginning of the list.
O (n^2)

Question 5

Collections

Answer 5

Allow to store different data types in one data structure

Question 6

Correctness

Answer 6

Extent to which algorithm satisfies the specifciations

Question 7

Reliability

Answer 7

Refers to the capability of the algorithm to maintain a predefined level of performance and perform all the functions under stated conditions

Question 8

Flexibility

Answer 8

Efforts required to modify the algorithm for other purposes other than the ones that it initially developed.