2.1 Algorithms

Question 1

Computational Thinking

Answer 1

Breaking down a problem into manageable steps and developing into an algorithm to solve with.

Question 2

Abstraction

Answer 2

Filtering out the characteristics of a problem that are not needed in order to concentrate on those that are needed.

Question 3

Decomposition

Answer 3

Breaking down a large problem into smaller sub-problems.

Question 4

Algorithmic thinking

Answer 4

Identifying the steps involved in solving a problem.

Question 5

Linear Search

Answer 5

Each item in the list is checked and parsed through in order.

Question 6

Binary search

Answer 6

An ordered list is divided into two parts with each comparison.

Question 7

Bubble Sort

Answer 7

Moving through a list repeatedly , swapping elements that are in the wrong order.

Question 8

Merge sort

Answer 8

A list is splint into smaller lists (2 elements ) and then are combined and ordered.

Question 9

List

Answer 9

A collection of data with a single identifier.

Question 10

Insertion Sort

Answer 10

Each item takes it turns , compare to the items in a sorted list and placed in the correct position.

Question 11

Algorithm

Answer 11

The series of steps to solve a problem or perform an action.

Question 12

Flowchart

Answer 12

A diagram that shows the inputs, outputs and processes in an algorithm.

Question 13

Process

Answer 13

An action that takes place .

Question 14

Pseudocode

Answer 14

Simplified programming code that is not language specific , used to design algorithms.

Question 15

Trace Table

Answer 15

A table that follows the values of a variable to check for accuracy.

Question 16

What is the symbol for a process ?

Answer 16

Rectangle = An action

Question 17

What is the symbol for a subroutine ?

Answer 17

Rectangle + bars

Question 18

What is the symbol for an Input/Output ?

Answer 18

Parallelogram

Question 19

What is the symbol for a decision ?

Answer 19

Diamond

Question 20

What is the symbol for a terminator ?

Answer 20

Oval = start/stop

Question 21

What are the two types of error ?

Answer 21

• Syntax
• Logic

Question 22

What is a syntax error ?

Answer 22

code written does not follow the grammatical and format rules of the programming language

Question 23

What is a logic error ?

Answer 23

error in the way a program works

Question 24

How does a binary search work ?

Answer 24

• set the counter to middle pos of list
• value = match means the search ends
• if midpoint value is < value , list split in 2 and bottom half ignored
  -if midpoint value > value , list split in 2 and top half ignored
• Repeat until value is found

Question 25

How does a linear search work ?

Answer 25

-each item of data is examined until a match is made.

-Once the item is found, the search ends.

Question 26

What does a binary search require ?

Answer 26

An ordered list

Question 27

Do values in list have to be ordered to perform linear search ?

Answer 27

NO

Question 28

How does a bubble sort work ?

Answer 28

• Start at the beginning of the list
• Compare first and second value , swap
• Repeat until no more items to compare

Question 29

How does a merge sort work ?

Answer 29

• List is divided into individual elements bu
  splitting into two until elements are singular
  -Pairs of elements compared , placed into order and combined until list becomes one

Question 30

How does an insertion sort work ?

Answer 30

• Compares values in turn, start with 2nd value
• the greater value shifts to the right and repeats