Mock 1 Notes Flashcards

1
Q

Give three advantages of wireless connectivity

A
  • Easy installation
  • Cheap
  • Good mobility for users
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How does lossy compression compress images?

A

Algorithms analyse the image and find areas with only slight colour differences. These are given the same value and the file is rewritten using fewer bits.

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

How does lossy compression compress sound?

A

Very small variations in frequency, tone and volume are removed as the human ear cannot detect these small differences.

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

What is stored in RAM?

A

Data and instructions when an application is running (OS, applications, GUI)

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

Give two ways that e-waste could be harmful to human health

A
  • Waste might be illegally dumped in landfill where toxic substances can get into the land and water
  • Burning digital devices releases toxins into the air which could then be inhaled
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is checked for in a code review?

A

Check for:

  • logic errors
  • security vulnerabilities
  • inefficient code
  • bad programming practice
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are the features of a compiler?

A
  • Returns an executable file
  • Protects source code from competitors
  • Entire source code is converted at once
  • Error report is provided at the end
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How does a router direct data over the internet?

A
  • Reads packet to find recipient address
  • Has physical connections to >=2 networks
  • Holds a routing table
  • Forwards data/packets
  • Chooses most efficient path to the next node
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What’s the best case scenario for a binary search algorithm?

A

Search item is the median

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

What’s the worst case scenario for a binary search algorithm?

A

The search item is at the point where the final division could be made

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