Font size
S
M
L
XL
Worksheetscomputer science paper 1
Total questions: 93
Worksheet time: 47mins
Name
Class
Date
1.
Algorithm
a)
Variables of this type remain in memory even when a subroutine ends, their scope is the whole program
b)
A statement that assigns a value to a variable. The right side of the equals sign can be any expression. These are valid: health ← 100 fare ← 5 + 0.5 * miles
c)
A sequence of steps that can be followed to complete a task.
d)
A type of translator which converts a high-level language in to machine code all at once
2.
Decomposition
a)
Precise, English-like description of an algorithm. It has no specific syntax, so input name and if name is bob are valid instructions.
b)
Boolean operator that returns a true value only if both operands are true
c)
Breaking a problem into a number of sub-problems, so that each sub- problem accomplishes an identifiable task, which might itself be further subdivided.
d)
This translator converts a high-level language into machine code one line at a time and then executes it, it's slower but interpreted code is quicker to write and easier to update
3.
Abstraction
a)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
b)
Coding a second programming construct inside the first. You can do this with selection and iteration
c)
A collection of related data items called fields, often stored as a row in a database, it represents something in the real world like a person or product
d)
The process of removing unnecessary detail from a problem.
4.
Pseudo-code
a)
The numeric value of a character in a the character set. In ASCII, "A" is 65
b)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
c)
A statement that assigns a value to a variable. The right side of the equals sign can be any expression. These are valid: health ← 100 fare ← 5 + 0.5 * miles
d)
Precise, English-like description of an algorithm. It has no specific syntax, so input name and if name is bob are valid instructions.
5.
Flowchart
a)
Boolean operator that returns a true value only if both operands are true
b)
A programming construct where the code makes a decision, and takes one of several branches, usually coded with IF-THEN-ELSE
c)
This statement starts a condition-controlled loop with the condition at the start, so the loop will only begin if the condition is true
d)
A visual representation of an algorithm using specific shapes including rectangle, diamond and parallelogram.
6.
IPO
a)
Breaking a problem into a number of sub-problems, so that each sub- problem accomplishes an identifiable task, which might itself be further subdivided.
b)
Where inputs, processing and outputs are taking place within an algorithm.
c)
A sequence of steps that can be followed to complete a task.
d)
The process of removing unnecessary detail from a problem.
7.
Linear search
a)
A data type also called floating point numbers, they have a decimal part, for example 1.5, 0.935 or the value of Pi
b)
A searching algorithm which looks at every element in turn until it finds the target, it is slow but works even on unsorted data
c)
Boolean operator that returns a true value only if both operands are true
d)
The systematic process of running a program repeatedly with different input data and checking the output is as expected, revealing errors
8.
Binary search
a)
It cannot change. A named memory location for something that stays the same. Examples are PI, Number_of_Levels, MAXHEALTH
b)
A searching algorithm that divides the search space in half each time until it finds the target, faster than linear but requires the array to be sorted
c)
Variables of this type remain in memory even when a subroutine ends, their scope is the whole program
d)
A programming construct where the code makes a decision, and takes one of several branches, usually coded with IF-THEN-ELSE
9.
Merge sort
a)
A low-level language which uses mnemonics such as LDA, ADD to represent machine code instructions
b)
A subroutine which does not return a value. For example it might redraw the screen or write a record to a file
c)
A very efficient sorting algorithm that repeatedly breaks down a list into smaller lists, then repeatedly merges them back together in order
d)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
10.
Bubble sort
a)
A sorting algorithm that passes over the list many times, swapping adjacent items if they are in the wrong order. Not very efficient.
b)
A function in pseudo-code that returns part of a string when we pass it a starting position and length
c)
An error that occurs when code runs but produces unexpected results. E.g. adding instead of subtracting or stopping a loop too soon. It is detected by systematic testing with a trace table
d)
A searching algorithm that divides the search space in half each time until it finds the target, faster than linear but requires the array to be sorted
11.
Integer
a)
A statement that starts a condition-controlled loop with the condition at the end in an UNTIL statement, it will run once even if the condition is false
b)
A type of translator which converts a high-level language in to machine code all at once
c)
The data type of a whole number e.g. 5, 999 or -4
d)
Repeats instructions a until a condition is met, also called "condition-controlled". Uses WHILE or REPEAT... UNTIL in high-level languages
12.
Real
a)
A function that returns the numeric location of a character within a larger string (counting from 0)
b)
A data type also called floating point numbers, they have a decimal part, for example 1.5, 0.935 or the value of Pi
c)
The name we give to variables, constants and subroutines, it should be meaningful
d)
A sorting algorithm that passes over the list many times, swapping adjacent items if they are in the wrong order. Not very efficient.
13.
Boolean
a)
This data type has only two values, TRUE and FALSE
b)
A programming construct where instructions follow, one after the other
c)
An error that occurs when the code runs but fails during the operation. Usually caused by file handling problems or data types being incorrect.
d)
A subroutine which does not return a value. For example it might redraw the screen or write a record to a file
14.
Character
a)
Boolean operator that returns a true value only if both operands are true
b)
Where inputs, processing and outputs are taking place within an algorithm.
c)
A visual representation of an algorithm using specific shapes including rectangle, diamond and parallelogram.
d)
The data type of a single character e.g. "A" or "$"
15.
String
a)
This statement starts a definite iteration with the amount of iterations at the start, it will run a set number of times.
b)
An error because the rules of the language have been broken, such as forgetting a bracket or mis-spelling a keyword
c)
This data type stores a series of characters, e.g. "Zak", "MK44 5AB" or "123456789"
d)
The arithmetic operator that divides one operand by another e.g. total / 7
16.
Variable
a)
A collection of related data items called fields, often stored as a row in a database, it represents something in the real world like a person or product
b)
A subroutine which does not return a value. For example it might redraw the screen or write a record to a file
c)
A subroutine which returns a value. It might return a random dice roll, calculate a ticket price or determine your exam grade
d)
A named memory location holding a single value that can change during the program, e.g. name, age, x, y
17.
Constant
a)
It cannot change. A named memory location for something that stays the same. Examples are PI, Number_of_Levels, MAXHEALTH
b)
Breaking a problem into a number of sub-problems, so that each sub- problem accomplishes an identifiable task, which might itself be further subdivided.
c)
The data type of a whole number e.g. 5, 999 or -4
d)
This data type stores a series of characters, e.g. "Zak", "MK44 5AB" or "123456789"
18.
Assignment
a)
A named memory location holding a single value that can change during the program, e.g. name, age, x, y
b)
A subroutine which returns a value. It might return a random dice roll, calculate a ticket price or determine your exam grade
c)
A statement that assigns a value to a variable. The right side of the equals sign can be any expression. These are valid: health ← 100 fare ← 5 + 0.5 * miles
d)
A data type also called floating point numbers, they have a decimal part, for example 1.5, 0.935 or the value of Pi
19.
Sequence
a)
A data type also called floating point numbers, they have a decimal part, for example 1.5, 0.935 or the value of Pi
b)
A programming construct where instructions follow, one after the other
c)
A visual representation of an algorithm using specific shapes including rectangle, diamond and parallelogram.
d)
A low-level language which uses mnemonics such as LDA, ADD to represent machine code instructions
20.
Iteration
a)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
b)
This translator converts a high-level language into machine code one line at a time and then executes it, it's slower but interpreted code is quicker to write and easier to update
c)
A named memory location holding a single value that can change during the program, e.g. name, age, x, y
d)
A code construct where the instructions repeat. Can be definite/count-controlled or indefinite/condition-controlled.
21.
Selection
a)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
b)
A searching algorithm that divides the search space in half each time until it finds the target, faster than linear but requires the array to be sorted
c)
A program which converts source code into code which the processor can execute, this can be a compiler, interpreter or assembler
d)
A programming construct where the code makes a decision, and takes one of several branches, usually coded with IF-THEN-ELSE
22.
Subroutine
a)
A low-level language which the CPU can process directly, and consists of only binary codes which are very hard to write directly, to change and to debug
b)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
c)
A small set of instructions that completes a specific task, sometimes called a subprogram. It can be a function or procedure
d)
Programming languages which are a much closer representation to the instruction set of the processor. These include assembly language and machine code.
23.
Procedure
a)
A subroutine which does not return a value. For example it might redraw the screen or write a record to a file
b)
The data type of a single character e.g. "A" or "$"
c)
A sorting algorithm that passes over the list many times, swapping adjacent items if they are in the wrong order. Not very efficient.
d)
A programming construct where instructions follow, one after the other
24.
Function
a)
A named memory location holding a single value that can change during the program, e.g. name, age, x, y
b)
Coding a second programming construct inside the first. You can do this with selection and iteration
c)
A subroutine which returns a value. It might return a random dice roll, calculate a ticket price or determine your exam grade
d)
The data type of a whole number e.g. 5, 999 or -4
25.
Definite iteration
a)
Repeats instructions a set number of times, also called "count-controlled". Uses a FOR loop in most high-level languages
b)
This data type has only two values, TRUE and FALSE
c)
Precise, English-like description of an algorithm. It has no specific syntax, so input name and if name is bob are valid instructions.
d)
The data type of a whole number e.g. 5, 999 or -4
26.
Indefinite iteration
a)
A searching algorithm which looks at every element in turn until it finds the target, it is slow but works even on unsorted data
b)
A named memory location holding a single value that can change during the program, e.g. name, age, x, y
c)
Repeats instructions a until a condition is met, also called "condition-controlled". Uses WHILE or REPEAT... UNTIL in high-level languages
d)
Boolean operator that negates its operand, meaning True becomes False and vice versa
27.
For loop
a)
A program which converts source code into code which the processor can execute, this can be a compiler, interpreter or assembler
b)
A statement that assigns a value to a variable. The right side of the equals sign can be any expression. These are valid: health ← 100 fare ← 5 + 0.5 * miles
c)
This statement starts a definite iteration with the amount of iterations at the start, it will run a set number of times.
d)
The process of removing unnecessary detail from a problem.
28.
While loop
a)
A sequence of steps that can be followed to complete a task.
b)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
c)
A programming construct where the code makes a decision, and takes one of several branches, usually coded with IF-THEN-ELSE
d)
This statement starts a condition-controlled loop with the condition at the start, so the loop will only begin if the condition is true
29.
Repeat until
a)
A function that returns the numeric location of a character within a larger string (counting from 0)
b)
The arithmetic operator that divides one operand by another e.g. total / 7
c)
A function in pseudo-code that returns part of a string when we pass it a starting position and length
d)
A statement that starts a condition-controlled loop with the condition at the end in an UNTIL statement, it will run once even if the condition is false
30.
Nesting
a)
Coding a second programming construct inside the first. You can do this with selection and iteration
b)
A searching algorithm which looks at every element in turn until it finds the target, it is slow but works even on unsorted data
c)
Programming languages which are a much closer representation to the instruction set of the processor. These include assembly language and machine code.
d)
A function that determines how long a string is, i.e. the character count
31.
Identifier names
a)
A searching algorithm that divides the search space in half each time until it finds the target, faster than linear but requires the array to be sorted
b)
Repeats instructions a until a condition is met, also called "condition-controlled". Uses WHILE or REPEAT... UNTIL in high-level languages
c)
The name we give to variables, constants and subroutines, it should be meaningful
d)
A programming construct where the code makes a decision, and takes one of several branches, usually coded with IF-THEN-ELSE
32.
Real division
a)
A function in pseudo-code that returns part of a string when we pass it a starting position and length
b)
The arithmetic operator that divides one operand by another e.g. total / 7
c)
Repeats instructions a until a condition is met, also called "condition-controlled". Uses WHILE or REPEAT... UNTIL in high-level languages
d)
Boolean operator that negates its operand, meaning True becomes False and vice versa
33.
Integer division
a)
Or floor division, the quotient arithmetic operator divides operands giving only the whole number result. E.g. 9 DIV 4 = 2. Python uses // for this.
b)
A programming construct where the code makes a decision, and takes one of several branches, usually coded with IF-THEN-ELSE
c)
An error that occurs when code runs but produces unexpected results. E.g. adding instead of subtracting or stopping a loop too soon. It is detected by systematic testing with a trace table
d)
Extreme test data at the edges of the valid range. Phone battery percentage must be between 0 and 100, so these test data values would be -1, 0, 100 and 101
34.
Remainders
a)
The process of removing unnecessary detail from a problem.
b)
A code construct where the instructions repeat. Can be definite/count-controlled or indefinite/condition-controlled.
c)
The amount left over when one number is divided by another. Calculated with the MOD operator. Python uses % for this.
d)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
35.
NOT
a)
It cannot change. A named memory location for something that stays the same. Examples are PI, Number_of_Levels, MAXHEALTH
b)
Boolean operator that negates its operand, meaning True becomes False and vice versa
c)
The process of removing unnecessary detail from a problem.
d)
Variables of this type remain in memory even when a subroutine ends, their scope is the whole program
36.
AND
a)
A value which is given back to the section of code that calls a function.
b)
A very efficient sorting algorithm that repeatedly breaks down a list into smaller lists, then repeatedly merges them back together in order
c)
Boolean operator that returns a true value only if both operands are true
d)
This data type has only two values, TRUE and FALSE
37.
OR
a)
Precise, English-like description of an algorithm. It has no specific syntax, so input name and if name is bob are valid instructions.
b)
Boolean operator that returns a true value if either operand is true
c)
A sorting algorithm that passes over the list many times, swapping adjacent items if they are in the wrong order. Not very efficient.
d)
A function that returns the numeric location of a character within a larger string (counting from 0)
38.
Array
a)
A sorting algorithm that passes over the list many times, swapping adjacent items if they are in the wrong order. Not very efficient.
b)
Or floor division, the quotient arithmetic operator divides operands giving only the whole number result. E.g. 9 DIV 4 = 2. Python uses // for this.
c)
A data structure that stores many data items of the same data type, can be one-dimensional, two-dimensional or more. (In Python we use a list for this)
d)
A subroutine which returns a value. It might return a random dice roll, calculate a ticket price or determine your exam grade
39.
Record
a)
A collection of related data items called fields, often stored as a row in a database, it represents something in the real world like a person or product
b)
A small set of instructions that completes a specific task, sometimes called a subprogram. It can be a function or procedure
c)
Precise, English-like description of an algorithm. It has no specific syntax, so input name and if name is bob are valid instructions.
d)
A value which is given back to the section of code that calls a function.
40.
String length
a)
This data type stores a series of characters, e.g. "Zak", "MK44 5AB" or "123456789"
b)
A small set of instructions that completes a specific task, sometimes called a subprogram. It can be a function or procedure
c)
A function that determines how long a string is, i.e. the character count
d)
A searching algorithm that divides the search space in half each time until it finds the target, faster than linear but requires the array to be sorted
41.
Character position
a)
A function that returns the numeric location of a character within a larger string (counting from 0)
b)
Programming languages which are a much closer representation to the instruction set of the processor. These include assembly language and machine code.
c)
A low-level language which uses mnemonics such as LDA, ADD to represent machine code instructions
d)
A code construct where the instructions repeat. Can be definite/count-controlled or indefinite/condition-controlled.
42.
Substring
a)
A function in pseudo-code that returns part of a string when we pass it a starting position and length
b)
An error that occurs when the code runs but fails during the operation. Usually caused by file handling problems or data types being incorrect.
c)
Repeats instructions a until a condition is met, also called "condition-controlled". Uses WHILE or REPEAT... UNTIL in high-level languages
d)
A visual representation of an algorithm using specific shapes including rectangle, diamond and parallelogram.
43.
Concatenation
a)
The numeric value of a character in a the character set. In ASCII, "A" is 65
b)
Repeats instructions a until a condition is met, also called "condition-controlled". Uses WHILE or REPEAT... UNTIL in high-level languages
c)
A type of translator which translates assembly language in to machine code
d)
Joining two strings together, usually uses the + operator, for example fullname = firstname + lastname
44.
Character code
a)
Test data that is expected or typical, e.g. the code if age < 18 then might be tested with data of 14
b)
The numeric value of a character in a the character set. In ASCII, "A" is 65
c)
A low-level language which the CPU can process directly, and consists of only binary codes which are very hard to write directly, to change and to debug
d)
This data type has only two values, TRUE and FALSE
45.
Parameters
a)
A variable declared in a subroutine definition, a and b are parameters in this code: SUBROUTINE add(a, b) result ← a + b RETURN result ENDSUBROUTINE
b)
The numeric value of a character in a the character set. In ASCII, "A" is 65
c)
A named memory location holding a single value that can change during the program, e.g. name, age, x, y
d)
The data type of a whole number e.g. 5, 999 or -4
46.
Return
a)
A low-level language which the CPU can process directly, and consists of only binary codes which are very hard to write directly, to change and to debug
b)
The data type of a single character e.g. "A" or "$"
c)
A value which is given back to the section of code that calls a function.
d)
The systematic process of running a program repeatedly with different input data and checking the output is as expected, revealing errors
47.
Local
a)
Variables with limited scope, they are usually deleted when the subroutine ends, thus saving memory and preventing errors
b)
A searching algorithm which looks at every element in turn until it finds the target, it is slow but works even on unsorted data
c)
A programming construct where instructions follow, one after the other
d)
A function that determines how long a string is, i.e. the character count
48.
Global
a)
Where inputs, processing and outputs are taking place within an algorithm.
b)
Variables of this type remain in memory even when a subroutine ends, their scope is the whole program
c)
A subroutine which does not return a value. For example it might redraw the screen or write a record to a file
d)
This data type stores a series of characters, e.g. "Zak", "MK44 5AB" or "123456789"
49.
Syntax error
a)
Precise, English-like description of an algorithm. It has no specific syntax, so input name and if name is bob are valid instructions.
b)
The arithmetic operator that divides one operand by another e.g. total / 7
c)
An error because the rules of the language have been broken, such as forgetting a bracket or mis-spelling a keyword
d)
It cannot change. A named memory location for something that stays the same. Examples are PI, Number_of_Levels, MAXHEALTH
50.
Logic error
a)
This statement starts a condition-controlled loop with the condition at the start, so the loop will only begin if the condition is true
b)
Precise, English-like description of an algorithm. It has no specific syntax, so input name and if name is bob are valid instructions.
c)
A low-level language which the CPU can process directly, and consists of only binary codes which are very hard to write directly, to change and to debug
d)
An error that occurs when code runs but produces unexpected results. E.g. adding instead of subtracting or stopping a loop too soon. It is detected by systematic testing with a trace table
51.
Run-time error
a)
An error that occurs when the code runs but fails during the operation. Usually caused by file handling problems or data types being incorrect.
b)
This data type has only two values, TRUE and FALSE
c)
A function that returns the numeric location of a character within a larger string (counting from 0)
d)
Extreme test data at the edges of the valid range. Phone battery percentage must be between 0 and 100, so these test data values would be -1, 0, 100 and 101
52.
Testing
a)
The systematic process of running a program repeatedly with different input data and checking the output is as expected, revealing errors
b)
A subroutine which returns a value. It might return a random dice roll, calculate a ticket price or determine your exam grade
c)
This statement starts a condition-controlled loop with the condition at the start, so the loop will only begin if the condition is true
d)
A variable declared in a subroutine definition, a and b are parameters in this code: SUBROUTINE add(a, b) result ← a + b RETURN result ENDSUBROUTINE
53.
Normal data
a)
A function in pseudo-code that returns part of a string when we pass it a starting position and length
b)
Programming languages which are a much closer representation to the instruction set of the processor. These include assembly language and machine code.
c)
A code construct where the instructions repeat. Can be definite/count-controlled or indefinite/condition-controlled.
d)
Test data that is expected or typical, e.g. the code if age < 18 then might be tested with data of 14
54.
Boundary data
a)
A type of translator which converts a high-level language in to machine code all at once
b)
Extreme test data at the edges of the valid range. Phone battery percentage must be between 0 and 100, so these test data values would be -1, 0, 100 and 101
c)
A function that returns the numeric location of a character within a larger string (counting from 0)
d)
Test data that is expected or typical, e.g. the code if age < 18 then might be tested with data of 14
55.
Erroneous data
a)
A statement that assigns a value to a variable. The right side of the equals sign can be any expression. These are valid: health ← 100 fare ← 5 + 0.5 * miles
b)
A statement that starts a condition-controlled loop with the condition at the end in an UNTIL statement, it will run once even if the condition is false
c)
The amount left over when one number is divided by another. Calculated with the MOD operator. Python uses % for this.
d)
Data of the wrong type or outside the expected range. For example a string where a number is expected, or an angle of 400 degrees. The program should reject this but not fail
56.
Low-level language
a)
A type of translator which converts a high-level language in to machine code all at once
b)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
c)
A searching algorithm which looks at every element in turn until it finds the target, it is slow but works even on unsorted data
d)
Programming languages which are a much closer representation to the instruction set of the processor. These include assembly language and machine code.
57.
High-level language
a)
An error that occurs when the code runs but fails during the operation. Usually caused by file handling problems or data types being incorrect.
b)
This data type has only two values, TRUE and FALSE
c)
A subroutine which does not return a value. For example it might redraw the screen or write a record to a file
d)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
58.
Machine code
a)
The amount left over when one number is divided by another. Calculated with the MOD operator. Python uses % for this.
b)
Programing languages designed to make it easier for humans to understand and write computer programs, than using low-level languages. Examples include Python and C#.
c)
A low-level language which the CPU can process directly, and consists of only binary codes which are very hard to write directly, to change and to debug
d)
A function in pseudo-code that returns part of a string when we pass it a starting position and length
59.
Assembly
a)
A low-level language which uses mnemonics such as LDA, ADD to represent machine code instructions
b)
Repeats instructions a set number of times, also called "count-controlled". Uses a FOR loop in most high-level languages
c)
A programming construct where the code makes a decision, and takes one of several branches, usually coded with IF-THEN-ELSE
d)
This statement starts a condition-controlled loop with the condition at the start, so the loop will only begin if the condition is true
60.
Translator
a)
Joining two strings together, usually uses the + operator, for example fullname = firstname + lastname
b)
A program which converts source code into code which the processor can execute, this can be a compiler, interpreter or assembler
c)
Precise, English-like description of an algorithm. It has no specific syntax, so input name and if name is bob are valid instructions.
d)
A sorting algorithm that passes over the list many times, swapping adjacent items if they are in the wrong order. Not very efficient.
61.
Interpreter
a)
A visual representation of an algorithm using specific shapes including rectangle, diamond and parallelogram.
b)
A type of translator which translates assembly language in to machine code
c)
A program which converts source code into code which the processor can execute, this can be a compiler, interpreter or assembler
d)
This translator converts a high-level language into machine code one line at a time and then executes it, it's slower but interpreted code is quicker to write and easier to update
62.
Compiler
a)
Where inputs, processing and outputs are taking place within an algorithm.
b)
The name we give to variables, constants and subroutines, it should be meaningful
c)
The numeric value of a character in a the character set. In ASCII, "A" is 65
d)
A type of translator which converts a high-level language in to machine code all at once
63.
Assembler
a)
The data type of a single character e.g. "A" or "$"
b)
A variable declared in a subroutine definition, a and b are parameters in this code: SUBROUTINE add(a, b) result ← a + b RETURN result ENDSUBROUTINE
c)
A type of translator which translates assembly language in to machine code
d)
Variables of this type remain in memory even when a subroutine ends, their scope is the whole program
64.
Algorithm Efficiency
a)
Looks for items in an ordered list: 1) find middle item in ordered list (n+1/2). 2) if this is the item being searched for, stop the search. 3) if not, compare the item you are looking for to the middle item - if it comes before middle item, get rid of second half of list ; if it comes after middle item, get rid of first half of list. 4) repeat steps 1-3 on the smaller list until the item being searched for is found.
b)
An image made up of pixels
c)
The length of time it takes to run an algorithm
d)
C#
65.
Bubble Sort
a)
Subroutines can be developed in isolation, independently or separately; Easier to discover errors/testing is more effective (than without a structure); Subroutines can be updated without affecting the overall program.
b)
Techniques for developing programs:.Writing re-useable functions. Giving functions / variables meaningful names. Passing parameters (values) to the function. Functions return values.
c)
A sorting algorithm: 1) Each item in a list is compared to the one next to it. 2) If first item is greater - swap places. 3) Compare next items - until end of list is reached. 4) Repeat the process until the array is sorted.
d)
AND, OR, NOT
66.
Merge Sort
a)
A sorting algorithm - example of a divide-and-conquer algorithm: 1) splits list in half (2nd sub-list should start at middle item). 2) keeps repeating step one on each sub-list until all the lists only contain one item. 3) merge pairs of sub-lists and sort the items into the right order. 4) repeat step 3 until you have merged all the sub-lists together.
b)
File size = colour depth x number of pixels
c)
erroneous, boundary, normal
d)
Subroutines can be developed in isolation, independently or separately; Easier to discover errors/testing is more effective (than without a structure); Subroutines can be updated without affecting the overall program.
67.
Linear search
a)
File size = colour depth x number of pixels
b)
Final testing happens once the completed program is finished. During iterative testing you might test individual blocks of code or subroutines. Final testing happens when all of those elements have been put together into one program.
c)
In general, much more efficient and quicker than bubble sort for large lists, and has similar running time for short lists. It has a very consistent running time regardless of how ordered the items in the original list are.
d)
Can look for items in unordered lists: 1) look at first item in unordered list. 2) if this is the item being searched for, stop the search. 3) if not, look at next item in the list. 4) repeat until you find the item being searched for or the whole list has been checked.
68.
Binary VS Linear search
a)
IF statements, CASE statements.
b)
It is when you test that your program works throughout its creation- by running your code and testing often, you will find that errors are much easier to detect and correct.
c)
Linear is much simpler than binary but not as efficient. Linear works on any type of list, it doesn't have to be ordered. For small ordered lists, the difference in efficiency doesn't really matter so the run time of both algorithms will be similar. For large ordered lists the run time of binary search will generally be much quicker than linear.
d)
A sorting algorithm: 1) Each item in a list is compared to the one next to it. 2) If first item is greater - swap places. 3) Compare next items - until end of list is reached. 4) Repeat the process until the array is sorted.
69.
Binary search
a)
Looks for items in an ordered list: 1) find middle item in ordered list (n+1/2). 2) if this is the item being searched for, stop the search. 3) if not, compare the item you are looking for to the middle item - if it comes before middle item, get rid of second half of list ; if it comes after middle item, get rid of first half of list. 4) repeat steps 1-3 on the smaller list until the item being searched for is found.
b)
An image made up of pixels
c)
The length of time it takes to run an algorithm
d)
It is an inefficient way to sort a list. It is slow for a large list of items.
70.
Structured programming
a)
Values passed on from procedures/functions
b)
IF statements, CASE statements.
c)
The length of time it takes to run an algorithm
d)
Techniques for developing programs:.Writing re-useable functions. Giving functions / variables meaningful names. Passing parameters (values) to the function. Functions return values.
71.
Advantages of structured programming
a)
AND, OR, NOT
b)
Programs easier to read. Easier to test / find / correct errors You can reuse code. It is easy to implement new features. Individual subroutines and modules can be fixed and updated without affecting the rest of the program.
c)
It is an inefficient way to sort a list. It is slow for a large list of items.
d)
Can look for items in unordered lists: 1) look at first item in unordered list. 2) if this is the item being searched for, stop the search. 3) if not, look at next item in the list. 4) repeat until you find the item being searched for or the whole list has been checked.
72.
bitmap image
a)
An image made up of pixels
b)
Final testing happens once the completed program is finished. During iterative testing you might test individual blocks of code or subroutines. Final testing happens when all of those elements have been put together into one program.
c)
A programmable device that takes in data, processes it into useful information, and then outputs the information so it can be used.
d)
C#
73.
pixel
a)
They can only be accessed within structure they are declared in. They only exist when subroutine is executing
b)
It is simple algorithm that can easily be implemented on a computer. It is an efficient way to check if a list is already in order. It doesn't use very much memory as all sorting is done using original list.
c)
It is an inefficient way to sort a list. It is slow for a large list of items.
d)
a single point of colour in an image
74.
vector image
a)
An image created using coordinates and properties of lines and shapes
b)
A sorting algorithm: 1) Each item in a list is compared to the one next to it. 2) If first item is greater - swap places. 3) Compare next items - until end of list is reached. 4) Repeat the process until the array is sorted.
c)
In general, much more efficient and quicker than bubble sort for large lists, and has similar running time for short lists. It has a very consistent running time regardless of how ordered the items in the original list are.
d)
Python
75.
how to calculate file size of an image
a)
a single point of colour in an image
b)
File size = colour depth x number of pixels
c)
erroneous, boundary, normal
d)
Techniques for developing programs:.Writing re-useable functions. Giving functions / variables meaningful names. Passing parameters (values) to the function. Functions return values.
76.
Argument
a)
An image made up of pixels
b)
Can look for items in unordered lists: 1) look at first item in unordered list. 2) if this is the item being searched for, stop the search. 3) if not, look at next item in the list. 4) repeat until you find the item being searched for or the whole list has been checked.
c)
Values passed on from procedures/functions
d)
In general, much more efficient and quicker than bubble sort for large lists, and has similar running time for short lists. It has a very consistent running time regardless of how ordered the items in the original list are.
77.
Pros of bubble sort algorithm
a)
IF statements, CASE statements.
b)
Binary
c)
It is simple algorithm that can easily be implemented on a computer. It is an efficient way to check if a list is already in order. It doesn't use very much memory as all sorting is done using original list.
d)
A programmable device that takes in data, processes it into useful information, and then outputs the information so it can be used.
78.
Cons of bubble sort algorithm
a)
It is simple algorithm that can easily be implemented on a computer. It is an efficient way to check if a list is already in order. It doesn't use very much memory as all sorting is done using original list.
b)
The length of time it takes to run an algorithm
c)
It is an inefficient way to sort a list. It is slow for a large list of items.
d)
A sorting algorithm - example of a divide-and-conquer algorithm: 1) splits list in half (2nd sub-list should start at middle item). 2) keeps repeating step one on each sub-list until all the lists only contain one item. 3) merge pairs of sub-lists and sort the items into the right order. 4) repeat step 3 until you have merged all the sub-lists together.
79.
Pros of merge sort
a)
File size = colour depth x number of pixels
b)
It is an inefficient way to sort a list. It is slow for a large list of items.
c)
a single point of colour in an image
d)
In general, much more efficient and quicker than bubble sort for large lists, and has similar running time for short lists. It has a very consistent running time regardless of how ordered the items in the original list are.
80.
Cons of merge sort
a)
AND, OR, NOT
b)
It is simple algorithm that can easily be implemented on a computer. It is an efficient way to check if a list is already in order. It doesn't use very much memory as all sorting is done using original list.
c)
Even if list is sorted, it still goes through the whole splitting and merging process so bubble sort may be quicker in some cases. It uses more memory than bubble sort because it has to create additional lists.
d)
File size = colour depth x number of pixels
81.
Example of high-level language
a)
AND, OR, NOT
b)
Final testing happens once the completed program is finished. During iterative testing you might test individual blocks of code or subroutines. Final testing happens when all of those elements have been put together into one program.
c)
C#
d)
Linear is much simpler than binary but not as efficient. Linear works on any type of list, it doesn't have to be ordered. For small ordered lists, the difference in efficiency doesn't really matter so the run time of both algorithms will be similar. For large ordered lists the run time of binary search will generally be much quicker than linear.
82.
Example of low-level language
a)
Python
b)
It is an inefficient way to sort a list. It is slow for a large list of items.
c)
A sorting algorithm - example of a divide-and-conquer algorithm: 1) splits list in half (2nd sub-list should start at middle item). 2) keeps repeating step one on each sub-list until all the lists only contain one item. 3) merge pairs of sub-lists and sort the items into the right order. 4) repeat step 3 until you have merged all the sub-lists together.
d)
erroneous, boundary, normal
83.
example of a language that can be executed by a computer
a)
Binary
b)
An image made up of pixels
c)
a single point of colour in an image
d)
In general, much more efficient and quicker than bubble sort for large lists, and has similar running time for short lists. It has a very consistent running time regardless of how ordered the items in the original list are.
84.
reasons why a programmer would program in a high-level language
a)
erroneous, boundary, normal
b)
In general, much more efficient and quicker than bubble sort for large lists, and has similar running time for short lists. It has a very consistent running time regardless of how ordered the items in the original list are.
c)
It is an inefficient way to sort a list. It is slow for a large list of items.
d)
It is easier to debug. It is shorter than low-level languages. It provides data structures. It has built in functions and subroutines.
85.
examples of selection
a)
Values passed on from procedures/functions
b)
a single point of colour in an image
c)
It is when you test that your program works throughout its creation- by running your code and testing often, you will find that errors are much easier to detect and correct.
d)
IF statements, CASE statements.
86.
examples of iteration
a)
WHILE loops, FOR loops, REPEAT-UNTIL loops
b)
Can look for items in unordered lists: 1) look at first item in unordered list. 2) if this is the item being searched for, stop the search. 3) if not, look at next item in the list. 4) repeat until you find the item being searched for or the whole list has been checked.
c)
It is simple algorithm that can easily be implemented on a computer. It is an efficient way to check if a list is already in order. It doesn't use very much memory as all sorting is done using original list.
d)
Subroutines can be developed in isolation, independently or separately; Easier to discover errors/testing is more effective (than without a structure); Subroutines can be updated without affecting the overall program.
87.
boolean operators
a)
The length of time it takes to run an algorithm
b)
A programmable device that takes in data, processes it into useful information, and then outputs the information so it can be used.
c)
AND, OR, NOT
d)
It is when you test that your program works throughout its creation- by running your code and testing often, you will find that errors are much easier to detect and correct.
88.
Local variables
a)
They can only be accessed within structure they are declared in. They only exist when subroutine is executing
b)
It is simple algorithm that can easily be implemented on a computer. It is an efficient way to check if a list is already in order. It doesn't use very much memory as all sorting is done using original list.
c)
a single point of colour in an image
d)
Even if list is sorted, it still goes through the whole splitting and merging process so bubble sort may be quicker in some cases. It uses more memory than bubble sort because it has to create additional lists.
89.
Iterative testing
a)
It is easier to debug. It is shorter than low-level languages. It provides data structures. It has built in functions and subroutines.
b)
C#
c)
It is when you test that your program works throughout its creation- by running your code and testing often, you will find that errors are much easier to detect and correct.
d)
Binary
90.
Final testing
a)
Looks for items in an ordered list: 1) find middle item in ordered list (n+1/2). 2) if this is the item being searched for, stop the search. 3) if not, compare the item you are looking for to the middle item - if it comes before middle item, get rid of second half of list ; if it comes after middle item, get rid of first half of list. 4) repeat steps 1-3 on the smaller list until the item being searched for is found.
b)
Linear is much simpler than binary but not as efficient. Linear works on any type of list, it doesn't have to be ordered. For small ordered lists, the difference in efficiency doesn't really matter so the run time of both algorithms will be similar. For large ordered lists the run time of binary search will generally be much quicker than linear.
c)
WHILE loops, FOR loops, REPEAT-UNTIL loops
d)
Final testing happens once the completed program is finished. During iterative testing you might test individual blocks of code or subroutines. Final testing happens when all of those elements have been put together into one program.
91.
3 main types of data that can be entered to test program
a)
File size = colour depth x number of pixels
b)
AND, OR, NOT
c)
erroneous, boundary, normal
d)
It is simple algorithm that can easily be implemented on a computer. It is an efficient way to check if a list is already in order. It doesn't use very much memory as all sorting is done using original list.
92.
What is a computer
a)
They can only be accessed within structure they are declared in. They only exist when subroutine is executing
b)
A programmable device that takes in data, processes it into useful information, and then outputs the information so it can be used.
c)
Programs easier to read. Easier to test / find / correct errors You can reuse code. It is easy to implement new features. Individual subroutines and modules can be fixed and updated without affecting the rest of the program.
d)
Subroutines can be developed in isolation, independently or separately; Easier to discover errors/testing is more effective (than without a structure); Subroutines can be updated without affecting the overall program.
93.
Why use subroutines?
a)
Looks for items in an ordered list: 1) find middle item in ordered list (n+1/2). 2) if this is the item being searched for, stop the search. 3) if not, compare the item you are looking for to the middle item - if it comes before middle item, get rid of second half of list ; if it comes after middle item, get rid of first half of list. 4) repeat steps 1-3 on the smaller list until the item being searched for is found.
b)
a single point of colour in an image
c)
Subroutines can be developed in isolation, independently or separately; Easier to discover errors/testing is more effective (than without a structure); Subroutines can be updated without affecting the overall program.
d)
An image made up of pixels
Reset
