Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7...

36
Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear

Transcript of Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7...

Page 1: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-1 Copyright © 2003 Pearson Education, Inc.

Figure:

Computer Sciencean overview

EDITION 7

J. Glenn Brookshear

Page 2: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-2 Copyright © 2003 Pearson Education, Inc.

C H A P T E R 1

Data Storage

Page 3: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-3 Copyright © 2003 Pearson Education, Inc.

Figure 1.1: The Boolean operations AND, OR, and XOR (exclusive or)

Page 4: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-4 Copyright © 2003 Pearson Education, Inc.

Figure 1.2: A pictorial representation of AND, OR, XOR, and NOT gates as well as their

input and output values (continued)

Page 5: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-5 Copyright © 2003 Pearson Education, Inc.

Figure 1.2: A pictorial representation of AND, OR, XOR, and NOT gates as well as their input and output values

Page 6: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-6 Copyright © 2003 Pearson Education, Inc.

Figure 1.3: A simple flip-flop circuit

Page 7: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-7 Copyright © 2003 Pearson Education, Inc.

Figure 1.4: Setting the output of a flip-flop to 1 (continued)

Page 8: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-8 Copyright © 2003 Pearson Education, Inc.

Figure 1.4: Setting the output of a flip-flop to 1 (continued)

Page 9: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-9 Copyright © 2003 Pearson Education, Inc.

Figure 1.4: Setting the output of a flip-flop to 1

Page 10: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-10 Copyright © 2003 Pearson Education, Inc.

Figure 1.5: Another way of constructing a flip-flop

Page 11: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-11 Copyright © 2003 Pearson Education, Inc.

Figure 1.6: The hexadecimal coding system

Page 12: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-12 Copyright © 2003 Pearson Education, Inc.

Figure 1.7: The organization of a byte-size memory cell

Page 13: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-13 Copyright © 2003 Pearson Education, Inc.

Figure 1.8: Memory cells arranged by address

Page 14: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-14 Copyright © 2003 Pearson Education, Inc.

Figure 1.9: Memory cells arranged by address

Page 15: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-15 Copyright © 2003 Pearson Education, Inc.

Figure 1.10: CD storage format

Page 16: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-16 Copyright © 2003 Pearson Education, Inc.

Figure 1.11: A magnetic tape storage mechanism

Page 17: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-17 Copyright © 2003 Pearson Education, Inc.

Figure 1.12: Logical records versus physical records on a disk

Page 18: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-18 Copyright © 2003 Pearson Education, Inc.

Figure 1.13: The message “Hello.” in ASCII

Page 19: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-19 Copyright © 2003 Pearson Education, Inc.

Figure 1.14: The base ten and binary systems

Page 20: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-20 Copyright © 2003 Pearson Education, Inc.

Figure 1.15: Decoding the binary representation 100101

Page 21: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-21 Copyright © 2003 Pearson Education, Inc.

Figure 1.16: An algorithm for finding the binary representation of a positive integer

Page 22: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-22 Copyright © 2003 Pearson Education, Inc.

Figure 1.17: Applying the algorithm in Figure 1.15 to obtain the binary representation of thirteen

Page 23: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-23 Copyright © 2003 Pearson Education, Inc.

Figure 1.18: The sound wave represented by the sequence 0, 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

Page 24: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-24 Copyright © 2003 Pearson Education, Inc.

Figure 1.19: The binary addition facts

Page 25: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-25 Copyright © 2003 Pearson Education, Inc.

Figure 1.20: Decoding the binary representation 101.101

Page 26: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-26 Copyright © 2003 Pearson Education, Inc.

Figure 1.21: Two’s complement notation systems

Page 27: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-27 Copyright © 2003 Pearson Education, Inc.

Figure 1.22: Coding the value -6 in two’s complement notation using four bits

Page 28: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-28 Copyright © 2003 Pearson Education, Inc.

Figure 1.23: Addition problems converted to two’s complement notation

Page 29: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-29 Copyright © 2003 Pearson Education, Inc.

Figure 1.24: An excess eight conversion table

Page 30: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-30 Copyright © 2003 Pearson Education, Inc.

Figure 1.25: An excess notation system using bit patterns of length three

Page 31: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-31 Copyright © 2003 Pearson Education, Inc.

Figure 1.26: Floating-point notation components

Page 32: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-32 Copyright © 2003 Pearson Education, Inc.

Figure 1.27: Coding the value 2 5/8

Page 33: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-33 Copyright © 2003 Pearson Education, Inc.

Figure 1.28: Decompressing xyxxyzy (5, 4, x)

Page 34: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-34 Copyright © 2003 Pearson Education, Inc.

Figure 1.29: The ASCII codes for the letters A and F adjusted for odd parity

Page 35: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-35 Copyright © 2003 Pearson Education, Inc.

Figure 1.30: An error-correcting code

Page 36: Slide 1-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear.

Slide 1-36 Copyright © 2003 Pearson Education, Inc.

Figure 1.31: Decoding the pattern 010100 using the code in Figure 1.30