Week 2 - Binary & Logic Gates Flashcards

(9 cards)

1
Q

Define the term algorithm

A

A sequence of instructions that always terminates

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

State two reasons why bit patterns are often represented using hexadecimal

A

Hexadecimal is more compact when displayed
Hexadecimal is easier for HUMANS to read and understand

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

Explain how one unsigned binary number can be subtracted from another unsigned binary number (e.g. 0110 - 1010)

A
  1. Convert the number to be subtracted into its negative value by representing it in Two’s Complement (signed binary)
  2. You can convert a positive number to negative by flipping each bit and then adding one
  3. Add the other number to this negative number
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Draw an AND gate

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

Draw an OR gate

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

Draw a NOT gate

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

Draw a NAND gate

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

Draw a NOR gate

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

Draw an XOR gate

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