Back to marketplace

Computer Systems

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

overflow

Back (Answer)

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

#2
Front (Question)

Binary

Back (Answer)

A way of representing information using only two options.

#3
Front (Question)

Hexademical

Back (Answer)

easier to read as a human

#4
Front (Question)

ASCII

Back (Answer)

American Standard Code for Information Interchange

#5
Front (Question)

extended ASCII

Back (Answer)

8 bit which can code for all foreign characters

#6
Front (Question)

Unicode

Back (Answer)

can fit all language characters and more

#7
Front (Question)

colour depth

Back (Answer)

the number of available colours is 2^(n)

#8
Front (Question)

Image file size (bits)

Back (Answer)

Image size (area) x colour depth

#9
Front (Question)

Sampling

Back (Answer)

converting analog sound to digital sound

#10
Front (Question)

Sample rate

Back (Answer)

the number of samples taken per second

#11
Front (Question)

Bit depth (sound)

Back (Answer)

how many bits is used

#12
Front (Question)

Sound file size (in bits)

Back (Answer)

Sample rate x Bit depth x Time running (seconds)

#13
Front (Question)

compression

Back (Answer)

reducing file size

#14
Front (Question)

Lossy compression

Back (Answer)

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

#15
Front (Question)

Lossless compression

Back (Answer)

No data is lost. Repeats recurring information

#16
Front (Question)

Huffman tree

Back (Answer)

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

#17
Front (Question)

Run Length Encoding (RLE)

Back (Answer)

wbbw becomes 1w2b1w

#18
Front (Question)

System Software

Back (Answer)

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

#19
Front (Question)

Embedded system

Back (Answer)

Coded for 1 purpose (washing machine)

#20
Front (Question)

CPU (Central Processing Unit)

Back (Answer)

Where data processing takes place

#21
Front (Question)

FDE (Fetch Decode Execute) cycle

Back (Answer)

Data fetches information, decodes it and then executes task

#22
Front (Question)

Control Unit (CU)

Back (Answer)

controls operations of the CPU’s internal components

#23
Front (Question)

Address bus

Back (Answer)

These transfers data to and from the CPU

#24
Front (Question)

Control bus

Back (Answer)

Controls whether the busses are occupied