2.1 - Algorithms

Question 1

What is computational thinking?

Answer 1

A problem-solving method using computer science techniques, where possible solutions are developed and presented in a way that can be understood by humans and computers.

Question 2

What are the important elements of computational thinking?

Answer 2

• Decomposition
• Abstraction
• Algorithmic thinking

Question 3

What is decomposition?

Answer 3

Breaking down a complex problem or system into smaller parts that are more manageable and easier to understand
—> Smaller parts can be examined as they are simpler to work with

Question 4

What is abstraction?

Answer 4

Involves removing unnecessary detail from a problem in order to concentrate on those that are needed

Question 5

Why is abstraction used?

Answer 5

Bc it simplifies a problem to make it less complex
—> Makes it more straightforward to understand the problem & create a solution

Question 6

What is algorithmic thinking?

Answer 6

Involves using logical steps to
find a solution to a complex problem.

Question 7

What is an algorithm?

Answer 7

A set of instructions for solving a problem or completing a task

Question 8

Why would programmers create algorithmic designs?

Answer 8

As a method of planning a program before writing any code
—> Helps them to consider potential problems of the program & makes it easier to start creating source code

Question 9

What does this flowchart symbol mean?

Answer 9

Start / stop terminator

Question 10

What does this flowchart symbol mean?

Answer 10

Operation (process)

Question 11

What does this flowchart symbol mean?

Answer 11

Decision

Question 12

What does this flowchart symbol mean?

Answer 12

Input / Output

Question 13

What does this flowchart symbol mean?

Answer 13

Direction of flow

Question 14

What does this flowchart symbol mean?

Answer 14

Subroutine

Question 15

What are trace tables?

Answer 15

Used to track the value of variables as a program is run

Question 16

What is a Linear search?

Answer 16

Each data item is searched in order from the 1st value to the last

Question 17

What is a Linear search also known as?

Answer 17

A sequential search

Question 18

What type of lists are linear searches best for?

Answer 18

Small data sets

Question 19

What is an advantage of a Linear search?

Answer 19

The list does not have to be ordered before it is searched

Question 20

What is a binary search?

Answer 20

The middle point of the data is selected w/ each iteration and many data items can be ignored

Question 21

What is a disadvantage of a Binary search?

Answer 21

The list of data must be already sorted

Question 22

What is a advantage of a Binary search?

Answer 22

More efficient than linear

Question 23

What type of lists are binary searches best for?

Answer 23

Large data sets

Question 24

What is a Merge sort?

Answer 24

Divides a list into half, again and again until each data item is separate
—> Based on idea of “divide and conquer”

Question 25

What is the bubble sort?

Answer 25

Data elements are swapped if they r not in the correct order

Question 26

What type of lists are bubble sorts best for?

Answer 26

Small sets of data

Question 27

What is the insertion sort?

Answer 27

Values from the unsorted part are checked and inserted at the correct position in the sorted part
—> This continues through all elements of the list until the last item is reached & sorted