1 - Fundamentals of Algorithms

Question 1

What is an algorithm?

Answer 1

A set of instructions that describes how to solve a problem

Question 2

Name two methods can be used to design algorithms

Answer 2

Pseudo-code and flowcharts

Question 3

When designing algorithms with pseudo-code or flowcharts, what is the main focus?

Answer 3

The logic of the steps rather than the programming language

Question 4

Why is the focus on logic rather than programming language in algorithm design?

Answer 4

Because programmers should be able to translate an algorithm into any programming language

Question 5

What does it mean for an algorithm to be language independent?

Answer 5

It means the algorithm can be translated into any programming language, such as from Python to C++

Question 6

What is decomposition?

Answer 6

Breaking a problem down into smaller, more manageable chunks

Question 7

Which method of computational thinking is being primarily used here?

num ← USERINPUT
FOR number ← 1 TO 10
OUTPUT number * num
ENDFOR

Answer 7

Decomposition (using a loop to make it smaller and more manageable)

Question 8

What is abstraction in programming?

Answer 8

The process of removing unnecessary detail from a problem to focus on the important parts

Question 9

Why is abstraction useful?

Answer 9

It makes solving a problem easier by focusing only on relevant information

Question 10

What is algorithmic thinking?

Answer 10

A logical way of solving problems by breaking them into clear, step-by-step instructions (algorithms)

Question 11

What is pseudo-code?

Answer 11

A simple way of describing a set of instructions that resembles a programming language

Question 12

What does the symbol ← mean in pseudo-code?

Answer 12

It means assignment — storing a value in a variable.

Question 13

What is a variable in pseudo-code?

Answer 13

A named space in memory where data, such as user input, can be stored (e.g. num)

Question 14

How are outputs shown in pseudo-code?

Answer 14

Using the word OUTPUT followed by the data to be shown (e.g. OUTPUT number * 10)

Question 15

How would this pseudo-code appear in python?:

OUTPUT number * 10

Answer 15

print(number * 10)

Question 16

What does an arrow represent in a flowchart?

Answer 16

The flow of control or direction from one step to another

Question 17

What does a rectangle represent in a flowchart?

Answer 17

A process

Question 18

What does a rectangle with double vertical lines represent in a flowchart?

Answer 18

A subroutine or function that is defined elsewhere

Question 19

What does a parallelogram represent in a flowchart?

Answer 19

Input/Output

Question 20

What does a diamond represent in a flowchart?

Answer 20

A decision point

Question 21

What does an oval represent in a flowchart?

Answer 21

The start or end of a flowchart

Question 22

What are inputs in a program?

Answer 22

Data entered into a program by the user or system, usually stored in variables

Question 23

Why are outputs used in a program?

Answer 23

To communicate with the user (eg. display results or show further instructions)

Question 24

What is a variable in programming?

Answer 24

A named location in memory used to store inputted data for use in the program

Question 25

How does a program ask for a user’s name and store it in pseudo-code?

Answer 25

OUTPUT "Please enter your name:" name ← INPUT

Question 26

What is concatenation in programming?

Answer 26

The process of joining strings together

Question 27

What is this an example of?: OUTPUT "Hello" + name

Answer 27

Concatenation

Question 28

What is a trace table?

Answer 28

A table used to record the changing values of variables as an algorithm runs

Question 29

What are two examples of standard sorting algorithms?

Answer 29

Bubble sort and merge sort

Question 30

What are two examples of searching algorithms?

Answer 30

Linear search and binary search

Question 31

What is a linear search?

Answer 31

A search that checks each item in a list one by one until it finds the target or reaches the end

Question 32

When is linear search typically used?

Answer 32

When the list is small or unsorted

Question 33

What is a binary search?

Answer 33

A search that repeatedly divides a sorted list in half to find the target item

Question 34

What is the key requirement for using binary search?

Answer 34

The data must be sorted in order

Question 35

Why is binary search more efficient than linear search?

Answer 35

Because it eliminates half of the remaining data with each comparison

Question 36

What is bubble sort?

Answer 36

A sorting algorithm that repeatedly compares and swaps adjacent items if they are in the wrong order

Question 37

How does bubble sort work in each pass?

Answer 37

It moves the largest unsorted item to its correct position at the end

Question 38

What makes merge sort more efficient than bubble sort?

Answer 38

It reduces the number of comparisons needed by sorting sublists and combining them efficiently

Question 39

What is merge sort?

Answer 39

A divide-and-conquer sorting algorithm that splits the list into halves, sorts each half, and merges them back together