Unit 3: Computers Edexcel GCSE Computer Science

0.0(0)
studied byStudied by 1 person
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/71

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

72 Terms

1
New cards

von Neumann architecture

Computer design where processing instructions are stored in memory; the stored program concept

2
New cards

Central Processing Unit (CPU)

Hardware that carries out the computer's processing

3
New cards

Bus

Group of connections between components in a computer

4
New cards

ALU

performs calculations, logical operations and comparisons on values held in registers

5
New cards

Register

high speed memory in the CPU used to hold single data items

6
New cards

Control unit

sends read/write controls signals to the RAM via the control bus and decodes instructions

7
New cards

Clock

sends constant electrical pulses to control the speed of the FDE cycle

8
New cards

Main memory / Random Access Memory (RAM)

Temporary storage for data and instructions

9
New cards

Volatile memory

Memory that is lost when the power is switched off, RAM is volatile

10
New cards

Fetch - Decode - Execute

Steps carried out repeatedly by the CPU: instructions are fetched from the memory, then they are processed and the cycle repeats...

11
New cards

Read-only memory (ROM)

Non-volatile memory, programs that run when the computer is turned on are kept in ROM

12
New cards

Non-volatile memory

Data is not lost when the power is switched off

13
New cards

Input - Process - Output model

An input is received, the instruction are processed, an output is given

14
New cards

John von Neumann

Developed the idea that a computer could store instructions in memory

15
New cards

Cache

Very fast Random Access Memory (RAM), stores frequently used instructions to speed up processing

16
New cards

Secondary storage

Where data and instructions are permanently stored

17
New cards

Secondary storage: magnetic

There is magnetic coating on the surface of the disk and the state of the magnet can be changed to represent a 0 or 1

18
New cards

Secondary storage : optical

These storage devices have data represented as pits and lands on the disc surface, these are read by a laser (CDs, DVDs and Blu-Ray discs)

19
New cards

Secondary storage: solid-state

These have no moving parts, uses semiconductor chips to store data (SD cards, microSD cards, USB flash drives)

20
New cards

Secondary storage: cloud storage

Data is stored in data centres accessible over the internet (Dropbox and Microsoft OneDrive)

21
New cards

Software

The programs that run on a computer. There are two types: application software and system software

22
New cards

Application software

Examples include Microsoft Office (Word, Excel, etc) and Adobe Creative Cloud (Photoshop, Illustrator, etc)

23
New cards

The 2 types of system software

Includes utility software and operating system software

24
New cards

Types of Utility software

(FABDD)

File repair

Anti-malware

Backup

Disc defragmentation

Data compression

25
New cards

Operating system software

OS software manages the tasks running on a computer (examples include Windows, Linux and Apple's Mac OS)

26
New cards

High-level programming language

Examples include Python, C and Visual Basic, instructions resemble human languages

27
New cards

Translator

Converts source code into machine code

28
New cards

Compiler

Translator that translates the whole program in one go

29
New cards

Interpreter

Translator that translates the program one line at a time

30
New cards

Embedded system

A computer system with a dedicated function within a larger electrical or mechanical system.

31
New cards

Internet of Things

The connection via the Internet of computing devices embedded in everyday objects, enabling them to send and receive data.

32
New cards

Describe how Scheduling Algorithms work

  • All processes are held in a queue

  • Processes are prioritised

  • Processes are allocated time slices

  • Processes are switched out at the end of their time slice

  • Unfinished processes are put to the back of the queue

33
New cards

Scheduling algorithms: round robin

Each process is assigned a time slice of the CPU. When the time slice is up, if the process is not complete it goes to the back of the queue

34
New cards

Virtual Memory

A portion of secondary storage functioning as additional RAM

35
New cards

Paging algorithm

The OS swaps processes out of RAM into virtual memory and back again when it's their turn to use the CPU

36
New cards

Hardware

The machines, wiring, and other physical components of a computer

37
New cards

Pipelining

Technique that allows the CPU to work on more than one instruction at a time

38
New cards

Multitasking

An operating system feature that allows more than one application to run at a time.

39
New cards

User management

  • User permissions can be edited so that they can access their own files

  • User accounts can be created so that multiple people can use a device

40
New cards

User interface

The visual elements of a program through which a user controls an application. Often abbreviated UI.

41
New cards

WIMP

Windows, Icons, Menus, Pointers

42
New cards

File repair software

Software used to restore corrupt files

43
New cards

Backup software

automates the process of backing up files so that data can be recovered if something goes wrong

44
New cards

data compression

reduces the size of files so that they take up less storage space and need less time to transfer

45
New cards

defragmentation software

moves all the blocks of data for one file together and all the free space is moved together - speeds up access to files

46
New cards

anti-malware software

detects, quarantines and removes malware from a computer

47
New cards

Methods of identifying vulnerabilities in software

Audit trails

code reviews

48
New cards

Audit trails

  • record of all the changes that have been made to a program and who has made the changes

49
New cards

Code reviews

checks of source code by other programmers to help find vulnerabilities and help make the code more efficient

50
New cards

Compiler advantages

Faster execution

Original source code is hidden

51
New cards

Compiler disadvantages

Program will not run with syntax errors - more difficult to write

Code needs to be recompiled if it is changed

52
New cards

Interpreter advantages

easy to write source code as the program will always run until an error is found

code does not need to be recompiled when its changed

53
New cards

Interpreter disadvantages

slower execution

translation software required to run the code

54
New cards

Which bus is unidirectional

address bus

55
New cards

Which busses are bidirectional

data bus and control bus

56
New cards

Role of the control bus

carries the control signals sent by the control unit to other components

57
New cards

Role of the address bus

carries the address of a memory location in RAM, of the data or instruction to be fetched or stored

58
New cards

Role of the data bus

carries the data or instruction fetched from the RAM or written to the RAM

59
New cards

Purpose of a mnemonic

make an instruction easier to remember (e.g. INP means INPUT)

60
New cards

Defragmentation

when file blocks are rearranged on the disk

61
New cards

Fragmentation

Files are written to the disk in blocks, blocks can be dispersed across the disk

62
New cards

Describe 2 ways how a compiler and interpreter are different

A compiler produces a stand-alone executable file whilst an interpreter is needed each time the code is run

A compiler reports errors after translation whilst an interpreter reports errors as they occur

63
New cards

Describe 2 ways an OS manages processes

Uses a scheduling algorithm to share processing time between processes

Allocates sections of RAM to share memory between processes

64
New cards

Describe two ways that a high level language and low level language are different

High-level languages have instructions that look like English whereas a low-level language uses binary code

High-level languages are general purpose but a low-level language is machine-specific

65
New cards

3 Aspects of a compiler

Translates the entire source file to machine code in one go

Shows all syntax errors at the end of translation

Produces a single executable file

66
New cards

Characteristics of embedded systems

  • smaller in size

  • smaller storage

  • lower power consumption

67
New cards

Type of vulnerabilities

  • inadequate validation (that fails to prevent incorrect data input)

  • inadequate authentication (that fails to prevent hackers from accessing private information)

  • bad programming practise (e.g. confusing variable names)

68
New cards

Robust software

software that does not contain vulnerabilities

69
New cards

types of low level language

assembly language

machine code

70
New cards

assembly language

program instructions represented as mnemonics

71
New cards

machine code

program instructions represented in binary

72
New cards

Define translation

Converting human readable code to binary/machine code