+ All Categories
Home > Documents > Computer Science — An Overview J. Glenn Brookshear

Computer Science — An Overview J. Glenn Brookshear

Date post: 02-Jan-2016
Category:
Upload: rae-garza
View: 74 times
Download: 5 times
Share this document with a friend
Description:
Chapter One, Figures 1-13 Data Storage. Computer Science — An Overview J. Glenn Brookshear. Figure 1.1 The Boolean operations AND, OR, and XOR. Figure 1.2 (A) A pictorial representation of AND, OR, XOR, and NOT gates as well as their input and output values. - PowerPoint PPT Presentation
17
Computer Science, An Overview Brookshear © 2000 Addison Wesley Computer Science — An Overview J. Glenn Brookshear Chapter One, Figures 1- 13 Data Storage
Transcript
Page 1: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Computer Science — An Overview J. Glenn Brookshear

Chapter One, Figures 1-13 Data Storage

Page 2: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.1The Boolean operations AND, OR, and XOR

Page 3: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

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

Page 4: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

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

Page 5: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.3A simple flip-flop circuit

Page 6: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

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

Page 7: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

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

Page 8: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

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

Page 9: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.5Another way of constructing a flip-flop

Page 10: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.6The hexidecimal coding system

Page 11: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.7Memory cells arranged by address

Page 12: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.8The organization of a byte-size memory cell

Page 13: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.9A disk storage system

Page 14: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.10A magnetic tape storage mechanism

Page 15: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.11Logical records versus physical records on a disk

Page 16: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.12The message “Hello.” in ASCII

Page 17: Computer Science — An Overview J. Glenn Brookshear

Computer Science, An Overview Brookshear © 2000 Addison Wesley

Figure 1.13The base ten and binary systems


Recommended