Computer Systems Flashcards

(55 cards)

1
Q

overflow

A

the calculation goes over the amount of bits the computer can deal with

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

Binary

A

A way of representing information using only two options.

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

Hexademical

A

easier to read as a human

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

ASCII

A

American Standard Code for Information Interchange

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

extended ASCII

A

8 bit which can code for all foreign characters

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

Unicode

A

can fit all language characters and more

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

colour depth

A

the number of available colours is 2^(n)

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

Image file size (bits)

A

Image size (area) x colour depth

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

Sampling

A

converting analog sound to digital sound

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

Sample rate

A

the number of samples taken per second

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

Bit depth (sound)

A

how many bits is used

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

Sound file size (in bits)

A

Sample rate x Bit depth x Time running (seconds)

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

compression

A

reducing file size

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

Lossy compression

A

Losses bits of data by using abstraction and then filling in with what it predicts

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

Lossless compression

A

No data is lost. Repeats recurring information

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

Huffman tree

A

A tree having the nodes representing symbols as the leaves, with more frequent symbols having nodes progressively closer to the root. The most frequent symbols are the closest to the root node. Note that internal nodes cannot represent symbols.

The edges connecting children to parents are either 0 or 1. Convention must be established (e.g., left children have 0s, right children have 1s).

The code for a symbol is built from 0s and 1s along the path from the root down to the desired symbol.

Codes must be prefix free.

abc:7

/ \

ab:3 c:4

/ \

a:1 b:2

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

Run Length Encoding (RLE)

A

wbbw becomes 1w2b1w

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

System Software

A

System that manages the operation of the computer (controls hardware)

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

Embedded system

A

Coded for 1 purpose (washing machine)

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

CPU (Central Processing Unit)

A

Where data processing takes place

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

FDE (Fetch Decode Execute) cycle

A

Data fetches information, decodes it and then executes task

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

Control Unit (CU)

A

controls operations of the CPU’s internal components

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

Address bus

A

These transfers data to and from the CPU

24
Q

Control bus

A

Controls whether the busses are occupied

25
Data bus
Transfers data between the processor and memory
26
Analogy for CPU and CU
the busses in CU are nerves, the CPU is the brain
27
ROM (Read Only Memory)
Contains operating system, can't delete and is non-volatile
28
RAM (Random Access Memory)
All open applications, deletes when turned off (volatile)
29
BIOS
Controls what happens when the computer is switched off
30
Registers
Cache memory above the CPU
31
ALU (Arithmetic Logic Unit)
Deals with arithmetic and logic operations
32
Clock
Synchronises all components, higher clock speed means more FDE cycles
33
Cache
Memory that is used to make a computer work faster
34
Cores
Can split the processes between the cores which means it will be faster
35
Magnetic storage
- Moving parts so not portable - low cost for lots of storage - not always reliable
36
Solid state drives
- uses electricity - expensive for not as much storage - easy to transfer data - portable
37
optical disk storage
- hits pit or grove to provide 1 or 0 - cheap - fragile - low storage
38
Cloud storage
- easily accessed and multiple access - needs internet - could be hacked - can't be lost
39
Memory management
Allocates data to RAM and makes sure there is enough space
40
Virtual memory
process of optimizing RAM storage by borrowing hard drive space
41
Processor management
prioritises tasks and allocates time to each process
42
Peripheral Management
communicates with peripherals through drivers
43
Application management
Assigns memory space and processor time to applications
44
Security management
Protects against viruses and malicious malware
45
User Interface
Converts computer code into visible icons for user to understand
46
Anti-virus software
A program that finds and removes viruses from a computer
47
Encryption software
Scrambles data to stop third parties from accessing it
48
Firewall
Prevents unauthorised access to a computer over a network
49
Spyware detectors
block or removes programs collecting personal data
50
System cleanup
Search and remove files no longer needed
51
File compression software
makes files smaller to be transmitted more easily
52
High level languages
Faster program development
53
Low level languages
- requires less memory | - easier to debug
54
Machine code
machine-level instructions that are uniquely read by computer processors using patterns of 1s and 0s.
55
Assembly code
A low level language that uses mnemonics to represent machine code instructions