Data Representation Bits

Slides:



Advertisements
Similar presentations
PICAXE Memory.
Advertisements

Program Memory MIPS memory operations Getting Variable Addresses Advanced structures.
Chapter 2 Machine Language.
Pointers & Dynamic Memory Allocation Mugurel Ionu Andreica Spring 2012.
2.3) Example of program execution 1. instruction  B25 8 Op-code B means to change the value of the program counter if the contents of the indicated register.
ENGIN112 L30: Random Access Memory November 14, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 30 Random Access Memory (RAM)
Chapter 2 Machine Language. Machine language The only language a computer can understand directly. Each type of computer has its own unique machine language.
Computer Systems. Computer System Components Computer Networks.
Execution of an instruction
J. Michael Moore Computer Organization CSCE 110. J. Michael Moore High Level View Of A Computer ProcessorInputOutput Memory Storage.
What is a Computer? A device that can run under specific directions What is a Program? –A specific set of instructions given to the computer –Requires.
CSCE 121, Sec 200, 507, 508 Fall 2010 Prof. Jennifer L. Welch.
Computer Processing CSCE 110 J. Michael Moore.
J. Michael Moore Computer Organization CPSC 110. J. Michael Moore High Level View Of A Computer ProcessorInputOutput Memory Storage.
CS 151 Digital Systems Design Lecture 30 Random Access Memory (RAM)
J. Michael Moore Computer Processing CSCE 110. J. Michael Moore ProcessorInputOutput Memory Storage.
CHARACTERS Data Representation. Using binary to represent characters Computers can only process binary numbers (1’s and 0’s) so a system was developed.
5th Meeting “BITS AND BYTES” BIT A bit or binary digit is the basic unit of information in computing and telecommunications. It is the amount of information.
Riyadh Philanthropic Society For Science Prince Sultan College For Woman Dept. of Computer & Information Sciences CS 251 Introduction to Computer Organization.
Data Representation S2. This unit covers how the computer represents- Numbers Text Graphics Control.
Computer Architecture and the Fetch-Execute Cycle
COMPUTER SCIENCE Data Representation and Machine Concepts Section 1.2 Instructor: Lin Chen August 2013.
1 3 Computing System Fundamentals 3.2 Computer Architecture.
CS41B MACHINE David Kauchak CS 52 – Fall Admin  Assignment 3  due Monday at 11:59pm  one small error in 5b (fast division) that’s been fixed.
Damian Gordon. HARD DISK (MAIN MEMORY) (SECONDARY MEMORY) 2 CACHE 1.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
CS 111 – Sept. 15 Chapter 2 – Manipulating data by performing instructions “What is going on in the CPU?” Commitment: –Please read through section 2.3.
Computer Organization & Assembly Language © by DR. M. Amer.
Lecture 7: 9/17/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.
How We Measure Memory. Learning Goal Today we are going to learn how the computer stores information.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI N305 Information Representation: Machine Instructions.
Represents different voltage levels High: 5 Volts Low: 0 Volts At this raw level a digital computer is instructed to carry out instructions.
Thursday 8 th October, 2015 Information Technology Fundamentals of Hardware & Software.
An Example Architecture. A Paper Computer - Woody Woody's characteristics Word size – 8 bits One word.
Compilers Modern Compiler Design
Introduction to ComputersS1.1.1 Bina © 1998 Liran & Ofir Programming in C.
Binary 101 Gads Hill School. Aim To strengthen understanding of how computers use the binary number system to store information.
Chapter 20 Computer Operations Computer Studies Today Chapter 20.
Memory, Bits, & Bytes. Memory Part of the computer where programs and data are stored. Read and written (changed). Bit – Binary digit – Basic unit of.
1 Section 1.3 Binary Number Systems Fundamentals of Java: AP Computer Science Essentials, 4th Edition Lambert / Osborne.
How do Computers Work ?.
Computer Systems – Memory & the 3 box Model
2.0 COMPUTER SYSTEM 2.2 Number System and Representation
David Kauchak CS 52 – Spring 2016
Data Representation – Instructions
Basic notes on pointers in C
Data Representation Question: Characters
Variables with Memory Diagram
By: Briley Cooper, David Chaney, Josh Martin, and Mason Branscum
Computer Organization & Compilation Process
CSCE Fall 2013 Prof. Jennifer L. Welch.
IO Overview CSCE 121 J. Michael Moore
MIPS Instruction Encoding
Direct Mapping.
Data Representation Limitations
MIPS Instruction Encoding
Storing Information Each memory cell stores a set number of bits (usually 8 bits, or one byte) (byte addressable)
Topic 1: Data Representation
How Functions Work Part 2
How Computers Store Data
Computer Organization
CSCE Fall 2012 Prof. Jennifer L. Welch.
Essential Class Operations
The University of Adelaide, School of Computer Science
Linked List Configurations
STORE MANAGER RESPONSIBILITIES.
Computer Organization & Compilation Process
Information Representation: Machine Instructions
8/23/
Presentation transcript:

Data Representation Bits CSCE 121 J. Michael Moore

How Data Is Stored Byte: a group of 8 bits; 28=256 possibilities 00000000, 00000001, 00000010, 00000011, … , 11111111 Memory: long sequence of locations, each large enough to hold one byte, numbered 0, 1, 2, 3, … Address: The number of the location Note: We are using 8 bit addresses for our example to simplify the explanation. Addresses in modern are much longer. A 32 bit computer has 32 bit addresses. A 64 bit computer has 64 bit addresses. J. Michael Moore

How Data Is Stored Contents of a location can change bits 1 1 2 3... bytes Contents of a location can change e.g. 01011010 can become 11100001 Use consecutive locations to store longer sequences e.g. 4 bytes = 1 word J. Michael Moore