data transmission Flashcards

paper 2

You may prefer our related Brainscape-certified flashcards:
1
Q

serial transmission

A

one bit after another sent in order
eg USB wire

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

parallel transmission

A

more than one bit sent at a time

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

serial connection pros

A

only one wire needed which makes it cheaper and easier to set up
is less prone to interference over long distances

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

serial transmission cons

A

only one bit transmitted at a time so can take longer (less true with high clock speed)

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

parallel transmission pros

A

multiple bits sent at a time makes it faster (less true with modern technology)

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

parallel transmission cons

A

hardware more expensive
over longer distances there is likely to be interference due to induced currents between wires (crosstalk) which reduces signal quality
bits can travel at different speeds over the wires causing skew

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

simplex mode of transmission

A

data can travel in one direction only
eg radio transmission

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

half duplex mode of transmission

A

data can travel in both directions but not at the same time
eg two way radios (walkie talkies)

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

full duplex mode of transission

A

data can travel in both directions at the same time
eg telephone, ethernet cables

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

multiplexing

A

allows independent data sources to be combined into one single communication link which is then transmitted over the same wire simultaneously

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

switching

A

process by which the devices forward chunks of data (packets) towards their destination possibly via other devices. switch knows location of nearby devices so can forward data in right direction

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

frequency division multiplexing

A

divides spectrum/carrier bandwidth in logical channels and allocates one user to each channel
user can use channel frequency to access data

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

time division multiplexing

A

shared channel divided among its users via time slots
each use can transmit data within provided time slot only
high bit rate makes it look as though signals are transmitted simultaneously

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

internet

A

a worldwide connection of packet switched networks

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

contents of a packet

A

length (number of bits)
order number
source address
destination address
protocols
data
checksum

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

circuit switching

A

path across the network is set up in advance and all packets are sent in order down the same route
eg phone netwrok

17
Q

circuit switching pro

A

packets will arrive in order

18
Q

circuit switching cons

A

if a part of the route is broken the whole circuit will fail and a new circuit must be set up before communication can continue
no other traffic can use that route until communication has ended wasting bandwidth

19
Q

packet switching

A

packets take independent routes through the network

20
Q

packet switching pros

A

if one route is broken then another route can be found without breaking communication - more stable
bandwidth used more efficiently as no part of the network is reserved

21
Q

packet switching con

A

packets might not arrive in order requiring extra processing is needed and each packet needs an order number

22
Q

collision

A

when two nodes send data at the same time and the signals interfere with one another
packets are discarded when a collision is detected, a jamming signal is sent to prevent further transmissions and a short, random amount of time is waited before each of the packets is sent

23
Q

routing

A

the process of path determination for a packet done by the router

24
Q

Dijkstra’s shortest path algorithm

A

designed to find the shortest path between a start node and every other node in a weighted graph
uses priority queue to keep record of which vertex to visit next
assigns temporary distance value to each node (0 at start node and infinity for all other)

25
Q

bitrate

A

number of bits transferred between devices in one second

26
Q

bandwidth

A

measure of maximum capacity of a given communication channel.
greater the bandwidth the greater the volume of data you can transmitd

27
Q

data transfer rates

A

measured in bps (bits per second), Mbps (megabits per second) etc
1. convert from bytes to bits (x8)
2. convert from minutes to seconds (x60)
3. bits divided by seconds

28
Q

static routing

A

each router has access to a table that tells it which path to forward data based on destination address
simple to implement but not suitable for networks that change often