Slide 1Chapter 1: Data StorageChapter 1: Data Storage (continued)Bits and Bit PatternsSlide 5Boolean OperationsFigure 1.1 The Boolean operations AND, OR, and XOR (exclusive or)GatesFigure 1.2 A pictorial representation of AND, OR, XOR, and NOT gates as well as their input and output valuesCombination of gatesExerciseFlip-flopsFigure 1.3 A simple flip-flop circuitFigure 1.4 Setting the output of a flip-flop to 1Figure 1.4 Setting the output of a flip-flop to 1 (continued)Slide 16Figure 1.5 Another way of constructing a flip-flopHexadecimal NotationFigure 1.6 The hexadecimal coding systemMain Memory CellsFigure 1.7 The organization of a byte-size memory cellMain Memory AddressesFigure 1.8 Memory cells arranged by addressSlide 24Memory TerminologyMeasuring Memory CapacityMass StorageMass Storage SystemsFigure 1.9 A magnetic disk storage systemFilesFigure 1.12 Logical records versus physical records on a diskSlide 32Representing TextFigure 1.13 The message “Hello.” in ASCIIRepresenting Numeric ValuesRepresenting ImagesThe Binary SystemFigure 1.15 The base ten and binary systemsFigure 1.16 Decoding the binary representation 100101Figure 1.17 An algorithm for finding the binary representation of a positive integerFigure 1.18 Applying the algorithm in Figure 1.15 to obtain the binary representation of thirteenFigure 1.19 The binary addition factsFigure 1.20 Decoding the binary representation 101.101Slide 44Storing IntegersFigure 1.21 Two’s complement notation systemsFigure 1.22 Coding the value -6 in two’s complement notation using four bitsFigure 1.23 Addition problems converted to two’s complement notationStoring FractionsFigure 1.26 Floating-point notation componentsFigure 1.27 Encoding the value 2 5⁄8Data CompressionCommunication ErrorsNumber SystemChapter 1Data Storage © 2007 Pearson Addison-Wesley.All rights reserved© 2007 Pearson Addison-Wesley. All rights reserved0-2Chapter 1: Data Storage•1.1 Bits and Their Storage•1.2 Main Memory•1.3 Mass Storage•1.4 Representing Information as Bit Patterns•1.5 The Binary System•1.6 Storing Integers© 2007 Pearson Addison-Wesley. All rights reserved0-3Chapter 1: Data Storage (continued)•1.7 Storing Fractions•1.8 Data Compression•1.9 Communications Errors© 2007 Pearson Addison-Wesley. All rights reserved0-4Bits and Bit Patterns•Bit: Binary Digit (0 or 1)© 2007 Pearson Addison-Wesley. All rights reserved0-5•Bit Patterns are used to represent information.–Numbers–Text characters–Images–Sound–And othersBits and Bit Patterns© 2007 Pearson Addison-Wesley. All rights reserved0-6Boolean Operations•Boolean Operation: An operation that manipulates one or more true/false values•Specific operations–AND –OR–XOR (exclusive or)–NOT© 2007 Pearson Addison-Wesley. All rights reserved0-7Figure 1.1 The Boolean operations AND, OR, and XOR (exclusive or)© 2007 Pearson Addison-Wesley. All rights reserved0-8Gates•Gate: A device that computes a Boolean operation–Often implemented as (small) electronic circuits–Provide the building blocks from which computers are constructed© 2007 Pearson Addison-Wesley. All rights reserved0-9Figure 1.2 A pictorial representation of AND, OR, XOR, and NOT gates as well as their input and output values© 2007 Pearson Addison-Wesley. All rights reserved0-10Combination of gates•NAND •NOR© 2007 Pearson Addison-Wesley. All rights reserved0-11ExerciseWhat is the output of the circuit below?© 2007 Pearson Addison-Wesley. All rights reserved0-12Flip-flops•Flip-flop: A circuit built from gates that can store one bit.–Has an input line which sets its stored value to 1–Has an input line which sets its stored value to 0–While both input lines are 0, the most recently stored value is preserved© 2007 Pearson Addison-Wesley. All rights reserved0-13Figure 1.3 A simple flip-flop circuit© 2007 Pearson Addison-Wesley. All rights reserved0-14Figure 1.4 Setting the output of a flip-flop to 1© 2007 Pearson Addison-Wesley. All rights reserved0-15Figure 1.4 Setting the output of a flip-flop to 1 (continued)© 2007 Pearson Addison-Wesley. All rights reserved0-16Figure 1.4 Setting the output of a flip-flop to 1 (continued)© 2007 Pearson Addison-Wesley. All rights reserved0-17Figure 1.5 Another way of constructing a flip-flop© 2007 Pearson Addison-Wesley. All rights reserved0-18Hexadecimal Notation•Hexadecimal notation: A shorthand notation for long bit patterns–Divides a pattern into groups of four bits each–Represents each group by a single symbol© 2007 Pearson Addison-Wesley. All rights reserved0-19Figure 1.6 The hexadecimal coding systemExample: 10100011 becomes A3© 2007 Pearson Addison-Wesley. All rights reserved0-20Main Memory Cells•Cell: A unit of main memory (typically 8 bits which is one byte)–Most significant bit: the bit at the left (high-order) end of the conceptual row of bits in a memory cell–Least significant bit: the bit at the right (low-order) end of the conceptual row of bits in a memory cell© 2007 Pearson Addison-Wesley. All rights reserved0-21Figure 1.7 The organization of a byte-size memory cell© 2007 Pearson Addison-Wesley. All rights reserved0-22Main Memory Addresses•Address: A “name” that uniquely identifies one cell in the computer’s main memory–The names are actually numbers.–These numbers are assigned consecutively starting at zero.–Numbering the cells in this manner associates an order with the memory cells.© 2007 Pearson Addison-Wesley. All rights reserved0-23Figure 1.8 Memory cells arranged by address© 2007 Pearson Addison-Wesley. All rights reserved0-24Figure 1.8 Memory cells arranged by address0000000110Assume the size of main memory is 1024 bytes,what is the address of cell 6?© 2007 Pearson Addison-Wesley. All rights reserved0-25Memory Terminology•Random Access Memory (RAM): Memory in which individual cells can be easily accessed in any order•Dynamic Memory (DRAM): RAM composed of volatile memory© 2007 Pearson Addison-Wesley. All rights reserved0-26Measuring Memory Capacity•Kilobyte: 210 bytes = 1024 bytes–Example: 3 KB = 3 × 1024 bytes–Sometimes “kibi” rather than “kilo”•Megabyte: 220 bytes = 1,048,576 bytes–Example: 3 MB = 3 × 1,048,576 bytes–Sometimes “megi” rather than “mega”•Gigabyte: 230 bytes = 1,073,741,824 bytes–Example: 3 GB = 3 × 1,073,741,824 bytes–Sometimes “gigi” rather than “giga”© 2007 Pearson Addison-Wesley. All rights