1. CSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall alphonce@buffalo.edu 1

2. Announcements Recitations begin this week. –“preparatory” lab exercises Name sign judging today 2

3. cell phones off laptops away 3

4. name signs out 4

5. Today Representations Gates Fetch-Decode-Execute cycle 5

6. Interpretation QUESTION: –What does the bit string 1101 represent? 6

7. Interpretation QUESTION: –What does the bit string 1101 represent? ANSWER: –Whatever we want it to represent! 7

8. Roadmap A computer is a very simple machine –it manipulates voltages –gates are used to control voltage flow –circuits are combinations of gates –a flip-flop is a circuit that remembers Instructions are encoded as bit strings Machine/assembly/high-level languages Fetch-Decode-Execute cycle Requirements for a programming language 8

9. physical vs. logical perspectives Physical reality: Logical view: WIRE Carries a HIGH voltage or a LOW voltage WIRE Carries a 1 or a 0 9

10. Idea 10

11. Idea 11

12. http://commons.wikimedia.org/wiki/File:Relay_principle_horizontal.jpg User:Bisgaardhttp://commons.wikimedia.org/wiki/File:Relay_principle_horizontal.jpg User:Bisgaard, 12

13. http://commons.wikimedia.org/wiki/File:Electronic_component_relays.jpg User:FDominec User:FDominec 13

14. Electro-mechanical computers –relays: Mark I (1944) Electronic computers –vacuum tubes: ENIAC (1946) –transistors: U of Manchester (1953) –integrated circuits (~1963) –microprocessors: Intel 4004 (1971) 14

15. Controlling flow 0 15

16. Controlling flow 1 16

17. Two in a row? 0 17

18. Two in a row? 0 18

19. Two in a row? 0 19

20. Two in a row? 1 20

21. AND gate For which input values is output 1? For which input values is output 0? inputs are on left output is on right 21 0 or 1

22. Truth table for AND Input 1Input 2Output 000 010 100 111 22

23. OR gate For which input values is output 1? For which input values is output 0? inputs are on left output is on right 23

24. Truth table for OR Input 1Input 2Output 000 011 101 111 24

25. NOT gate For which input value is output 1? For which input value is output 0? input is on left output is on right 25

26. Truth table for NOT InputOutput 01 10 26

27. Flip-flop (a bit of memory!) S (set) R (reset) remembered value 27

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

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

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

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

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

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

34. Setting the flip-flop Because 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! 34 Resetting the flip-flop Resetting the remembered value to zero is similar, except we raise, then lower, the value on R. S (set) = 0 R (reset) = 0 remembered value 1 0 0 0 1 1

35. Recap Bit string by itself does not carry meaning. Bit string can be interpreted under a given representation scheme, which allows us to recover the encoded meaning. Circuits made from simple gates let us store and manipulate bit strings. 35