1 / 18

CSE111: Great Ideas in Computer Science

CSE111: Great Ideas in Computer Science. Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:50 645-4739 alphonce@buffalo.edu. cell phones off (please). Setting the flip-flop The normal value of R and S is zero. R (reset) = 0. remembered value. S (set) = 0.

lorna
Download Presentation

CSE111: Great Ideas in Computer Science

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:50 645-4739 alphonce@buffalo.edu

  2. cell phones off (please)

  3. Setting the flip-flopThe normal value of R and S is zero. R (reset) = 0 remembered value S (set) = 0

  4. Setting the flip-flopTo store 1 in the flip-flop, we “raise” S to 1… R (reset) = 0 remembered value S (set) = 1

  5. Setting the flip-flop…which makes the output of the OR gate 1. R (reset) = 0 remembered value 1 S (set) = 1

  6. Setting the flip-flopThe NOT gate inverts this 1 value to 0, which becomes the second input to the upper OR gate. R (reset) = 0 remembered value 0 1 0 S (set) = 1

  7. Setting the flip-flopSince both inputs of the upper OR gate are zero, its output is zero. R (reset) = 0 0 remembered value 0 1 0 S (set) = 1

  8. Setting the flip-flopThe NOT gate inverts this 0 to a 1; this value becomes the second input to the bottom OR. R (reset) = 0 1 0 remembered value 0 1 1 0 S (set) = 1

  9. Setting the flip-flopBecause the output of the bottom OR gate will now stay at 1, we can lower S to zero, and the circuit will stay in a stable state, with 1 as the remembered value! R (reset) = 0 1 0 remembered value 0 Resetting the flip-flopResetting the remembered value to zero is similar, except we raise, then lower, the value on R. 1 1 0 S (set) = 0

  10. One-bit Half Adder A B S C

  11. One-bit Half Adder 0+ 0 0 (carry 0) A= 0 B = 0 S = ? C = ?

  12. One-bit Half Adder 0+ 0 0 (carry 0) A= 0 0 0 0 B = 0 0 S = 0 1 0 0 1 0 C = 0

  13. One-bit Half Adder 0+ 1 1 (carry 0) A= 0 0 1 1 B = 1 1 S = 1 1 0 0 1 1 C = 0

  14. One-bit Half Adder 1+ 0 1 (carry 0) A= 1 1 1 0 B = 0 1 S = 1 1 1 0 1 0 C = 0

  15. One-bit Half Adder 1+ 1 0 (carry 1) A= 1 1 1 1 B = 1 1 S = 0 0 1 1 0 1 C = 1

  16. One-bit Full Adder A B S Cin Cout

  17. Encoding machine instructions • Op-code + operands • Hardware decodes and executes

  18. Computer Organization • Central Processing Unit (CPU) • Registers • General purpose (e.g. R1 – R16) • Special purpose (e.g. Program Counter and Instruction Register) • Arithmetic Logic Unit (ALU) • Memory

More Related