计算机科学导论 Chap 01.ppt

An Introductionto Computer Science;Chapter 1: Data Storage;Chapter 1: Data Storage (continued);Bits and Bit Patterns;Boolean Operations;Figure 1.1 The Boolean operations AND, OR, and XOR (exclusive or);Gates;Figure 1.2 A pictorial representation of AND, OR, XOR, and NOT gates as well as their input and output values;Flip-flops;Figure 1.3 A simple flip-flop circuit;Figure 1.4 Setting the output of a flip-flop to 1;Figure 1.4 Setting the output of a flip-flop to 1 (continued);Figure 1.4 Setting the output of a flip-flop to 1 (continued);Figure 1.5 Another way of constructing a flip-flop;Hexadecimal Notation;Figure 1.6 The hexadecimal coding system;Main Memory Cells;Figure 1.7 The organization of a byte-size memory cell;Main Memory Addresses;Figure 1.8 Memory cells arranged by address;Memory Terminology;Measuring Memory Capacity;Mass Storage;Mass Storage Systems;Figure 1.9 A magnetic disk storage system;Figure 1.10 Magnetic tape storage;Figure 1.11 CD storage;Files;Figure 1.12 Logical records versus physical records on a disk;Representing Text;Figure 1.13 The message “Hello.” in ASCII;Representing Numeric Values;Representing Images;Representing Sound;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;Figure 1.15 The base ten and binary systems;Figure 1.16 Decoding the binary representation 100101;Figure 1.17 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.19 The binary addition facts;Figure 1.20 Decoding the binary representation 101.101;Storing Integers;Figure 1.21 Two’s complement notation systems;Figure 1.22 Coding the value -6 in two’s complement notation using four bits;Figure 1.23 Addition problems converted to two’s complement notation;Figure 1.24 An excess eight conversion table;Figure 1.25 An excess notation system using bit patterns of leng