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

Slides:



Advertisements
Similar presentations
The Binary Numbering Systems
Advertisements

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:
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 Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
CSE115: Introduction to Computer Science I
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 Office hours: M-F 11:00-11:
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:
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
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 Office hours: M-F 11:00-11:
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, Java Version, Third Edition.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third Edition.
Storage of Bits Computers represent information as patterns of bits
1 Lecture-2 CS-120 Fall 2000 Revision of Lecture-1 Introducing Computer Architecture The FOUR Main Elements Fetch-Execute Cycle A Look Under the Hood.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third Edition.
Chapter 1 Data Storage. 2 Chapter 1: Data Storage 1.1 Bits and Their Storage 1.2 Main Memory 1.3 Mass Storage 1.4 Representing Information as Bit Patterns.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Fourth Edition.
University College Cork IRELAND Number Systems, Data Types, Codes Logic Gates: An Introduction.
I am an L&S CS major. Why do I have to take this class? So you don’t look stupid when you get to your job. To prepare you for hands-on courses like CS.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall 1.
Simple Data Type Representation and conversion of numbers
ES 244: Digital Logic Design Chapter 1 Chapter 1: Introduction Uchechukwu Ofoegbu Temple University.
Binary Codes Computers and other digital systems "work" with binary numbers. I/P & O/P is usually done using decimal numbers, alphabetics, special symbols.
CS231: Computer Architecture I Laxmikant Kale Fall 2004.
Logic and data representation Revision. AND gate A B A B All inputs have to be true ( i.e 1) for the output of the gate to be high, in all other cases.
Circuit, State Diagram, State Table
Computer Science 1000 Digital Circuits. Digital Information computers store and process information using binary as we’ve seen, binary affords us similar.
Click to edit Master title style Click to edit Master text styles –Second level Third level –Fourth level »Fifth level 1 Today’s Topics How information.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall NEW   NEW 1.
IT253: Computer Organization
CSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall 1.
Number Systems Spring Semester 2013Programming and Data Structure1.
1 Lecture 3 ENGRE 254 1/14/09. 2 Lecture 1 review Digital signals assume two values represented by “0” and “1”. Typically a “0” represents a voltage near.
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall
Tutorial: ITI1100 Dewan Tanvir Ahmed SITE, UofO
EKT 124 / 3 DIGITAL ELEKTRONIC 1
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall
Outline Binary Addition 2’s complement Binary Subtraction Half Adder
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall
Data Representation. How is data stored on a computer? Registers, main memory, etc. consists of grids of transistors Transistors are in one of two states,
Bits, Data types, and Operations: Chapter 2 COMP 2610 Dr. James Money COMP
Topic: Binary Encoding – Part 1
Invitation to Computer Science, C++ Version, Fourth Edition
EKT 124 / 3 DIGITAL ELEKTRONIC 1
CSCI-100 Introduction to Computing
Data Encoding Characters.
University of Gujrat Department of Computer Science
Invitation to Computer Science, Java Version, Third Edition
For OCR GCSE Computing Unit 1 - Theory
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Table 1.1 Powers of Two.
UNIT – 3 & 4. Data Representation and Internal
Presentation transcript:

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

Announcements Recitations begin next week for TWF groups. Th recitations begin the week after. Put your name sign out! Cell phones off. 2

Today Representing things –information encoding –symbol interpretation 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 But first… 3

Name sign competition And the winners are: 9:00 AM – KAYLA 3:00 PM – STEPHANIE 4

Counting Decimal (base 10) etc. Binary (base 2) etc. 5

Number systems Decimal (base 10) Each position is weighted by a power of 10. E.g. 734 = –7* *10 + 4*1 –7* * *10 0 E.g = –1* * *10 + 1*1 –1* * * *10 0 Binary (base 2) Each position is weighted by a power of 2. E.g. 111 = –1*4 + 1*2 + 1*1 = “seven” –1* * *2 0 E.g = –1*8 + 1*4 + 0*2 + 1*1 = “thirteen” –1* * * *2 0 6

Same information Different encoding Color (RGB & CMYK) Quantity (Decimal & Binary) 7

Bit string A ‘0’ or ‘1’ is a binary digit, or a bit. A sequence of bits is called a bit string. For example: –1101 is a bit string 8

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

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

Bit-string representations (used in computers) Binary (non-negative numbers) Two’s complement (integers) IEEE 754 (approx. floating point numbers) ASCII / EBCDIC / Unicode (characters) etc. 11

Questions? 12

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

Idea 14

Controlling flow 0 15

Controlling flow 1 16

Two in a row? 0 17

Two in a row? 0 18

Two in a row? 0 19

Two in a row? 1 20

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

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 23

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 25

Truth table for NOT InputOutput

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

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

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

Setting the flip-flop …which makes the output of the OR gate 1. S (set) = 1 R (reset) = 0 remembered value 30 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! 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

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

Questions? 36