Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

GCSE Computer Science > Topic 1 - Computational Thinking > Flashcards

Topic 1 - Computational Thinking Flashcards

1
Q

Abstraction

A

The process of separating ideas from specific instances of those ideas at work.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Decomposition

A

The process by which a complex problem or system is broken down into parts that are easier to conceive, understand, program and maintain.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Subprogram

A

A block of code given a unique identifiable name within a program. Supports code reuse and good programming technique.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Algorithm

A

A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or a particular part of it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Flowchart

A

A method of designing algorithms before coding using symbols

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Sequence

A

One of the three basic programming constructs. Instructions happen one after the other in order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Selection

A

One of the three basic programming constructs. Allows programs to make a choice based on a condition and branch based on the outcome

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Count-controlled repetition

A

An iteration that loops a fixed number of times. A count is kept in a variable called an index or counter. When the index reaches a certain value (the loop bound), the loop will end.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Program inputs

A

Any information or data that goes into a system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Program processes

A

An operation carried out by a computer system. Processing takes in the inputs and produces outputs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Program outputs

A

Any information or data that leaves a system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Variables

A

A value that can change depending on conditions or information passed to the program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Constant

A

A value that cannot be altered by the program during normal execution – i.e., the value is constant

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

One-dimensional data structures

A

Any data structure that only requires a single index value to reference any item

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Two-dimensional data structures

A

Any data structure that requires a pair of index values to reference any item

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Strings

A

A sequence of alphanumeric characters and or symbols – e.g., a word or sentence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Records

A

A data structure that consists of a collection of elements, typically in fixed number and sequence and indexed by names.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Arrays

A

A set of data items of the same type grouped using a single identifier. Each of the data items is addressed by the variable name and a subscript

19
Q

Mathematical operator: +

A

+ is the standard symbol used for addition

20
Q

Mathematical operator: -

A
  • is the standard symbol used for subtraction
21
Q

Mathematical operator: *

A
  • is the standard symbol used for multiplication
22
Q

Mathematical operator: /

A

/ is the standard symbol used for real division

23
Q

Mathematical operator: //

A

// gives you the number of times a number fits into another number – e.g., 10 // 3 would give you 3

24
Q

Mathematical operator: %

A

10 % 3 would give you 1

25
Q

Mathematical operator: **

A

** is the standard symbol used for exponent

26
Q

Comparison operator: ==

A

Equal to

27
Q

Comparison operator: !=

A

Not equal to

28
Q

Comparison operator: <

A

Less than

29
Q

Comparison operator: >

A

Greater than

30
Q

Comparison operator: <=

A

Less than or equal to

31
Q

Comparison operator: >=

A

Greater than or equal to

32
Q

Logical operator: AND

A

A logical operator used within a program. AND works by only returning TRUE if both values being compared are TRUE

33
Q

Logical operator: OR

A

A logical operator used within a program. OR works by returning TRUE as long as either value being compared is TRUE

34
Q

Logical operator: NOT

A

A logical operator used within a program. NOT works by returning FALSE if the input is TRUE and returning TRUE if the input is FALSE

35
Q

Trace table

A

A technique used to test algorithms to make sure that no logical errors occur while the algorithm is being processed. The table usually has one column for each variable. Each row of the table shows how the various values held in variables change as the algorithm is running

36
Q

Syntax error

A

Rules of the language have been broken

37
Q

Logic error

A

The program runs but does not give the expected output

38
Q

Runtime error

A

An error that causes the program to crash while it is running

39
Q

Bubble sort

A

A simple algorithm popular with inexperienced programmers. It is inefficient when sorting large amounts of data as the time taken is related to the square of the number of items

40
Q

Merge sort

A

A type of divide and conquer algorithm that was incited by John von Neumann. First, the list is divided into the smallest unit (1 element), then each element is compared with the adjacent list to sort and merge the two adjacent lists. Finally, all elements are sorted and merged

41
Q

Linear search

A

Involves examining each entry in turn until the time is found or the end of the file is reached. Unless the file is in some useful order, a serial search has to be used

42
Q

Binary search

A

A particularly efficient search method. It only works if records in the file are in sequence. A binary search involves accessing the middle record and determining whether the target record has been found – and if not, whether it is before or after the middle record in the sequence. Repeated on the part of the file where the target record is expected to be until it is found

43
Q

Algorithm efficiency

A

A measure of how well an algorithm performs its task on a given data set based on its speed of execution and the amount of memory it takes up during execution

44
Q

Truth table

A

A notation used in Boolean algebra for defining the output of a logic gate or logic circuit for all possible combinations of inputs

GCSE Computer Science (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions