week 4 Sequential Logic

Question 1

RS latch

Answer 1

bistable circuit, meaning it can happily exist in either of 2 stable states, with the ability to store its last output.

latch- it can latch onto incoming data.

Question 2

D-latch

Answer 2

enables input on a gated S-R latch provides a way to latch the Q and not Q outputs without regard to the status of S or R.

we can eliminate one of those inputs to create a multivibrator latch circuit with no “illegal” input states.

Question 3

Timing diagram

Answer 3

a type of truth table for sequential logic gates

Question 4

Clock

Answer 4

• acts as the heartbeat of our system, creating windows of time to write or read to/from our storage devices
• acts like a conductor to synchronize information windows across our CPU.

Question 5

The D Flip Flop (DFF)

Answer 5

• an edge-triggered device that stores data at the edge of the clock.
• takes a clock input (often denoted with triangle)

Question 6

Latch vs Flip-flop

Answer 6

Latch is level sensitive and flip flop is edge-sensitive

Question 7

Registers

Answer 7

collection of latches or flip-flops controlled by a common WE (or CLK)

Question 8

Finite-state machine (or Finite state automation)

Answer 8

computation model that can be implemented with hardware or software and used to simulate sequential logic and some computer program.

Question 9

Computer memory

Answer 9

Physical devices capable of storing information temporarily like RAM (random access memory) or permanently like ROM (read only memory)

Question 10

RAM (Random access memory)

Answer 10

by specifying address, one can read or write to any drawer in the memory at random.

Question 11

ROM (read-only memory)

Answer 11

non-volatile memory used in computers and other electronic devices to store data permanently. use to hold a small program or setting that a computer might rely on for startup.

Question 12

What is the hierarchy of Memory in a computer

Answer 12

1. CPU
2. Cache
3. Main memory
4. Disks (permanent storage)

Question 13

Finite state machine (FSM)

Answer 13

A machine that can be built using combinational and sequential logic gates.

Question 14

what is a toaster?

Answer 14

an example of an FSM with 2 basic states (off and on/warming)

Question 15

What are 3 basic parts in FSMs?

Answer 15

1. An n bit register which stores the state of the machine
2. a block of logic that computes the next state as a function of the current state and any inputs.
3. a block of logic that computes the output based on the current state.

Question 16

what happens to the D-latch when the WE is set to high?

Answer 16

D latch is open.

Q follows D

Question 17

what happens to the D-latch when the WE is set to low?

Answer 17

D latch is closed. Data is stored and read only

Question 18

The difference between windows of time to store and read information with D-latch and DFF

Answer 18

D latch:

1. windows of time to store and read information are equal
2. WE = high, d latch opens up. As a result, Q follows D
3. WE = low, d latch is closed. Data is stored and read only.

DFF:

1. window of time for storage is shorter but more time to read.
2. able to store data when the clock transitions from 0 to 1.
3. otherwise, DFF is closed and can only read from it.
4. we prepare what we wish to store right before the positive edge of the clock.