Data representation

Binary, Decimal, Hexadecimal

BIN  DEC, DEC  BIN
BIN  HEX, HEX  BIN
HEX  DEC, DEC  HEX
Uses of the hexadecimal system: error codes, MAC addresses, IPv6 addresses, HTML
colour codes
Addition of binary number
Overflow
Logical binary shift
Two’s complement
Positive denary  binary
Positive binary  denary
Negative binary  denary
Negative denary  binary
Represent text: ASCII code
Represent sound: sampling resolution = bit depth, sampling rate. File size = image
resolution (pixels) x color depth (bits)
Represent image: bitmap images, pixels, color depth. File size = sample rate (Hz) x
sample resolution (bits) x length of sample (seconds)
Bit, byte, kilobyte, megabyte, gigabyte, terabyte
KB # KiB
Data compression, lossless, lossy

Data Transmission
Data sent over long distances is broken up into packets which include:
- Header: IP addresses of sender and receiver, sequence number of the packet  allowing
correct reassembly, packet size
- Payload: actual data
- Trailer: method of identifying the end of packet, error checking
Transmission mode:
- Simplex: data is sent in one direction only, e.g. computer send data to printer
- Half-duplex: data is sent in both direction but not at the same time, e.g. walkie-talkie
- Full-duplex: data is sent in both direction at the same time, e.g. video call
Types of data transmission:
- Serial: data is sent one bit at a time over a single wire/channel
Serial data transmission can be simplex, half-duplex or full-duplex
- Parallel: several bits of data are sent down several channels/wires all at the same time
Parallel data transmission can be simplex, half-duplex or full-duplex
Parallel data transmission works well over short distances. Over long distances (>20m)
data can become skewed (data can arrive unsynchronised)

Hardware
Software
Uses of the Internet
Automated and emerging techonologies
Algorithm design and problem solving
Programming
Databases
Boolean logic
Logic gate Logic notation Boolean algebra Function
 NOT A Output is reversible
of input
A AND B A.B Output is 0 if at
least one input is 0
A NAND B Out put is 1 if at
least one input is 1
A OR B A+B Output is 1 if at
least one input is 1
A NOR B Out put is 0 if at
least one input is 1
A XOR B Output is 0 if inputs
are the same, out
put is 1 if inputs are
different

problem statement  logic circuit

truth table
logic / boolean expression
logic / boolean expression  logic circuit
truth table

logic circuit  logic / boolean expression

truth table
NAND gate can be used to create other gates  main component in electric circuit
because it is easy to manufacture