An algorithm is a clear list of instructions that achieve a task step by step. Need to be in the correct order. They must be unambiguous, complete, accurate, consistent and efficient.
1 of 33
What is Abstraction?
This is the process of making an easier to understand version of a complex system by focusing on necessary information.
2 of 33
What is Decomposition?
Decomposition is about breaking down a problem into smaller, manageable problems.
3 of 33
What is a Variable?
A variable is a location of memory in which you can temporarily store text or numbers.
4 of 33
What is a Terminator used for?
A Terminator is used at the start and end of a flowchart to indicate the start and end of an algorithm.
5 of 33
What does a Process show?
A Process is used to represent a process that needs to take place in the algorithm such as an instruction.
6 of 33
What does an Input or Output symbol show?
Input or Output represents data that is needed as an input to the algorithm or information that is output from the algorithm .
7 of 33
What does the Arrow show?
The arrow connects symbols showing the direction of the flow through the flowchart.
8 of 33
What do Decisions used for?
Decisions are used for selection and iteration.
9 of 33
What does Iteration mean?
Iteration means repetition, there are three types: For.....Endfor, While.....Endwhile and Repeat.....Until.
10 of 33
Describe a For loop.
A For loop runs for a set number of times.
11 of 33
Describe a While Loop.
A While loop runs until a certain condition is true.
12 of 33
Describe a Repeat Loop.
A Repeat Loop is when you want to execute the loop until a certain condition is true.
13 of 33
What is a Linear Search?
The Linear Search algorithm is a very simple sequential search.
14 of 33
How does Linear Search work?
It sorts through a list one data item at a time until it finds the data it's looking for.
15 of 33
What is an advantage of Linear Search?
It doesn't need to be sorted.
16 of 33
What is a disadvantage of Linear Search?
It is slow and inefficient.
17 of 33
How does Binary Search work?
A Binary Search works by splitting a list into two halves. It keeps halving the list until the value is found.
18 of 33
What is an advantage of Binary Search?
It's much quicker than Linear Search.
19 of 33
What is a disadvantage of Binary Search?
Only works if the list is sorted.
20 of 33
Describe Bubble Sort.
Each item in a list is compared to the one next to it and if it's greater, the swap places.
21 of 33
What is an advantage of Bubble Sort?
It doesn't require much storage.
22 of 33
What is a disadvantage of Bubble Sort?
It's slow and inefficient.
23 of 33
Describe Merge Sort.
Merge Sort splits the list in half until you get single numbers. Then it put back together the numbers in pairs arranging them in size order.
24 of 33
What is an advantage of Merge Sort?
It's much quicker then Bubble Sort.
25 of 33
What is a disadvantage of Merge Sort?
It requires more memory to store the sublists.
26 of 33
What is an Integer?
An Integer is a whole number.
27 of 33
What is a Real?
A Real is a number with a decimal number.
28 of 33
What is a boolean?
A Boolean can only be True or False
29 of 33
What is a Character?
A Character is a single alphabetic or numeric character.
30 of 33
What is a String?
A String is one or more characters enclosed in quote marks.
31 of 33
What is a Sequence?
A Sequence are the statements are executed in the order they are written.
32 of 33
What is Selection?
Selection is the next statement to be executed depends on whether the condition being tested is True or False.
33 of 33
Other cards in this set
Card 2
Front
What is Abstraction?
Back
This is the process of making an easier to understand version of a complex system by focusing on necessary information.
Comments
No comments have yet been made