Term 1/2

Question 1

Sequence

Answer 1

Instructions that are carried out one after another in order.

Question 2

Iteration

Answer 2

Repeating instructions over and over again, this is called a loop.

Question 3

Selection

Answer 3

A desicion or question. Depending on the answer given (choice), the program will follow a certain step ( path) and ignore the others.

Question 4

Operators and their meanings:

==
!=
>
<
>=
<=

Answer 4

== - Equal to
!= Not equal to
> More than
< Less than
>= More than or equal to
<= Less than or equal to

Question 5

Integer

Answer 5

A whole number

Question 6

String

Answer 6

A set of alphanumeric characters and symbols - eg a word or sequence

Question 7

Real/ FLoat

Answer 7

Real / Float - Used to store decimal numbers. Typically a number is represented aproximately to a fixed number of signigicant figures and scaled using exponent.

Question 8

Boolean

Answer 8

Used to store logical conditiond eg TURE/FALSE, ON/OFF, YES/NO

Question 9

Variable

Answer 9

A value that is stored and can be changed

Question 10

Constant

Answer 10

A value that is stored and cant be changed

Question 11

Syntax error

Answer 11

Where your code doesn’t run and you have broken the rules of the language

Question 12

Logic error

Answer 12

WHere your program runs but does something unexpected

Question 13

Decomposition

Answer 13

Taking a complex problem and breaking it into a series of smaller more manegable problems.

Question 14

Abstraction

Answer 14

Removing unecessary details and instead focus on the important factors, ignoring irrelevant information.

Question 15

Algorithmic thinkking

Answer 15

Step by step instructions to solve a problem ( an algorithm)

Question 16

Flow chart symbols:
Oval
Parallelogram
Rectangle
Diamond

Answer 16

Oval - STart / end
Parallelogram - Input/ Output
Rectange - Process ( Action, calculation, storing a variable)
Diamond - Decision

Question 17

Psuedocode

Answer 17

ALlows the designer to focus on the logic of the algorithm without being distracted by the syntax of the programming language.

Question 18

Linear/ Serial search

Answer 18

Works by checking every single item in the list in order until you find the searched item, or fail to find it at all.

Question 19

Binary search

Answer 19

A binary seach algorithm can only be used on sorted data
It takes the data and keeps divifing it in half until it finds the item it is looking for.

Question 20

Bubble sort

Answer 20

Each item in a list is compared to the one next to it and if it is greater, they swap places. This is repeated until the items are sorted

Question 21

Merge sort

Answer 21

The first stage of a merge sort is to keep splitting the lists in half until they are only 1 item long.
THen each list is first sorted and then recombined to form a fully sorted list.

Question 22

Insersion sort

Answer 22

INsertion sorts compare values in turn, starting with the second value in the list.
If this value is less than the value to the left of it, they swap places.
Keep moving the value to the left until it doesnt swap.