PowerPoint PresentationChapter 1: Data StorageChapter 1: Data Storage (continued)Bits and Bit PatternsBoolean 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 valuesFlip-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 13Figure 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 addressMemory TerminologyMeasuring Memory CapacityMass StorageMass Storage SystemsFigure 1.9 A magnetic disk storage systemFigure 1.10 Magnetic tape storageFigure 1.11 CD storageFilesFigure 1.12 Logical records versus physical records on a diskRepresenting TextFigure 1.13 The message “Hello.” in ASCIIRepresenting Numeric ValuesRepresenting ImagesRepresenting SoundFigure 1.14 The sound wave represented by the sequence 0, 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0The 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.101Storing 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 notationFigure 1.24 An excess eight conversion tableFigure 1.25 An excess notation system using bit patterns of length threeStoring FractionsFigure 1.26 Floating-point notation componentsFigure 1.27 Encoding the value 2 5⁄8Data CompressionCompressing ImagesCompressing Audio and VideoCommunication ErrorsFigure 1.28 The ASCII codes for the letters A and F adjusted for odd parityFigure 1.29 An error-correcting codeFigure 1.30 Decoding the pattern 010100 using the code in Figure 1.30Copyright © 2012 Pearson Education, Inc. Chapter 1:Data StorageComputer Science: An OverviewEleventh Editionby J. Glenn BrookshearCopyright © 2012 Pearson Education, Inc. 0-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 SystemCopyright © 2012 Pearson Education, Inc. 0-3Chapter 1: Data Storage (continued)•1.6 Storing Integers•1.7 Storing Fractions•1.8 Data Compression•1.9 Communications ErrorsCopyright © 2012 Pearson Education, Inc. 0-4Bits and Bit Patterns•Bit: Binary Digit (0 or 1)•Bit Patterns are used to represent information.–Numbers–Text characters–Images–Sound–And othersCopyright © 2012 Pearson Education, Inc. 0-5Boolean Operations•Boolean Operation: An operation that manipulates one or more true/false values•Specific operations–AND–OR–XOR (exclusive or)–NOTCopyright © 2012 Pearson Education, Inc. 0-6Figure 1.1 The Boolean operations AND, OR, and XOR (exclusive or)Copyright © 2012 Pearson Education, Inc. 0-7Gates•Gate: A device that computes a Boolean operation–Often implemented as (small) electronic circuits–Provide the building blocks from which computers are constructed–VLSI (Very Large Scale Integration)Copyright © 2012 Pearson Education, Inc. 0-8Figure 1.2 A pictorial representation of AND, OR, XOR, and NOT gates as well as their input and output valuesCopyright © 2012 Pearson Education, Inc. 0-9Flip-flops•Flip-flop: A circuit built from gates that can store one bit.–One input line is used to set its stored value to 1–One input line is used to set its stored value to 0–While both input lines are 0, the most recently stored value is preservedCopyright © 2012 Pearson Education, Inc. 0-10Figure 1.3 A simple flip-flop circuitCopyright © 2012 Pearson Education, Inc. 0-11Figure 1.4 Setting the output of a flip-flop to 1Copyright © 2012 Pearson Education, Inc. 0-12Figure 1.4 Setting the output of a flip-flop to 1 (continued)Copyright © 2012 Pearson Education, Inc. 0-13Figure 1.4 Setting the output of a flip-flop to 1 (continued)Copyright © 2012 Pearson Education, Inc. 0-14Figure 1.5 Another way of constructing a flip-flopCopyright © 2012 Pearson Education, Inc. 0-15Hexadecimal 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•Example: 10100011 becomes A3Copyright © 2012 Pearson Education, Inc. 0-16Figure 1.6 The hexadecimal coding systemCopyright © 2012 Pearson Education, Inc. 0-17Main 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 cellCopyright © 2012 Pearson Education, Inc. 0-18Figure 1.7 The organization of a byte-size memory cellCopyright © 2012 Pearson Education, Inc. 0-19Main 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.Copyright © 2012 Pearson Education, Inc. 0-20Figure 1.8 Memory cells arranged by addressCopyright © 2012 Pearson Education, Inc. 0-21Memory Terminology•Random Access Memory (RAM): Memory in which individual cells can be easily accessed in any order•Dynamic Memory (DRAM): RAM composed of volatile memoryCopyright © 2012 Pearson Education, Inc. 0-22Measuring Memory Capacity•Kilobyte: 210 bytes = 1024 bytes–Example: 3 KB = 3 times1024 bytes•Megabyte: 220 bytes = 1,048,576 bytes–Example: 3 MB = 3 times 1,048,576 bytes•Gigabyte: 230 bytes = 1,073,741,824 bytes–Example: 3 GB = 3 times 1,073,741,824 bytesCopyright © 2012 Pearson Education, Inc. 0-23Mass Storage•On-line versus off-line•Typically larger than main memory•Typically less volatile than main memory•Typically slower than main memoryCopyright © 2012 Pearson Education, Inc. 0-24Mass Storage