1
Q
What is an algorithm?
A
A series of steps (sequence) to solve a specific problem.
2
Q
State 3 methods of defining algorithms.
A
- Flowcharts
- Pseudocode
- Structured english
3
Q
What is pseudocode? (2)
A
- A method of writing code without using syntax of any particular language.
- Shows the structure of a solution.
4
Q
What is structured English?
A
A cross between pseudocode and written English.
5
Q
What is a variable?
A
A named space in the memory that contains a single piece of data.
6
Q
What is a constant?
A
The same as a variable except the data
cannot be changed in the program.
7
Q
Name 3 techniques to make code readable.
A
- Indenting the code
- Writing annotations to explain the code to programmers
- Using appropriate identifiers
8
Q
State 2 types of a variable.
A
- Local
- Global
9
Q
What is a local variable? (2)
A
- Only exists until the subroutine in which it was created ends.
- Only visible in that subroutine.
10
Q
What is a global variable?
A
Exists throughout the program and can be read/ written from any subroutine.
11
Q
What is a parameter?
A
It is an item of data that is passed from one subroutine to another
12
Q
What are the two ways of passing a parameter?
A
- Passing by value.
- Passing by reference
13
Q
What is passing by value? (2)
A
- A copy of a value passed from one subroutine to another.
- The original value cannot be changed by the subroutine that receives it
14
Q
What is passing by reference? (2)
A
- An actual variable is passed from one subroutine to another
- The original value can be changed by the subroutine that receives the variable
15
Q
What is difference between 5 DIV 3 and 5 MOD 3?
A
5 DIV 3 = 1 i.e. integer division
5 MOD 3=2 i.e. remainder after division
16
Q
What is sorting?
A
Placing data into a specified order .e.g. alphabetical, numerical or other
17
Q
State 2 sorts.
A
- Bubble sort
- Insertion sort
18
Q
How does Bubble Sort work? (4)
A
- A pass is made through the data, comparing each value with the following one, and swapping if necessary.
- It compares the 1st with 2nd, 2nd with 3rd and so on.
- When it has worked to the end it has completed one pass.
- A number of passes is made until the data is in order/ no swaps
19
Q
When is Bubble sort most appropriate to use?
A
Works best on smaller, nearly sorted data.
20
Q
How does Insertion Sort work? (4)
A
- Takes an element out the data and compared with a sorted list
- Items in the sorted list are moved up/ down to enable new items to be added in the correct place.
- It initially assumes only the first number is in the correct order.
- With each pass the number of items assumed correct increases by one.
21
Q
When does insertion sort works best?
A
Works best on small, jumbled up files.
22
Q
What is searching?
A
Locating an item in a data structure
23
Q
Name two types of searches.
A
- Linear search
- Binary search
24
Q
How does a linear search work?
A
Starts at one end of a data structure and examines every element in order until the item is found.
25
When is a linear search faster? (2)
1. Number of items to search is small.
2. The item to search is one of the first data items in the list
26
How does a binary search work? (4)
1. Start at middle & check if value to be found is larger or smaller than the current value.
2. If larger, discard smaller values. If smaller,
discard larger values.
3. Search in the middle of the selected data and repeat step 1. This eliminates half the data with every pass.
4. Continue until the number is found or there is no more data to search.
27
When is binary search faster?
Good on large sorted sets of data
28
What is Top-Down Design?
Breaking down a problem into smaller problems, and smaller problems into smaller problems until the problems are simple and can be solved easily.
29
What is a sequence?
Lines of code that are executed one after another in the order in which they are written.
30
What is a selection?
One path through the code will be selected if a condition is met. An example of selection code is IF.
31
What is repetition?
Code that is executed more than once. Example: For, While, loop.
32
What is count?
An integer that keeps track of how many times a code has been run.
33
What is a Rogue Value? (2)
1. An invalid value to represent a special case.
2. Often used as an exit condition from a loop
34
What is modular programming?
The splitting up of a large piece of code into smaller chunks (modules) of code that perform a specific task.
35
State 4 advantages of using modular programming.
1. Different modules can be allocated to different programmers.
2. Programmers with different skills are given tasks appropriately.
3. Modules can be designed separately and tested separately.
4. Modules can be reused reducing risk of bugs.
36
What is a subroutine?
It is a piece of code that performs a specific task.
37
What is a function?
Code that must return a value.
38
What is compression?
Making a file occupy less space on a disk.
39
State 4 advantages of using compression.
1. Can transfer files faster
2. Means that the disk has more space and can hold more files.
3. Faster reading and writing of a file.
4 Helpful for streaming and downloading files
40
State 2 disadvantages of using compression.
1. Can result in lower quality of files.
2. You may lose information that can’t be recovered.
41
State 2 types of compression.
1. Lossy
2. Lossless
42
What is lossy compression?
Removing data to decrease the file size.
43
What is Lossless compression? (2)
1. Shrinks the whole file while keeping all of the quality.
2. Works by finding repeated patterns and compressing those patterns.
44
What is lossless compression based on?
The LZ compression method developed by Lempel and Ziv.
45
State 2 advantages of lossless compression,
1. The file can be restored to its original quality.
2. The file can be compressed up to 50% without losing quality.
46
State 2 disadvantages of lossless compression.
1. A lossless compressed file is not as small as a lossy compressed file
2. Does not work well with random data as it is dependent on patterns in data
47
What is run- length encoding? (2)
1. Compressing clusters of number. E.g. pictures with lots of the same color.
2. A form of lossless compression
48
Give an example of run- length encoding.
Original: 0000 0000 0000 1111 1000 0000
Compressed: 12(0); 5(1); 7(0)
49
Why is testing used?
To verify that a program is bug free.
50
List 5 standard tests on data entry (E.g. input an integer between 1-10).
1. Normal data (5)
2. Extreme data (1,10)
3. Invalid data (0,11)
4. Data type (hello)
5. Missing data ()
51
Why is normal data used?
To see if the program processes normal data.
52
Why is extreme data used?
While valid it is as invalid as possible.
53
Why is invalid data used?
Should not work even if close to valid number.
54
Why is data type used?
Testing to see if an error message appears.
55
Why is missing data used?
To check the code doesn’t crash when data is missing.
AS- Level WJEC CS SAQ
flashcards
Decks in class (14)
# Cards
-
1.1 Hardware and communication96
-
1.2 Logical operations18
-
1.3 Data Transmission32
-
1.4 Data Representation and Data Types54
-
1.5 Data Structures7
-
1.6 Organisation and Structure of Data56
-
1.7 Database Systems20
-
1.8 The Operating System53
-
1.9 Algorithms and Programming55
-
1.12 Software Engineering17
-
1.14 Different Types of Software Systems40
-
1.15 Practical Programming16
-
1.16 Data Security0
-
1.17 Economic, Moral, Legal, Ethical and Cultural Issues13
