1 A Balanced Introduction to Computer Science, 2/E David Reed, Creighton University ©2008 Pearson Prentice Hall ISBN 978-0-13-601722-6 Chapter 12 Data.

Slides:



Advertisements
Similar presentations
Dale & Lewis Chapter 3 Data Representation Analog and digital information The real world is continuous and finite, data on computers are finite  need.
Advertisements

Information Representation
Technology ICT Option: Data Representation. Data Representation In our everyday lives, we communicate with each other using analogue data. This data takes.
3.1 3 Data Storage Foundations of Computer Science  Cengage Learning.
The Binary Numbering Systems
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.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third & Fourth Edition Spring 2008:
Connecting with Computer Science, 2e
8 November Forms and JavaScript. Types of Inputs Radio Buttons (select one of a list) Checkbox (select as many as wanted) Text inputs (user types text)
Connecting with Computer Science 2 Objectives Learn why numbering systems are important to understand Refresh your knowledge of powers of numbers Learn.
Chapter 5 Data representation.
Fundamentals Rawesak Tanawongsuwan
©Brooks/Cole, 2003 Chapter 2 Data Representation.
Chapter 2 Data Representation. Define data types. Visualize how data are stored inside a computer. Understand the differences between text, numbers, images,
Department of Physics and Astronomy DIGITAL IMAGE PROCESSING
Higher Computing Data Representation.
Lecture 5.
Computing Higher - Unit 1… Computer Systems 1 Higher Computing Unit 1 – Topic 1 Data Representation.
CSCI-235 Micro-Computers in Science Hardware Part II.
Computers and Scientific Thinking David Reed, Creighton University Data Representation 1.
2-1 Chapter 2 - Data Representation Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Chapter Contents.
Invitation to Computer Science 5th Edition
Chapter 11 Fluency with Information Technology 4 th edition by Lawrence Snyder (slides by Deborah Woodall : 1.
1 Perception, Illusion and VR HNRS 299, Spring 2008 Lecture 14 Introduction to Computer Graphics.
Data Representation CS280 – 09/13/05. Binary (from a Hacker’s dictionary) A base-2 numbering system with only two digits, 0 and 1, which is perfectly.
Lec 3: Data Representation Computer Organization & Assembly Language Programming.
Data Representation and Storage Lecture 5. Representations A number value can be represented in many ways: 5 Five V IIIII Cinq Hold up my hand.
Chapter 3 Representation. Key Concepts Digital vs Analog How many bits? Some standard representations Compression Methods 3-2.
3-1 Data and Computers Computers are multimedia devices, dealing with a vast array of information categories. Computers store, present, and help us modify.
Data Representation The method of data representation in a computer system depends upon the type of data which is being used. Three types of data are considered.
Lecture 5. Topics Sec 1.4 Representing Information as Bit Patterns Representing Text Representing Text Representing Numeric Values Representing Numeric.
Chapter 2 : Business Information Business Data Communications, 6e.
Chapter 1 Data Storage © 2007 Pearson Addison-Wesley. All rights reserved.
Marr CollegeHigher ComputingSlide 1 Higher Computing: COMPUTER SYSTEMS Part 1: Data Representation – 6 hours.
Quiz # 1 Chapters 1,2, & 3.
Chapter 1 Data Storage © 2007 Pearson Addison-Wesley. All rights reserved.
Data Representation, Number Systems and Base Conversions
Data Representation Robin Burke IT 130. Outline Data Representation Binary Numbers Image types.
Data Representation The storage of Text Numbers Graphics.
Marwan Al-Namari 1 Digital Representations. Bits and Bytes Devices can only be in one of two states 0 or 1, yes or no, on or off, … Bit: a unit of data.
1 Information Representation in Computer Lecture Nine.
CSCI-100 Introduction to Computing Hardware Part II.
Data Representation. What is data? Data is information that has been translated into a form that is more convenient to process As information take different.
Chapter 1 Background 1. In this lecture, you will find answers to these questions Computers store and transmit information using digital data. What exactly.
COMP135/COMP535 Digital Multimedia, 2nd edition Nigel Chapman & Jenny Chapman Chapter 2 Lecture 2 – Digital Representations.
Chapter 1 Data Storage © 2007 Pearson Addison-Wesley. All rights reserved.
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,
Chapter 3: Data Representation Chapter 3 Data Representation Page 17 Computers use bits to represent all types of data, including text, numerical values,
Representing Sound and Image. Representing images One mean of representing an image it to interpret the image as a collection of dots, each is called.
Software Design and Development Storing Data Part 2 Text, sound and video Computing Science.
 Computers are 2-state devices › Pulse – No pulse › On – Off  Represented by › 1 – 0  BINARY.
Data Representation. In our everyday lives, we communicate with each other using analogue data. This data takes the form of: Sound Images Letters Numbers.
1 A Balanced Introduction to Computer Science David Reed, Creighton University ©2005 Pearson Prentice Hall ISBN X Chapter 12 Data Representation.
1 Section 1.3 Binary Number Systems Fundamentals of Java: AP Computer Science Essentials, 4th Edition Lambert / Osborne.
Computer Science: An Overview Eleventh Edition
Invitation to Computer Science, C++ Version, Fourth Edition
Data Representation.
Everything is a number Everything in a computer memory and on storages is a number. Number  Number Characters  Number by ASCII code Sounds  Number.
Level 3 Extended Diploma Unit 19 Computer Systems Architecture
3 Data Storage Foundations of Computer Science ã Cengage Learning.
Chapter 3 Data Storage.
Invitation to Computer Science, Java Version, Third Edition
Web Design and Development
Ch2: Data Representation
The Building Blocks: Binary Numbers, Boolean Logic, and Gates
Chapter 2 Data Representation.
Option: Data Representation
Option: Data Representation
CSCI-235 Micro-Computer Applications
Presentation transcript:

1 A Balanced Introduction to Computer Science, 2/E David Reed, Creighton University ©2008 Pearson Prentice Hall ISBN Chapter 12 Data Representation

2 Analog vs. Digital there are two ways data can be stored electronically 1. analog signals represent data in a way that is analogous to real life signals can vary continuously across an infinite range of values e.g., frequencies on an old-fashioned radio with a dial 2. digital signals utilize only a finite set of values e.g., frequencies on a modern radio with digital display the major tradeoff between analog and digital is variability vs. reproducibility analog allows for a (potentially) infinite number of unique signals, but they are harder to reproduce  good for storing data that is highly variable but does not need to be reproduced exactly digital signals limit the number of representable signals, but they are easily remembered and reproduced  good for storing data when reproducibility is paramount

3 Binary Numbers modern computers save and manipulate data as discrete (digital) values the most effective systems use two distinct binary states for data representation in essence, all data is stored as binary numbers in the binary number system, all values are represented using only the two binary digits 0 and 1, which are called bits binary representation converting binary to decimal

4 Decimal  Binary algorithm for converting from decimal (D) to binary (B):

5 Representing Integers when an integer value must be saved on a computer, its binary equivalent can be encoded as a bit pattern and stored digitally usually, a fixed size (e.g., 32 bits) is used for each integer so that the computer knows where one integer ends and another begins the initial bit in each pattern acts as the sign bit (0=positive, 1=negative) negative numbers are represented in two’s complement notation  the "largest" bit pattern corresponds to the smallest absolute value (-1)

6 Representing Real Numbers a real number can be uniquely identified by the two components of its scientific notation (fractional part and the exponent) = x = 42 x thus, any real number can be stored as a pair of integers real numbers stored in this format are known as floating point numbers, since the decimal point moves (floats) to normalize the fraction standard formats exist for storing real numbers, using either 32 or 64bits most programming languages represent integers and reals differently JavaScript simplifies things by using IEEE double-precision floating point for all numbers

7 Representing Characters characters have no natural correspondence to binary numbers computer scientists devised an arbitrary system for representing characters as bit patterns ASCII (American Standard Code for Information Interchange)  maps each character to a specific 8-bit pattern  note that all digits are contiguous, as are lower- and upper-case letters '0' < '1' < … < '9' 'A' < 'B' < … < 'Z' 'a' < 'b' < … < 'z' Unicode is a 16-bit extension to ASCII that supports other languages

8 Representing Text strings can be represented as sequences of ASCII codes, one for each character in the string specific programs may store additional information along with the ASCII codes e.g. programming languages will often store the number of characters along with the ASCII codes e.g., word processing programs will insert special character symbols to denote formatting (analogous to HTML tags in a Web page)

9 Representing Sounds computers are capable of representing much more than numbers and text complex data requires additional techniques and algorithms EXAMPLE: representing sounds sounds are inherently analog signals with a specific amplitudes and frequencies when sound waves reach your ear, they cause your eardrum to vibrate, and your brain interprets the vibration as sound e.g. telephones translate a waveform into electrical signals, which are then sent over a wire and converted back to sound e.g. phonographs interpret waveforms stored on on grooves of a disk (similar to audio cassettes) analog signals cannot be reproduced exactly, but this is not usually a problem since the human ear is unlikely to notice small inconsistencies

10 Representing Sounds (cont.) when analog recordings are repeatedly duplicated, small errors that were originally unnoticed begin to propagate digital recordings can be reproduced exactly without any deterioration in sound quality  analog waveforms must be converted to a sequence of discrete values  digital sampling is the process in which the amplitude of a wave is measured at regular intervals, and stored as discrete measurements  frequent measurements must be taken to ensure high quality (e.g., 44,100 readings per second for a CD)  this results in massive amounts of storage  techniques are used to compress the data and reduce file sizes (e.g., MP3, WAV)

11 Representing Images EXAMPLE: representing images images are stored using a variety of formats and compression techniques the simplest representation is a bitmap bitmaps partition an image into a grid of picture elements, called pixels, and then convert each pixel into a bit pattern resolution refers to the sharpness or clarity of an image bitmaps that are divided into smaller pixels will yield higher resolution images the left image is stored using 96 pixels per square inch, and the right image is stored using 48 pixels per square inch  the left image appears sharp, but has twice the storage requirements

12 Representing Images (cont.) when creating a bitmap of a color image, more than one bit is required to represent each pixel the most common system is to translate each pixel into a 24 bit code, known as its RGB value: 8 bits to represent the intensity of each red/green/blue component common image formats implement various compression techniques to reduce storage size GIF (Graphics Interchange Format)  a lossless format, meaning no information is lost in the compression  commonly used for precise pictures, such as line drawings JPEG (Joint Photographic Experts Group)  a lossy format, so the compression is not fully reversible (but more efficient)  commonly used for photographs

13 Distinguishing Data Types how does a computer know what type of value is stored in a particular piece of memory? short answer: it doesn't when a program stores data in memory, it must store additional information as to what type of data the bit pattern represents thus, the same bit pattern might represent different values in different contexts