Spring 2010
Download
1 / 55

Spring 2010 - PowerPoint PPT Presentation


  • 128 Views
  • Uploaded on

Spring 2010. Lecture 3 Chapter 1.1 thru 1.5 Wednesday, January 20 th 2010. Our Objectives for this section:. Review the Chapter 1 reading assignment. Learn about the bottom level encoding of data via the binary and hex number systems

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Spring 2010' - fifi


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Spring 2010

Spring 2010

Lecture 3

Chapter 1.1 thru 1.5

Wednesday, January 20th 2010


Our objectives for this section
Our Objectives for this section:

  • Review the Chapter 1 reading assignment.

  • Learn about the bottom level encoding of data via the binary and hex number systems

  • Learn about the central role of using bit patterns to encode information.


Objectives cont d
Objectives: (cont’d)

  • Develop an understanding of the rudiments of data storage.

    • This provides the building blocks to understand the chapters that follow.

  • Perform number system conversions

    • These conversions will be a part of the midterm exam.

  • It’s IMPORTANT to remember!These slides are not a substitute for the reading. They are provided here merely for review of

  • what you have read and taken notes on already. You MUST complete the reading assignments, attend class, and take notes. As you re-read, and then revise your notes – you’ll be putting these ideas and concepts into your own words, and you will have made great advances in learning the material.


Intro
Intro..

  • This chapter presents the rudiments of data storage within digital computers. It introduces the basics of digital circuitry and how a simple flip-flop can be used to store a single bit. It then discusses addressable memory cells and mass storage systems (magnetic disk, compact disks, and magnetic tape).

  • Having established this background, the chapter discusses how information (text, numeric values, images, and sound) are encoded as bit patterns. The optional sections delve more deeply into these topics by presenting the problems of overflow errors, truncation errors, error detection and correction techniques, and data compression.


Chapter 1 data storage
Chapter 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


Chapter 1 data storage cont d
Chapter 1: Data Storage(cont’d)

  • 1.6 Storing Integers

  • 1.7 Storing Fractions

  • 1.8 Data Compression

  • 1.9 Communications Errors

    We will not cover these sections of Chapter 1.

    I will post additional optional materials, that you can study if you are interested.


Bits and bit patterns
Bits and Bit Patterns

  • Bit: Binary Digit (0 or 1)

  • Bit Patterns are used to represent information.

    • Numbers

    • Text characters

    • Images

    • Sound

    • And others


Boolean operations
Boolean Operations

  • Boolean Operation: An operation that manipulates one or more true/false values

  • Specific operations

    • AND

    • OR

    • XOR (exclusive or)

    • NOT


Figure 1 1 the boolean operations and or and xor exclusive or
Figure 1.1 The Boolean operations AND, OR, and XOR (exclusive or)


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


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


Flip flops
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


Figure 1 3 a simple flip flop circuit
Figure 1.3 A simple flip-flop circuit


Figure 1 5 another way of constructing a flip flop
Figure 1.5 Another way of constructing a flip-flop


Abstraction flip flop
Abstraction: flip-flop

A simple flip-flop circuit

Another way of

constructing a flip-flop


Abstraction flip flop1
Abstraction: flip-flop

A simple flip-flop circuit

Another way of

constructing a flip-flop


Hexadecimal notation
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

  • How? Break the binary number into four bit groups, and convert to Hex. See the chart on the next slide:

    1010 0011

    A 3


Figure 1 6 the hexadecimal coding system
Figure 1.6 The hexadecimal coding system


Main memory cells
Main Memory Cells

  • Cell: A unit of main memory (typically 8 bits which is one byte)

    • Most significant bit: (MSB) the bit at the left (high-order) end of the conceptual row of bits in a memory cell

    • Least significant bit: (LSB) the bit at the right (low-order) end of the conceptual row of bits in a memory cell


Figure 1 7 the organization of a byte size memory cell
Figure 1.7 The organization of a byte-size memory cell


Main memory addresses
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.



Memory terminology
Memory 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


Measuring memory capacity
Measuring Memory Capacity

  • Kilobyte: 210 bytes = 1024 bytes

    • Example: 3 KB = 3 times1024 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”


Mass storage
Mass Storage

  • On-line versus off-line

  • Typically larger than main memory

  • Typically less volatile than main memory

  • Typically slower than main memory


Mass storage systems
Mass Storage Systems

  • Magnetic Systems

    • Disk

    • Tape

  • Optical Systems

    • CD

    • DVD

  • Flash Drives


Figure 1 9 a magnetic disk storage system
Figure 1.9 A magnetic disk storage system


Figure 1 10 magnetic tape storage
Figure 1.10 Magnetic tape storage


Figure 1 11 cd storage
Figure 1.11 CD storage


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



Representing text
Representing Text disk

  • 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



Representing numeric values
Representing Numeric Values disk

  • 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


Representing images
Representing Images disk

  • Bit map techniques

    • Pixel: short for “picture element”

    • RGB

    • Luminance and chrominance

  • Vector techniques

    • Scalable

    • TrueType and PostScript


Representing sound
Representing Sound disk

  • Sampling techniques

    • Used for high quality recordings

    • Records actual audio

  • MIDI

    • Musical Instrument Digital Interface

    • Used in music synthesizers

    • Records “musical score”


Figure 1 14 the sound wave represented by the sequence 0 1 5 2 0 1 5 2 0 3 0 4 0 3 0 0
Figure 1.14 The sound wave represented by the sequence 0, 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0


The binary system
The Binary System 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

The traditional decimal system is based

on powers of ten.

The Binary system is based on powers

of two.


Figure 1 15 the base ten and binary systems
Figure 1.15 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0 The base ten and binary systems


Figure 1 16 decoding the binary representation 100101
Figure 1.16 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0 Decoding the binary representation 100101


Figure 1 17 an algorithm for finding the binary representation of a positive integer
Figure 1.17 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0 An algorithm for finding the binary representation of a positive integer


Figure 1 18 applying the algorithm in figure 1 15 to obtain the binary representation of thirteen
Figure 1.18 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0Applying the algorithm in Figure 1.15 to obtain the binary representation of thirteen


Converting binary to decimal values
Converting binary to decimal values 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0.

  • Ordered from highest to lowest, the first eight place values of the binary number system are:

    27, 26, 25, 24, 23, 22, 21, 20.

  • To convert a byte, multiply each digit to its corresponding place value and add all eight products. For example, to convert the binary value of 00011001 into a decimal value:

    27, 26, 25, 24, 23, 22, 21, 20.

    0 0 0 1 1 0 0 1

    =(0 x 27) + (0 x 26) + (0 x 25) + (1 x 24) + (1 x 23) + (0 x 22) +(0 x 21) + (1 x 20)

    = 16 + 8 + 1 = 25.


Figure 1 19 the binary addition facts
Figure 1.19 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0The binary addition facts


Quick quiz 1
Quick Quiz 1 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

  • In the world of computers, the term____________________ refers to the two state number system with which all information within the computer is represented.


Answer
Answer: 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

  • binary


Quick quiz 2
Quick Quiz 2 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

  • True or False.

    A byte consists of four bits and a nibble consists of two bits.


Answer1
Answer: 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

  • False


Quick quiz 3
Quick Quiz 3 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

  • ____________________ provide the building blocks from which computers are constructed.


Answer2
Answer: 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

gates


Quick quiz 4
Quick Quiz 4 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

  • A “name” that uniquely identifies one cell in the computer’s main memory is called an ____________________.


Answer3
Answer: 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

address


Quick quiz 5
Quick Quiz 5 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

Specify the reason Hexadecimal notation is used:


Answer4
Answer: 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

  • As a shorthand notation for long bit patterns


Questions

QUESTIONS? 1.5, 2.0, 1.5, 2.0, 3.0, 4.0, 3.0, 0

Assignments:

Check BlackBoard regularly for assignments.

See our schedule on Blackboard, and keep up with the READING ASSIGNMENTS!


ad