Data Storage – Part 1 CS 1 Introduction to Computers and Computer Technology Rick Graziani Fall 2013.

Slides:



Advertisements
Similar presentations
Introduction to Digital Systems By Dr. John Abraham UT-Panam.
Advertisements

Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.
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.
Section 10.3 Logic Gates.
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.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
CS 105 Digital Logic Design
Bits and Data Storage. Basic Hardware Units of a Computer.
1 Survey of Computer Science CSCI 110, Spring 2011 Lecture 16 Digital Circuits, binary Numbers.
Programmable Logic Controllers
Computers Organization & Assembly Language
Boolean Algebra and Digital Logic Chapter 3. Chapter 3 Objectives  Understand the relationship between Boolean logic and digital computer circuits. 
Boolean Logic By: Arthur Brooks February 25, 2003 Think, Speak, and Write Computer Science.
Test #1 rescheduled to next Tuesday, 09/20/05 The contents will cover chapter 1, 2, and part of Chapter 4. The contents will cover chapter 1, 2, and part.
Think about the following expression If the number entered is greater than 15 but less than 25 or the number is 100 and the letter chosen is after p but.
Binary Numbers.
1 Introduction to Abstract Mathematics Applications : Digital Logic Circuits 2.4 and Number Systems 2.5 Instructor: Hayk Melikya
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
CSCI-235 Micro-Computers in Science Hardware Design Part I.
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
Computer Terminology Chapter 2 CIT History of Computers First known device used to compute was the Abacus 3000 BC 1617 John Napier created a crude.
Digital Logic Operations and Functions. Basic Logic Operations Logic, as you know it, involves in a making of digital system. Logic, as you know it, involves.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
CSCI-100 Introduction to Computing Hardware Design Part I.
CSC 107 – Programming For Science. George Boole  Mathematician from English middle-class  Lived from 1815 – 1864  Started work at age 16 as a teaching.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Digital Circuits Text Book –M. M. Mano, "Digital Design," 3rd Ed., Prentice Hall Inc., Reference –class notes Grade –quizzes:15% –mid-term:27.5%
How computers calculate How binary operations yield complex capabilities.
1 Ethics of Computing MONT 113G, Spring 2012 Session 1 Digital Circuits, binary Numbers Course webpage:
MECH1500 Chapter 3.
Logic Design / Processor and Control Units Tony Diep.
Logic Design EE-2121 Manesh T. Digital Systems  Introduction  Binary Quantities and Variables  Logic Gates  Boolean Algebra  Combinational Logic.
Introduction to Computing Systems and Programming Digital Logic Structures.
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
1 Logic Gates CS 202, Spring 2008 Epp, sections 1.4 and 1.5.
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
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.
Digital logic COMP214  Lecture 1 Dr. Sarah M.Eljack Chapter 1 1.
Logic gates.
3 – Boolean Logic and Logic Gates 4 – Binary Numbers
Invitation to Computer Science, C++ Version, Fourth Edition
Computer Science 210 Computer Organization
CSCI-100 Introduction to Computing
Chapter 2.3 Binary Logic.
Fundamentals & Ethics of Information Systems IS 201
University of Gujrat Department of Computer Science
Invitation to Computer Science, Java Version, Third Edition
Chapter 1 Data Storage.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Fundamentals of Computer Science Part i2
Computer Science 210 Computer Organization
Digital Logic.
Logic Gates.
Logic Gates.
Digital Logic.
Chapter 10.3 and 10.4: Combinatorial Circuits
CMSC250 Fall 2018 Circuits 1 1.
CS149D Elements of Computer Science
XOR Function Logic Symbol  Description  Truth Table 
Introductory Concepts
Copyright © Cengage Learning. All rights reserved.
COMPUTER ORGANIZATION
Presentation transcript:

Data Storage – Part 1 CS 1 Introduction to Computers and Computer Technology Rick Graziani Fall 2013

Rick Graziani BIT – BInary digiT Bit (Binary Digit) = Basic unit of information, representing one of two discrete states. The smallest unit of information within the computer. The only thing a computer understands. Abbreviation: b Bit has one of two values: –0 (off) or 1 (on) –0 (False) or 1 (True) OFF ON

Rick Graziani Bits Two patterns are known as the state of the bit. For example, magnetic encoding of information on tapes, floppy disks, and hard disks are done with positive or negative polarity. The boxes illustrate a position where magnetism may be set and sensed; pluses (red) indicate magnetism of positive polarity (1 bit), interpreted as “present” and minuses (blue) (0 bit)

Rick Graziani Bits Bits are really only symbols. Used to display the one of two different, discrete states. Bits are used as: –Storing data Numbers Text characters Images Sound Etc. –Processing data

Rick Graziani Boolean Operations Integrated Circuits (microchips) are used to store and manipulate (process) bits. This is done using Boolean operations (in honor of mathematician George Boole, ). Boolean Operation: An operation that manipulates one or more true/false values Specific operations –AND –OR –XOR (exclusive or) –NOT Using Truth Tables we can uses different sets of logic operations to store, add, subtract, and more complicated operations with bit.

Boolean Algebra and logical expressions (Addendum) Boolean algebra (due to George Boole) - The mathematics of digital logic –Useful in dealing with binary system of numbers. –Used in the analysis and synthesis of logical expressions. Logical expressions – Expressions constructed using logical-variables and operators. –Result is: True or False Boolean algebra – In mathematics a variable uses one of the two possible values: 1 or 0 May also be represented as: –Truth or Falsehood of a statement –On or Off states of a switch –High (5V) or low (0V) of a voltage level Rick Graziani

Used in electronics (Addendum) Electrical circuits are designed to represent logical expressions –Known as logic circuits. Used to make important logical decisions in household appliances, computers, communication devices, traffic signals and microprocessors. Three basic logic operations as listed below: –OR operation –AND operation –NOT operation A logic gate is an electronic circuit/device which makes the logical decisions based on these operations. Rick Graziani

Logic gates (Addendum) Logic gates have: –one or more inputs –only one output The output is active only for certain input combinations. Logic gates are the building blocks of any digital circuit. Rick Graziani

9 Boolean Operations - AND Truth tables (simple ones) AND operation –Both input values must be TRUE for output to be TRUE –Kermit is a frog AND Miss Piggy is an actress –Inputs to AND operation represent truth of falseness of the compound statement. AND = TRUE TRUE

Rick Graziani Boolean Operations Gate: –A device that computes a Boolean operation –A device that produces the output of a Boolean operation when given the operation’s input values. Gates can be: –Gears –Relays –Optic devices –Electronic circuits (microchips)

Rick Graziani Boolean Operations – AND Gate 0 = FALSE 1 = TRUE AND operation Both input values must be TRUE for output to be TRUE Truth Table Inputs Output

Rick Graziani Boolean Operations - OR Truth tables (simple ones) OR operation –Only one input values must be TRUE for output to be TRUE –In Rick likes to surf OR Rick likes to go dancing. –Taking both courses will also TRUE. OR= TRUE TRUE True

Rick Graziani Boolean Operations – OR Gate 0 = FALSE 1 = TRUE OR operation At least one input value must be TRUE for output to be TRUE Truth Table Inputs Output

Rick Graziani Boolean Operations - XOR Truth tables (simple ones) XOR operation –One and ONLY one input value can be TRUE for output to be TRUE –At noon Rick is going to surf the Hook XOR surf Liquor Stores (this is a surf spot) –Both cannot be true, as I cannot surf both spots at the same time. XOR= TRUE TRUE False

Rick Graziani Boolean Operations – XOR Gate 0 = FALSE 1 = TRUE XOR operation Only one input value is TRUE for output to be TRUE Truth Table Inputs Output

Rick Graziani Boolean Operations – NOT Gate 0 = FALSE 1 = TRUE NOT operation Only one input Opposite of input NOT FALSE = TRUE NOT TRUE = FALSE Truth Table Inputs Output

/notes/logsim.html Rick Graziani

Rick Graziani Another way to write it… 0 = FALSE; 1 = TRUE

Rick Graziani Binary Math

Rick Graziani Base 10 (Decimal) Number System Digits (10): 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 Number of: ,000’s 1,000’s 100’s 10’s 1’s

Rick Graziani Base 10 (Decimal) Number System Digits (10): 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 Number of: ,000’s 1,000’s 100’s 10’s 1’s

Rick Graziani Rick’s Number System Rules All digits start with 0 A Base-n number system has n number of digits: –Decimal: Base-10 has 10 digits –Binary: Base-2 has 2 digits –Hexadecimal: Base-16 has 16 digits The first column is always the number of 1’s Each of the following columns is n times the previous column (n = Base-n) –Base 10: 10,000 1, –Base 2: –Base 16: 65,536 4,

Rick Graziani Counting in Decimal (0,1,2,3,4,5,6,7,8,9) 1,000’s 100’s 10’s 1’s ,000’s 100’s 10’s 1’s

Rick Graziani Counting in Binary (0, 1) 8’s 4’s 2’s 1’s ’s 4’s 2’s 1’s Dec

Rick Graziani Binary Math (more later) > ……

Rick Graziani Base 2 (Binary) Number System Digits (2): 0, 1 Number of: ’s 64’s 32’s 16’s 8’s 4’s 2’s 1’s Dec

Rick Graziani Base 2 (Binary) Number System Digits (2): 0, 1 Number of: ’s 64’s 32’s 16’s 8’s 4’s 2’s 1’s Dec

Rick Graziani Converting between Decimal and Binary Digits (2): 0, 1 Number of: ’s 64’s 32’s 16’s 8’s 4’s 2’s 1’s Dec

Rick Graziani Converting between Decimal and Binary Digits (2): 0, 1 Number of: ’s 64’s 32’s 16’s 8’s 4’s 2’s 1’s Dec

Rick Graziani Computers do Binary 0 1 Bits have two values: OFF and ON The Binary number system (Base-2) can represent OFF and ON very well since it has two values, 0 and 1 –0 = OFF –1 = ON Understanding Binary to Decimal conversion is critical in computer science, computer networking, digital media, etc.

Rick Graziani Rick’s Program

Rick Graziani Rick’s Program

Rick Graziani Rick’s Program

Rick Graziani Decimal Math - Addition 10,000’s 1,000’s 100’s 10’s 1’s

Rick Graziani Binary Math - Addition 64’s 32’s 16’s 8’s 4’s 2’s 1’s Double check using Decimal. Dec

Rick Graziani Half Adder Gate – Adding two bits Inputs: A, B S = Sum C = Carry AND XOR A + B = 2’s 1’s

Rick Graziani Half Adder Gate – Adding two bits Inputs: A, B S = Sum C = Carry AND XOR A + B = 2’s 1’s 0 0 = SC

Rick Graziani Half Adder Gate – Adding two bits Inputs: A, B S = Sum C = Carry AND XOR A + B = 2’s 1’s 0 1 = SC

Rick Graziani Half Adder Gate – Adding two bits Inputs: A, B S = Sum C = Carry AND XOR A + B = 2’s 1’s 1 0 = SC

Rick Graziani Half Adder Gate – Adding two bits Inputs: A, B S = Sum C = Carry AND XOR A + B = 2’s 1’s 1 1 = SC

Rick Graziani Marble Adding Machine &feature=fvwp &feature=fvwp

Rick Graziani Flip-flops Flip-flop: A circuit built from gates that can store one bit, uses feedback. A means of storing bits such as RAM Modern computers use technologies with: –greater miniaturization –faster response times –additional circuitry DRAM (Dynamic RAM) SDRAM (Synchronous DRAM) PCs currently use DDR (double data rate) for RAM, DDR1, DDR2 and DDR3 –Type of SDRAM –Each type has types of DIMM (dual in-line memory module) slots (different number of pins)

Rick Graziani Example of Flip Flops storing bits (FYI) S = Set R = Reset DRAM (Dynamic RAM) –Each bit of data is stored in a separate capacitor within an integrated circuit. –Since real capacitors leak charge, the information eventually fades unless the capacitor charge is refreshed periodically.

Rick Graziani Types of RAM Understanding RAM Types: DRAM, SDRAM, DIMM, SIMM & More – AM_SDRAM_DIMM_SIMM_And_Morehttp://proprofs.com/mwiki/index.php?title=Understanding_RAM_Types:_DR AM_SDRAM_DIMM_SIMM_And_More RAM - From Wikipedia, the free encyclopedia – DDR2 SDRAM - From Wikipedia, the free encyclopedia – Dynamic random access memory - From Wikipedia, the free encyclopedia –

Data Storage – Part 1 CS 1 Introduction to Computers and Computer Technology Rick Graziani