国外优秀信息科学与技术系列教学用书 计算机科学基础 从数据操纵到计算理论 影印版【2025|PDF|Epub|mobi|kindle电子书版本百度云盘下载】

国外优秀信息科学与技术系列教学用书 计算机科学基础 从数据操纵到计算理论 影印版PDF格式电子书版下载

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

PART Ⅰ COMPUTER AND DATA1

Chapter 1 Introduction2

1.1 The Computer as a Black Box3

Data Processor3

Programmable Data Processor3

1.2 von Neumann Model5

Four Subsystems5

Stored Program Concept6

Sequential Execution of Instructions6

1.3 Computer Hardware6

1.4 Data6

Storing Data6

Organizing Data7

1.5 Computer Software7

Programs Must Be Stored7

A Sequence of Instructions7

Algorithms8

Languages8

Software Engineering8

Operating Systems8

1.6 History9

Mechanical Machines(Before 1930)9

Birth of Electronic Computers(1930-1950)9

1.7 Key Terms11

1.8 Summary11

1.9 Practice Set11

Chapter 2 Data Representation14

2.1 Data Types15

2.2 Data inside the Computer15

Bit16

Bit Pattern16

Byte16

2.3 Representing Data17

Text17

Numbers19

Images19

Audio20

Video21

2.4 Hexadecimal Notation21

Conversion22

2.5 Octal Notation23

Conversion23

2.6 Key Terms24

2.7 Summary24

2.8 Practice Set25

Chapter 3 Number Representation27

3.1 Decimal and Binary28

Decimal System28

Binary System28

3.2 Conversion29

Binary to Decimal Conversion29

Decimal to Binary Conversion29

3.3 Integer Representation30

Unsigned Integers Format31

Sign-and-Magnitude Format33

One's Complement Format35

Two's Complement Format37

Summary of Integer Representation39

3.4 Excess System40

3.5 Floating-Point Representation40

Converting to Binary40

Normalization42

Sign,Exponent,and Mantissa42

IEEE Standards42

3.6 Hexadecimal Notation44

3.7 Key Terms44

3.8 Summary45

3.9 Practice Set45

Chapter 4 Operations on Bits50

4.1 Arithmetic Operations51

Arithmetic Operations on Integers51

Arithmetic Operations on Floating-Point Numbers54

4.2 Logical Operations55

Truth Tables56

Unary Operator56

Binary Operators57

Applications60

4.3 Shift Operations63

4.4 Key Terms64

4.5 Summary65

4.6 Practice Set65

PART Ⅱ COMPUTER HARDWARE69

Chapter 5 Computer Organization70

5.1 Central Processing Unit(CPU)71

Arithmetic Logic Unit(ALU)71

Registers71

Control Unit72

5.2 Main Memory72

Address Space72

Memory Types74

Memory Hierarchy75

Cache Memory75

5.3 Input/Output76

Nonstorage Devices76

Storage Devices76

5.4 Subsystem Interconnection83

Connecting CPU and Memory83

Connecting I/O Devices84

Addressing Input/Output Devices86

5.5 Program Execution87

Machine Cycle87

A Machine Cycle Example88

Input/Output Operation89

5.6 Two Different Architectures92

CISC92

RISC93

5.7 Key Terms93

5.8 Summary93

5.9 Practice Set94

Chapter 6 Computer Networks99

6.1 Networks,Large and Small100

Model and Protocol100

6.2 OSI Model100

Seven Layers100

Functions of the Layers101

6.3 Categories of Networks103

Local Area Network(LAN)103

Metropolitan Area Network(MAN)104

Wide Area Network(WAN)104

6.4 Connecting Devices105

Repeaters106

Bridges107

Routers108

Gateways108

6.5 The Internet and TCP/IP109

Physical and Data-Link Layers110

Network Layer110

Transport Layer111

Application Layer111

6.6 Key Terms116

6.7 Summary116

6.8 Practice Set117

PART Ⅲ COMPUTER SOFTWARE121

Chapter 7 Operating Systems122

7.1 Definition123

7.2 Evolution123

Batch Systems123

Tune-Sharing Systems123

Personal Systems124

Parallel Systems124

Distributed Systems124

7.3 Components124

Memory Manager125

Process Manager129

Device Manager135

File Manager135

User Interface136

7.4 Popular Operating Systems136

Windows 2000136

UNIX136

Linux136

7.5 Key Terms137

7.6 Summary137

7.7 Practice Set138

Chapter 8 Algorithms141

8.1 Concept142

Informal Definition142

Example142

Defining Actions144

Refinement144

Generalization144

8.2 Three Constructs145

Sequence146

Decision146

Repetition146

8.3 Algorithm Representation146

Flowchart146

Pseudocode146

8.4 More Formal Definition150

Ordered Set150

Unambiguous Steps150

Produce a Result150

Terminate in a Finite Time150

8.5 Subalgorithms150

Structure Chart152

8.6 Basic Algorithms152

Summation152

Product152

Smallest and Largest153

Sorting153

Searching158

8.7 Recursion160

Iterative Definition160

Recursive Definition161

8.8 Key Terms162

8.9 Summary162

8.10 Practice Set163

Chapter 9 Programming Languages166

9.1 Evolution167

Machine Languages167

Symbolic Languages168

High-Level Languages168

Natural Languages169

9.2 Building a Program169

Writing and Editing Programs169

Compiling Programs170

Linking Programs170

9.3 Program Execution171

9.4 Categories of Languages171

Procedural(Imperative)Languages172

Object-Oriented Languages173

Functional Languages175

Declarative(Logic)Languages176

Special Languages177

9.5 A Procedural Language:C179

Identifiers179

Data Types179

Variables180

Constants181

Input and Output182

Expressions182

Statements183

Functions184

Selection186

Repetition187

Derived Data Types189

Recursion189

9.6 Key Terms189

9.7 Summary190

9.8 Practice Set191

Chapter 10 Software Engineering195

10.1 Software Life Cycle196

Analysis Phase197

Design Phase197

Implementation Phase197

Testing Phase198

10.2 Development Process Models198

Waterfall Model198

Incremental Model199

10.3 Modularity200

Tools200

Coupling200

Cohesion201

10.4 Quality202

Quality Defined202

Quality Factors203

The Quality Circle205

10.5 Documentation206

User Documentation206

System Documentation206

Documentation as an Ongoing Process207

10.6 Key Terms207

10.7 Summary208

10.8 Practice Set208

PART Ⅳ DATA ORGANIZATION213

Chapter 11 Data Structures214

11.1 Arrays215

Array Applications217

Two-Dimensional Arrays218

11.2 Records219

Accessing Records220

11.3 Linked Lists220

Nodes221

Pointers to Linked Lists221

Operations on Linked Lists221

11.4 Key Terms223

11.5 Summary224

11.6 Practice Set224

Chapter 12 Abstract Data Types227

12.1 Background228

Definition228

Model for an Abstract Data Type229

Operations on ADTs229

12.2 Linear Lists229

Operations on Linear Lists230

Implementation of a General Linear List232

Linear List Applications232

12.3 Stacks232

Operations on Stacks233

Implementation of a Stack234

Stack Applications234

12.4 Queues235

Operations on Queues235

Implementation of a Queue237

Queue Applications237

12.5 Trees237

Basic Tree Concepts237

Operations on Trees239

12.6 Binary Trees239

Operations on Binary Trees241

Implementation of a Binary Tree243

Binary Tree Applications243

12.7 Graphs244

Terminology244

Operations on Graphs245

Implementation of a Graph247

Graph Applications248

12.8 Key Terms249

12.9 Summary249

12.10 Practice Set251

Chapter 13 File Structures256

13.1 Access Methods257

Sequential Access257

Random Access257

13.2 Sequential Files257

Updating Sequential Files258

13.3 Indexed Files259

Inverted Files260

13.4 Hashed Files261

Hashing Methods261

Collision263

13.5 Text versus Binary265

Text Files265

Binary Files266

13.6 Key Terms266

13.7 Summary266

13.8 Practice Set267

Chapter 14 Databases270

14.1 Database Management System271

14.2 Architecture272

Internal Level272

Conceptual Level272

External Level272

14.3 Database Models273

Hierarchical Model273

Network Model273

Relational Model274

14.4 Relational Model274

Relation274

14.5 Operations on Relations275

Insert275

Delete275

Update276

Select276

Project277

Join277

Union277

Intersection278

Difference278

14.6 Structured Query Language279

Statements279

14.7 Other Database Models282

Distributed Databases282

Object-Oriented Databases282

14.8 Key Terms283

14.9 Summary283

14.10 Practice Set284

PART Ⅴ ADVANCED TOPICS289

Chapter 15 Data Compression290

15.1 Lossless Compression291

Run-Length Encoding291

Huffman Coding292

Lempel Ziv Encoding294

15.2 Lossy Compression Methods298

Image Compression:JPEG298

Video Compression:MPEG301

15.3 Key Terms303

15.4 Summary303

15.5 Practice Set303

Chapter 16 Security306

Privacy307

Authentication307

Integrity307

Nonrepudiation307

16.1 Privacy307

Encryption/Decryption307

Privacy Using the Combination311

16.2 Digital Signature311

Signing the Whole Document312

Signing the Digest312

16.3 Key Terms314

16.4 Summary314

16.5 Practice Set315

Chapter 17 Theory of Computation317

17.1 Simple Language318

Increment Statement318

Decrement Statement318

Loop Statement318

Power of the Simple Language318

Conclusion321

17.2 Turing Machine321

Turing Machine Components321

Simulation of Simple Language323

Conclusion325

17.3 G？del Numbers326

Representing a Program326

Interpreting a Number327

17.4 Halting Problem327

Halting Problem is not Solvable328

17.5 Solvable and Unsolvable Problems329

Unsolvable Problems329

Solvable Problems330

17.6 Key Terms331

17.7 Summary331

17.8 Practice Set332

Appendix A ASCII Code335

Appendix B Unicode339

Alphabets340

Symbols and Punctuation Marks341

CJK Auxiliaries341

CJK Unified Ideographs341

Surrogates342

Private Use342

Miscellaneous Characters and Symbols342

Appendix C Flowcharts343

C.1 Auxiliary Symbols344

Start and Stop344

Flow Lines345

Connectors345

C.2 Main Symbols345

Sequence Statements345

Selection Statements347

Looping Statements348

Appendix D Pseudocode350

D.1 Components351

Algorithm Header351

Purpose,Conditions,and Return351

Statement Numbers351

Statement Constructs351

Sequence352

Selection352

Loop352

Appendix E Structure Charts353

E.1 Structure Chart Symbols354

Function Symbol354

Selection in Structure Charts355

Loops in Structure Charts355

Data Flows356

E.2 Reading Structure Charts356

E.3 Rules of Structure Charts357

Appendix F Discrete Cosine Transform358

F.1 Discrete Cosine Transform359

F.2 Inverse Transform359

Appendix G Acronyms360

Glossary361

Index377