0% found this document useful (0 votes)
55 views30 pages

Chap 01 - Lecture 2

Uploaded by

vowir12193
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
55 views30 pages

Chap 01 - Lecture 2

Uploaded by

vowir12193
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

Chapter 1:

Data Storage

Computer Science: An Overview


Tenth Edition

by
J. Glenn Brookshear

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Bits and Bit Patterns

• Bit: Binary Digit (0 or 1)


• Bit Patterns are used to represent information.
– Numbers
– Text characters
– Images
– Sound
– And others

1-2

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


2
Boolean Operations

• Boolean Operation: An operation that


manipulates one or more true/false values
• Specific operations
– AND
– OR
– XOR (exclusive or)
– NOT

1-3

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


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

1-4

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


4
Gates

• 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)

1-5

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


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

1-6

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


6
Flip-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 preserved

1-7

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


7
Figure 1.3 A simple flip-flop circuit

1-8

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


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

1-9

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


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

1-10

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


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

1-11

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


11
Figure 1.5 Another way of
constructing a flip-flop

1-12

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


12
Hexadecimal 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 A3

1-13

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


13
Figure 1.6 The hexadecimal coding
system

1-14

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


14
Main 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

1-15

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


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

1-16

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


16
Main 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.

1-17

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


17
Figure 1.8 Memory cells arranged by
address

1-18

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


18
Measuring Memory Capacity

• Kilobyte: 210 bytes = 1024 bytes


– Example: 3 KB = 3 times 1024 bytes
– Sometimes “kibi” rather than “kilo”
• Megabyte: 220 bytes = 1,048,576 bytes
– Example: 3 MB = 3 times 1,048,576 bytes
– Sometimes “megi” rather than “mega”
• Gigabyte: 230 bytes = 1,073,741,824 bytes
– Example: 3 GB = 3 times 1,073,741,824 bytes
– Sometimes “gigi” rather than “giga”

1-19

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


19
Measuring Memory Capacity

1-20

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Measuring Memory Capacity

1-21

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Mass Storage

• On-line versus off-line


• Typically larger than main memory
• Typically less volatile than main memory
• Typically slower than main memory

1-22

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


22
Mass Storage Systems

• Magnetic Systems
– Disk
– Tape
• Optical Systems
– CD
– DVD
• Flash Drives

1-23

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


23
Figure 1.9 A magnetic disk storage
system

1-24

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


24
Related Video

https://www.youtube.com/watch?v=bMSXQhra6hY

1-25

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Files

• File: A unit of data stored in mass storage


system
– Fields and keyfields
• Physical record versus Logical record
• Buffer: A memory area used for the
temporary storage of data (usually as a
step in transferring the data)

1-26

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


26
Representing Text

• Each character (letter, punctuation, etc.) is


assigned a unique bit pattern.
– ASCII: Uses patterns of 7-bits to represent
most symbols used in written English text
– Unicode: Uses patterns of 16-bits to represent
the major symbols used in languages world
side
– ISO standard: Uses patterns of 32-bits to
represent most symbols used in languages
world wide

1-27

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


27
Figure 1.13 The message “Hello.” in
ASCII

1-28

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


28
Representing Numeric Values

• Binary notation: Uses bits to represent a


number in base two
• Limitations of computer representations of
numeric values
– Overflow – occurs when a value is too big to
be represented
– Truncation – occurs when a value cannot be
represented accurately

1-29

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


29
The Binary System

The traditional decimal system is based


on powers of ten.

The Binary system is based on powers


of two.

1-30

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


30

You might also like