CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1.

Slides:



Advertisements
Similar presentations
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Advertisements

CDA 3100 Recitation Week 10.
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
CP208 Digital Electronics Class Lecture 11 May 13, 2009.
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE116: Introduction to Computer Science 2 Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
CSE115: Introduction to Computer Science I
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1.
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
Setting the flip-flop The normal value of R and S is zero. S (set) = 0 R (reset) = 0 remembered value 1.
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1.
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1.
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Sequential Circuits.
CSE 305 Introduction to Programming Languages
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
CSE 116 Introduction to Computer Science For Majors II Carl Alphonce 219 Bell Hall.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1.
CS231: Computer Architecture I Laxmikant Kale Fall 2004.
Circuit, State Diagram, State Table
CPSC 171 Introduction to Computer Science Boolean Logic, Gates, & Circuits.
CSCI-235 Micro-Computers in Science Hardware Design Part I.
TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
Machine level architecture Computer Architecture Basic units of a Simple Computer.
CSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall 1.
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
Gates and Logic Dr John Cowell phones off (please)
CSCI-100 Introduction to Computing Hardware Design Part I.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
ITEC 352 Lecture 9 Flip Flops. Flip flops Review Questions? HW #2 posted, due next Friday at 10PM Floating point numbers.
SEQUENTIAL LOGIC By Tom Fitch. Types of Circuits Combinational: Gates Combinational: Gates Sequential: Flip-Flops Sequential: Flip-Flops.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
Registers; State Machines Analysis Section 7-1 Section 5-4.
Boolean and Sequential Logic Last week – Basic Gates AND OR NOT NOR XOR NAND.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
Instructor:Po-Yu Kuo 教師:郭柏佑
Logic Gates Binary Day 3 PEOPLE 2016.
Logic Gates.
Instructor:Po-Yu Kuo 教師:郭柏佑
Lab02 :Logic Gate Fundamentals:
CSCI-100 Introduction to Computing
Chapter 2.3 Binary Logic.
Jeremy R. Johnson Mon. Apr. 3, 2000
How Boolean logic is implemented
Computer Science 210 Computer Organization
3.4 Computer systems Boolean logic Lesson 2.
For OCR GCSE Computing Unit 1 - Theory
JC Technology Logic Gates.
Instructor:Po-Yu Kuo 教師:郭柏佑
Digital Logic.
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
AWIM Series Lawndale High School Experiment 6 Dec, 2017
Combinational Circuits
Binary Logic.
Presentation transcript:

CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1

Announcements If this is your first class: –print a syllabus from the course website –hand in signature form next class Recitations start this week Cell phones off 2

Today’s lessons A computer is a very simple machine. A computer manipulates voltages Gates are used to control voltage flow Circuits are combinations of gates A flip-flop is a circuit that remembers But first… 3

Name sign competition Put your signs out! 9:00 AM – Jeff 1:00 PM – Nina 3:00 PM – Alicia 4

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

Idea 6

Controlling flow 0 7

1 8

Two in a row? 0 9

0 10

Two in a row? 0 11

Two in a row? 1 12

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

Truth table for AND Input 1Input 2Output

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

Truth table for OR Input 1Input 2Output

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

Truth table for NOT InputOutput

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

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

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

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

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

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

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

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! 26 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

Questions? 27