Devices Flashcards

1
Q

What is an analogue system?

A

Analogue systems have values that vary continuously

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

What are digital systems?

A

Digital systems consist of discrete values (not necessarily two)

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

Why are digital systems good?

A

As they are much more resistant to noise

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

What is a bit?

A

A single binary digit

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

What is a byte?

A

8 binary digits

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

What is a nibble?

A

4 bits

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

How to convert from decimal to binary?

A
  1. Successively divide number by 2 and record remainder (1 or 0)
  2. Stop when the result of the division is 0.
  3. The remainders read “backwards” giving binary result
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How do you convert binary to decimal?

A
  • Multiply the first non-zero bit by 2 and add the bit to its right
  • Continue with the remaining bits and stop after adding the smallest bit
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is ASCII?

A

ASCII (American Standard Code for Information Interchange) is a method for representing characters.

ASCII - 7 bits
Extended ASCII - 8 bits

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

Why did unicode replace ASCII?

A

Unicode contained more bits to represent more symbols and characters of different languages

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

What is sign and magnitude?

A

Method of representing negative numbers based off the first bit.

+ - 0
- - 1

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

What is an issue with sign and magnitude?

A
  • One bit is used to represent the sign
  • First bit is not involved in addition and determines what operation takes place.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How does twos compliment work?

A

The first bit represents negative of the original value

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

How do you convert a number into its negative using twos complement?

A
  • Write number in binary
  • Invert all the bits
  • Add 1
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is fixed point arithmetic?

A

Where the decimal point stays in the same place of the binary number

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

What is the structure of an IEEE floating point number?

A

1 bit for the sign
8 bits for the exponent
23 bits for the mantissa

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

How do you normalise a floating point number to be stored as an IEEE floating point number?

A

Alter the exponent so that the number reads 1. (whatever digits come next)

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

How does floating point arithmetic work?

A
  1. Identify number with smaller exponent
  2. Make the smaller exponent equal to the larger exponent
  3. Add or subtract the mantissas
  4. Normalise if necessary
  5. Truncate or round mantissa
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

What is commutativity?

A

Order of arguments are not important.
i.e. A AND B = B AND A

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

What is associativity?

A

Ordering of sub-expressions with the same operator does not matter.

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

What is distributivity?

A

AND can be distributed over OR and OR can be distributed over AND

i.e. A AND (B OR C) = (A AND B) OR (A AND C)

23
Q

How do you use a Karnaugh map?

A

Group adjacent cells together to simplify a Boolean expression.

24
Q

What is De Morgan’s theorem?

A

NOT( A OR B) = NOT A AND NOT B
NOT( A AND B) = NOT A OR NOT B

25
Q

What is a tri-state buffer?

A
  • Copies input to output when enable input is equal to 1
  • Else it outputs floating val
26
Q

What is a multiplexer?

A

A device that shares multiple inputs and the output is determined by two select bits

27
Q

What is a demultiplexer?

A

Opposite of a multiplexer, the select determines which output copies the input

28
Q

What is a half adder made up of?

A

Sum = A XOR B
Carry = A AND B

29
Q

What is the equation for a full adder?

A

Sum = (A XOR B) XOR Cin
Cout = (A AND B) OR ((A XOR B) AND Cin)

30
Q

What is circuit depth?

A

The number of gates on the longest path of the circuit

31
Q

What is the RS flip flop?

A

A bistable circuit. Two NOR gates interconnected with each other

32
Q

What can the RS flip flop be used for?

A

Data storage

33
Q

What is the structure of a D flip flop? (Values for R and S)

A

R = C AND NOT D
S = C AND D

34
Q

What is the structure of a JK flip flop? (Values for R and S)

A

R = C AND K AND Q
S = C AND J AND Q’

35
Q

What is edge triggring?

A

When the input is valid the output is valid if the clock is at a rising edge.

36
Q

What is a Master-Slave flip flop?

A

When two RS flip flops are connected together and one is connected with the clock and another with the inverted clock

37
Q

What is the Harvard architecture?

A

Harvard architecture has separate storage locations for data and instructions. And a different set of busses for data and instruction

38
Q

What is the Von Neuman architecture?

A

Instruction and data are placed in the same memory location

39
Q

What are the steps of the FDE cycle?

A
  • Instruction fetch
  • Instruction decode
  • Operand fetch
  • Execute
  • Operand store
40
Q

What is the three-Address format?

A

Using three addresses to specify the two that take part in the operation and the one where the result is stored.

Z = X + Y becomes ADD X, Y, Z

41
Q

How does the two address format work?

A

Specifies the two data locations used for the source data and the result is written back to one of the operands

42
Q

What is the literal addressing mode? (and what symbol is used to represent it?)

A

Moving the given value into the given location

MOVE #4, D1 (Moves 4 into D1)

43
Q

What is absolute addressing? (and what symbol is used to represent it?)

A

Moving data from one location to another

MOVE 1234, D1 (moves data at 1234 to D1)

44
Q

What is indirect addressing? (and what symbol is used to represent it?)

A

Finding memory location from one location and move data.

MOVE (A0), D1 (go to A0 find address, go to that address and move data to D1)

45
Q

What is the structure of an instruction (How many bits are assigned to each part?)

A
  • Letter - 4
  • Register - 3
  • Opmode - 3
    (Effective address)
  • Mode - 3
  • Register- 3
46
Q

What happens at fetch?

A

Get the next instruction from the PC

47
Q

What happens at decode?

A

Work out what operation and what parameters

48
Q

What happens at operand fetch?

A

Go and get whatever we need

49
Q

What happens at execute?

A

Do whatever action is required

50
Q

What happens at store (FDE) ?

A

Write back to where-ever

51
Q

What is pipelining?

A

Starting the stages of the next instruction before we had finished the previous one.

52
Q

What are problems with pipelining?

A
  • Data may be needed for next instruction so must wait
  • At branching PC will alter at execute, which may be too late
53
Q

What is RISC?

A

Reduced Instruction Set Computer - instructions are simpler

54
Q

What is CISC?

A

Complex Instruction Set Computers (Used for PC’s and cloud servers)