Chapter 1?PC Basic??1
1.1 Storage 1
1.2 Outer Hardware 3
1.3 Smartphone, Tablet and Laptop 5
1.4 Exercise 1 7
1.5 Further Reading： Flash Memory 8
1.5.1 The Basics 8
1.5.2 Removable Flash Memory Cards 9
1.5.3 SmartMedia 10
1.5.4 CompactFlash 10
Chapter 2?How Computer Monitors Work??12
2.1 The Basics 12
2.1.1 Display Technology Background 13
2.1.2 Display Technologies： VGA 13
2.1.3 Display Technology： DVI 13
2.1.4 Viewable Area 14
2.1.5 Maximum Resolution and Dot Pitch 14
2.1.6 Dot Pitch 14
2.1.7 Refresh Rate 15
2.1.8 Color Depth 16
2.1.9 Power Consumption 17
2.1.10 Monitor Trends： Flat Panels 17
2.2 Exercise 2 18
2.3 Further Reading： Liquid Crystal Display 19
2.3.1 Brief History 21
2.3.2 Transmissive and Reflective Displays 21
2.3.3 Color Displays 21
2.3.4 Passive-matrix and Active-matrix 22
2.3.5 Quality Control 22
2.3.6 Zero-power Displays 23
2.3.7 Drawbacks 23
Chapter 3?How Cell Phones Work?? 25
3.1 Cell-phone Frequencies 25
3.2 Cell-phone Channels 27
3.3 Analog Cell Phones 28
3.4 Along Comes Digital 29
3.5 Inside a Digital Cell Phone 29
3.6 Exercise 3 32
3.7 Further Reading： Cell Phone 33
3.7.1 History 33
3.7.2 Handsets 35
Chapter 4?Digital Camera Basics?? 40
4.1 How does Digital Camera Work 40
4.2 CCD and CMOS： Filmless Cameras 40
4.3 Digital Camera Resolution 41
4.4 Capturing Color 43
4.5 Digital Photography Basics 43
4.6 Megapixel Ratings 44
4.7 Digital Camera Settings and Modes 44
4.8 Shutter Speed 45
4.9 Exercise 4 47
4.10 Further Reading： How to Take Good Photos 48
4.10.1 Digital Camera Problems 49
4.10.2 Image Editing Software 50
Chapter 5?How Bits and Bytes Work?? 53
5.1 Decimal Numbers 53
5.2 Bits 54
5.3 Bytes 55
5.4 Bytes： ASCII 55
5.5 Standard ASCII Character Set 56
5.6 Lots of Bytes 57
5.7 Binary Math 57
5.8 Quick Recap 58
5.9 Exercise 5 58
5.10 Further Reading： How Boolean Logic Works 60
5.10.1 Simple Gates 60
5.10.2 Simple Adders 63
5.10.3 Flip Flops 66
5.10.4 Implementing Gates 68
Chapter 6?Microprocessors?? 71
6.1 Microprocessor History 71
6.2 Microprocessor Progression 72
6.3 Inside a Microprocessor 73
6.4 Microprocessor Instructions 75
6.5 Decoding Microprocessor Instructions 78
6.6 Microprocessor Performance 79
6.7 Microprocessor Trends 79
6.8 64-bit Processors 80
6.9 Exercise 6 81
6.10 Further Reading： E-commerce 82
6.10.1 Commerce 83
6.10.2 The Elements of Commerce 84
6.10.3 Why the Hype 85
6.10.4 The Dell Example 86
6.10.5 The Lure of E-commerce 87
6.10.6 Easy and Hard Aspects of E-commerce 89
6.10.7 Building an E-commerce Site 89
6.10.8 Affiliate Programs 90
6.10.9 Implementing an E-commerce Site 90
Chapter 7?Application Software?? 92
7.1 What is Software 92
7.2 Programming Languages 92
7.2.1 Assemblers 92
7.2.2 Compilers and Interpreters 93
7.2.3 Nonprocedural Languages 94
7.3 Libraries 94
7.4 The Program Development Process 95
7.4.1 Problem Definition 95
7.4.2 Planning 95
7.4.3 Writing the Program 96
7.4.4 Debug and Documentation 96
7.4.5 Maintenance 96
7.5 Writing your Own Programs 97
7.6 Exercise 7 98
7.7 Further Reading： Computer Software 99
7.7.1 Relationship to Hardware 99
7.7.2 System and Application Software 100
7.7.3 Users See Three Layers of Software 100
7.7.4 Software Creation 101
7.7.5 Software in Operation 101
7.7.6 Software Reliability 101
7.7.7 Software Patents 101
7.7.8 System Software 101
Chapter 8?Compiler?? 103
8.1 Introduction and History 103
8.2 Types of Compilers 104
8.3 Compiled vs. Interpreted Languages 105
8.4 Compiler Design 105
8.5 Compiler Front End 106
8.6 Compiler Back End 106
8.7 Exercise 8 108
8.8 Further Reading： Assembly Language 109
8.8.1 Assemblers 110
8.8.2 Assembly Language 111
8.8.3 Machine Instructions 112
8.8.4 Assembly Language Directives 113
8.8.5 Usage of Assembly Language 114
8.8.6 Cross Compiler 115
8.8.7 Compiling a Gcc Cross Compiler 115
Chapter 9?How Java Works?? 116
9.1 A Little Terminology 116
9.2 Downloading the Java Compiler 117
9.3 Your First Program 119
9.4 Understanding What Just Happened 121
9.5 Exercise 9 124
9.6 Further Reading： How Perl Works 125
9.6.1 Getting Started 125
9.6.2 Hello World 126
9.6.3 Variables 127
9.6.4 Loops and Ifs 128
9.6.5 Functions 129
9.6.6 Reading 130
Chapter 10?Database & C?? 131
10.1 Text 131
10.2 Exercise 10 134
10.3 Further Reading： C 135
10.3.1 Technical Overview 136
10.3.2 Features Introduced in C 136
10.3.3 C Library 137
10.3.4 Object-oriented Features of C 137
10.3.5 Design of C 140
10.3.6 History of C 141
10.3.7 C is not a Superset of C 143
Chapter 11?Artificial Intelligence?? 145
11.1 Overview 145
11.2 Strong AI and Weak AI 145
11.2.1 Strong Artificial Intelligence 146
11.2.2 Weak Artificial Intelligence 146
11.2.3 Philosophical Criticism and Support of Strong AI 146
11.3 History Development of AI Theory 148
11.4 Experimental AI Research 149
11.5 Exercise 11 151
11.6 Further Reading： Alan Turing 153
11.6.1 Childhood and Youth 153
11.6.2 College and his Work on Computability 154
11.6.3 Cryptanalysis Code Breaking 155
11.6.4 Work on Early Computers and the Turing Test 156
11.6.5 Work on Pattern Formation and Mathematical Biology 157
11.6.6 Prosecution for Homosexuality and Turings Death 157
Chapter 12?Machine Learning???158
12.1 Overview 159
12.1.1 Types of problems and tasks 159
12.1.2 History and relationships to other fields 160
12.1.3 Theory 161
12.1.4 Approaches 162
12.2 Exercise 12 166
12.3 Further Reading： Applications for machine learning 168
12.3.1 Adaptive websites 168
12.3.2 Affective computing 168
12.3.3 Bioinformatics 168
12.3.4 Brain-machine interfaces 169
12.3.5 Cheminformatics 169
12.3.6 Classifying DNA sequences 169
12.3.7 Computational anatomy 170
12.3.8 Computational finance 171
12.3.9 Computer vision, including object recognition 171
12.3.10 Detecting credit card fraud 171
12.3.11 Software 172
Chapter 13?How DSL Works???174
13.1 Overview 174
13.2 Telephone Lines 175
13.3 Asymmetrical DSL 175
13.4 Distance Limitations 176
13.5 Splitting the Signal： CAP 177
13.6 Splitting the Signal： DMT 177
13.7 DSL Equipment 178
13.7.1 DSL Equipment： Transceiver 179
13.7.2 DSL Equipment： DSLAM 179
13.8 Exercise 13 180
13.9 Further Reading： How Telephones Work 182
13.9.1 A Simple Telephone 182
13.9.2 A Real Telephone 183
13.9.3 The Telephone Network： Wires and Cables 184
13.9.4 The Telephone Network： Digitizing and Delivering 184
13.9.5 Creating Your Own Telephone Network 185
13.9.6 Calling Someone 185
13.9.7 Tones 186
Chapter 14?Internet Infrastructure?? 188
14.1 A Network Example 188
14.2 Bridging The Divide 189
14.3 Backbones 190
14.4 Internet Protocol： IP Addresses & Domain Name System 190
14.5 Uniform Resource Locators 191
14.6 Clients, Servers and Ports 192
14.7 Exercise 14 194
14.8 Further Reading： Modem 195
Chapter 15?How Internet Search Engines Work???199
15.1 Looking at the Web 199
15.2 Building the Index 202
15.3 Building a Search 203
15.4 Future Search 203
15.5 Exercise 15 205
15.6 Further Reading： Web crawler 206
15.6.1 Nomenclature 206
15.6.2 Overview 207
15.6.3 Crawling policy 207
15.6.4 Architectures 209
15.6.5 Security 210
15.6.6 Crawler identification 210
15.6.7 Crawling the deep web 210
15.6.8 Visual vs programmatic crawlers 211
Chapter 16?Encryption?? 212
16.1 In the Key of...212
16.2 Hash This 213
16.3 Are You Authentic 214
16.4 Exercise 16 216
16.5 Further Reading： Identity Theft 217
16.5.1 Types of Identity Theft 217
16.5.2 Stealing Your Identity 217
16.5.3 Accessing Your Personal Information 218
16.5.4 Public Information 219
16.5.5 How To Protect Yourself 219
16.5.6 Internet Transactions 219
16.5.7 If It Happens To You 220
16.5.8 What Congress Is Doing About It 222
16.5.9 What the Future Holds 222
Chapter 17?Taking a Closer Look at the DCE?? 223
17.1 Common Threads 223
17.2 Remote Calls 224
17.3 Directory Services 224
17.4 Distributed Security Service 225
17.5 Distributed File System 225
17.6 Distributed Time Service 226
17.7 Extending and Using the DCE 226
17.8 Exercise 17 227
17.9 Further Reading： How to Kerberize Your Site 228
17.9.1 Introduction 228
17.9.2 Pick a Kerberos Server Machine KDC 229
17.9.3 DCE and Kerberos 229
17.9.4 Install the Kerberos Server 229
17.9.5 Obtain the Necessary Code 229
17.9.6 Do You Need More Code 230
17.9.7 Building the Gnu Tools 230
17.9.8 Building the Gnu C Compiler 231
17.9.9 Compiling Kerberos 232
17.9.10 For All Platforms 233
17.9.11 Configuring the Kerberos KDC 233
17.9.12 Setting Up a Host Server 236
17.9.13 Domain Names 237
17.9.14 Kerberos Clients 237
17.9.15 Getting a Ticket for Another Realm 237
17.9.16 Kerberos Security Problems 238
17.9.17 Kerberos Authentication Option in SSL 238
17.9.18 Available Kerberized Goodies 239
17.9.19 CygnusKerbnet for NT, Macs, and UNIX 239
Chapter 18?What is Wi-Fi and How does it work?? 240
18.1 How does Wi-Fi work 240
18.2 Uses 241
18.3 Frequencies 242
18.4 Advantages and Challenges 243
18.5 Network Security 245
18.6 Exercise 18 248
18.7 Further Reading： Wireless Revolution： The History of Wi-Fi 249
Chapter 19?Shockwave 3-D Technology?? 251
19.1 Uses of Shockwave Technology 252
19.2 Making 3-D Content Accessible 254
19.3 Developing New 3-D Content 255
19.4 Exercise 19 257
19.5 Further Reading： Computer Viruses 258
19.5.1 Types of Infection 258
19.5.2 Whats a Virus259
19.5.3 Whats a Worm 259
19.5.4 Code Red 259
19.5.5 Early Cases： Executable Viruses 260
19.5.6 Boot Sector Viruses 261
19.5.7 E-mail Viruses 261
19.5.8 Prevention of Virus 262
19.5.9 Origins of Virus 264
19.5.10 History of Virus 264
Chapter 20?Kinect?? 266
20.1 Technology 266
20.2 History 268
20.3 Launch 270
20.4 Reception 271
20.5 Sales 272
20.6 Awards 272
20.7 Exercise 20 273
20.8 Further Reading： Software of Kinect 274
20.8.1 Kinect for Windows 274
20.8.2 Software 276
附录A?部分参考译文?? 279
第1章 电脑基本组件 279
第2章 计算机显示器是如何工作的 283
第3章 手机如何工作 288
第4章 数码相机基础知识 293
第5章 位和字节是怎样工作的 297
第6章 微处理器概述 302
第7章 应用软件 310
第8章 编译器 314
第9章 Java是如何工作的 318
第10章 数据库与VC 325
第11章 人工智能 328
第12章 机器学习 334
第13章 DSL是如何工作的 341
第14章 Internet基础结构 345
第15章 网络搜索引擎工作原理 350
第16章 加密 355
第17章 近看DCE 358
第18章 什么是Wi-Fi以及它是如何运作的 362
第19章 Shockwave三维技术 366
第20章 3D体感摄影机：Kinect 370
习题答案?? 377
XII
计算机英语（第2版）
Chapter 5How Bits and Bytes WorkIf you have used a computer for more than five minutes, then you have heard the words bits and bytes. Both RAM and hard disk capacities are measured in bytes, as are file sizes when you examine them in a file viewer.You might hear an advertisement that says, This computer has a 32-bit Pentium processor with 64 megabytes of RAM and 2.1 gigabytes of hard disk space. In this article, we will discuss bits and bytes so that you have a complete understanding.5.1 Decimal NumbersThe easiest way to understand bits is to compare them to something you know： digits. A digit is a single place that can hold numerical values between 0 and 9. Digits are normally combined together in groups to create larger numbers. For example, 6357 has four digits. It is understood that in the number 6357, the 7 is filling the 1s place, while the 5 is filling the 10s place, the 3 is filling the 100s place and the 6 is filling the 1,000s place. So you could express things this way if you wanted to be explicit：6*1000 3*100 5*10 7*1=6000 300 50 7=6357Another way to express it would be to use powers of 10. Assuming that we are going to represent the concept of raised to the power of with the ^ symbol so 10 squared is written as 10^2 , another way to express it is like this：6*10^3 3*10^2 5*10^1 7*10^0=6000 300 50 7=6357What you can see from this expression is that each digit is a placeholder for the next higher power of 10, starting in the first digit with 10 raised to the power of zero.That should all feel pretty comfortable, we work with decimal digits every day. The neat thing about number systems is that there is nothing that forces you to have 10 different values in a digit. Our base-10 number system likely grew up because we have 10 fingers, but if we happened to evolve to have eight fingers instead, we would probably have a base-8 number system. You can have base-anything number systems. In fact, there are lots of good reasons to use different bases in different situations.
5.2 BitsComputers happen to operate using the base-2 number system, also known as the binary number system just like the base-10 number system is known as the decimal number system. The reason computers use the base-2 system is because it makes it a lot easier to implement them with current electronic technology. You could wire up and build computers that operate in base-10, but they would be fiendishly expensive right now. On the other hand, base-2 computers are relatively cheap.So computers use binary numbers, and therefore use binary digits in place of decimal digits. The word bit is a shortening of the words Binary digIT. Whereas decimal digits have 10 possible values ranging from 0 to 9, bits have only two possible values： 0 and 1. Therefore, a binary number is composed of only 0s and 1s, like this： 1011. How do you figure out what the value of the binary number 1011 is? You do it in the same way we did it above for 6357, but you use a base of 2 instead of a base of 10. So：1*2^3 0*2^2 1*2^1 1*2^0=8 0 2 1=11You can see that in binary numbers, each bit holds the value of increasing powers of 2. That makes counting in binary pretty easy. Starting at zero and going through 20, counting in decimal and binary looks like this：0=01=12=103=114=1005=1016=1107=1118=10009=100110= 101011= 101112= 110013= 110114= 111015= 111116= 1000017= 1000118= 1001019= 1001120= 10100 When you look at this sequence, 0 and 1 are the same for decimal and binary number systems. At the number 2, you see carrying first take place in the binary system. If a bit is 1, and you add 1 to it, the bit becomes 0 and the next bit becomes 1. In the transition from 15 to 16 this effect rolls over through 4 bits, turning 1111 into 10000.5.3 BytesBits are rarely seen alone in computers. They are almost always bundled together into 8-bit collections, and these collections are called bytes. Why are there 8 bits in a byte? A similar question is, Why are there 12 eggs in a dozen? The 8-bit byte is something that people settled on through trial and error over the past 50 years.With 8 bits in a byte, you can represent 256 values ranging from 0 to 255, as shown here：0=000000001=000000012=00000010...254=11111110255=11111111You known that a CD uses 2 bytes, or 16 bits, per sample. That gives each sample a range from 0 to 65,535, like this：0=00000000000000001=00000000000000012=0000000000000010...65534=111111111111111065535=11111111111111115.4 Bytes： ASCIIBytes are frequently used to hold individual characters in a text document. In the ASCII character set, each binary value between 0 and 127 is given a specific character. Most computers extend the ASCII character set to use the full range of 256 characters available in a byte. The upper 128 characters handle special things like accented characters from common foreign languages.You can see the 127 standard ASCII codes below. Computers store text documents, both on disk and in memory, using these codes. For example, if you use Notepad in Windows 9598 to create a text file containing the words, Four score and seven years ago, Notepad would use 1 byte of memory per character including 1 byte for each space character between the wordsASCII character 32. When Notepad stores the sentence in a file on disk, the file will also contain 1 byte per character and per space.Try this experiment： Open up a new file in Notepad and insert the sentence, Four score and seven years ago in it. Save the file to disk under the name getty.txt. Then use the explorer and look at the size of the file. You will find that the file has a size of 30 bytes on disk： 1 byte for each character. If you add another word to the end of the sentence and resave it, the file size will jump to the appropriate number of bytes. Each character consumes a byte.If you were to look at the file as a computer looks at it, you would find that each byte contains not a letter but a numberthe number is the ASCII code corresponding to the character see below. So on disk, the numbers for the file look like this：Fou r a ndsev en70 111 11711432 97110 100 32 115 101 118 101 110 By looking in the ASCII table, you can see a one-to-one correspondence between each character and the ASCII code used. Note the use of 32 for a space32 is the ASCII code for a space. We could expand these decimal numbers out to binary numbers so 32=00100000 if we wanted to be technically correctthat is how the computer really deals with things.5.5 Standard ASCII Character SetThe first 32 values 0 through 31 are codes for things like carriage return and line feed. The space character is the 33rd value, followed by punctuation, digits, uppercase characters and lowercase characters. See Table 5.1.Table 5.1 ASCII Character Set0NUL12FF24CAN36$4806074J86V3ETX15SI27ESC39''51363?75K87W4EOT16DLE28FS4052464@76L88X5ENQ17DC129GS4153565A77M89Y6ACK18DC230RS42*54666B78N90Z7BEL19DC331US43 55767C79O91[8BS20DC432
44,56868D80P92\9TAB21NAK33!45-57969E81Q93]10LF22SYN34"46.58：70F82R94^11VT23ETB35#4759;71G83S95_???????????????????????????????????????Continued??96`100d104h108l112p116t120x124|97a101e105i109m113q117u121y125}98b102f106j110n114r118v122z126~99c103g107k111o115s119w123{127DEL5.6 Lots of BytesWhen you start talking about lots of bytes, you get into prefixes like kilo, mega and giga, as in kilobyte, megabyte and gigabyte also shortened to K, M and G, as in Kbytes, Mbytes and Gbytes or KB, MB and GB. Table 5.2 shows the multipliers：Table 5.2 The multipliersNameAbbr.SizeKiloK2^10=1,024MegaM2^20=1,048,576GigaG2^30=1,073,741,824TeraT2^40=1,099,511,627,776PetaP2^50=1,125,899,906,842,624ExaE2^60=1,152,921,504,606,846,976ZettaZ2^70=1,180,591,620,717,411,303,424YottaY2^80=1,208,925,819,614,629,174,706,176You can see in this chart that kilo is about a thousand, mega is about a million, giga is about a billion, and so on. So when someone says, This computer has a 2 gig hard drive, what he or she means is that the hard drive stores 2 gigabytes, or approximately 2 billion bytes, or exactly 2,147,483,648 bytes. How could you possibly need 2 gigabytes of space? When you consider that one CD holds 650 megabytes, you can see that just three CDs worth of data will fill the whole thing! Terabyte databases are fairly common these days, and there are probably a few petabyte databases floating around the Pentagon by now.5.7 Binary MathBinary math works just like decimal math, except that the value of each bit can be only 0 or 1. To get a feel for binary math, lets start with decimal addition and see how it works. Assume that we want to add 452 and 751： 452 7511203To add these two numbers together, you start at the right： 2 1=3. No problem. Next, 5 5=10, so you save the zero and carry the 1 over to the next place. Next, 4 7 1 because of the carry=12, so you save the 2 and carry the 1. Finally, 0 0 1=1. So the answer is 1203.Binary addition works exactly the same way： 010 1111001Starting at the right, 0 1=1 for the first digit. No carrying there. Youve got 1 1=10 for the second digit, so save the 0 and carry the 1. For the third digit, 0 1 1=10, so save the zero and carry the 1. For the last digit, 0 0 1=1. So the answer is 1001. If you translate everything over to decimal you can see it is correct： 2 7=9.5.8 Quick RecapTo sum up this entire article, heres what weve learned about bits and bytes：* Bits are binary digits. A bit can hold the value 0 or 1.* Bytes are made up of 8 bits each.* Binary math works just like decimal math, but each bit can have a value of only 0or 1.There really is nothing more to itbits and bytes are that simple!Keywordsbits位bytes 字节decimal numbers十进制数powers幂binary numbers 二进制数symbol 符号placeholder 占位符bundled 捆绑character字符correspondence对应5.9 Exercise 5Multiple or single choices.1. Bits are binary digits. A bit can hold the value：_______.A. 0B. 1C. 2D. 3
2. Bytes are made up of ____ bits each.A. 2B. 4C. 8D. 16
3. Transform decimal number55 into binary number____.A. 110001B. 101101C. 110111D. 101101
4. Transform binary number11110011 into decimal number ____.A. 241B. 243C. 245D. 247
5. Inquire the standard ASCII Character Set, calculate M minus C, the result is ____.A.7B.8C.9D.10True or False.1. The space character is the 33rd value in a standard ASCII character set.?2. Bytes are made up of 16 bits each.?3. Each bit can have a value of only 0 or 1.?4. By looking in the ASCII table, you can see a one-to-one correspondence between each character and the ASCII code used.?5. kilo is about a thousand, mega is about a billion, giga is about a million.5.10 Further Reading： How Boolean Logic Works Have you ever wondered how a computer can do something like balance a check book, or play chess, or spell-check a document? These are things that, just a few decades ago, only humans could do. Now computers do them with apparent ease. How can a chip made up of silicon and wires do something that seems like it requires human thought?If you want to understand the answer to this question down at the very core, the first thing you need to understand is something called Boolean logic. Boolean logic, originally developed by George Boole in the mid 1800s, allows quite a few unexpected things to be mapped into bits and bytes. The great thing about Boolean logic is that, once you get the hang of things, Boolean logic or at least the parts you need in order to understand the operations of computers is outrageously simple. In this article we will first discuss simple logic gates, and then see how to combine them into something useful.5.10.1 Simple GatesThere are three, five or seven simple gates that you need to learn about, depending on how you want to count them you will see why in a moment. With these simple gates you can build combinations that will implement any digital component you can imagine. These gates are going to seem a little dry here, and incredibly simple, but we will see some interesting combinations in the following sections that will make them a lot more inspiring.The simplest possible gate is called an inverter, or a NOT gate. It takes one bit as input and produces as output its opposite. The table below shows a logic table for the NOT gate and the normal symbol for it in circuit diagrams：NOT Gate
You can see in this figure that the NOT gate has one input called A and one output called Q Q is used for the output because if you used O, you would easily confuse it with zero. The table shows how the gate behaves. When you apply a 0 to A, Q produces a 1. When you apply a 1 to A, Q produces a 0. Simple.The AND gate performs a logical and operation on two inputs, A and B：
The idea behind an AND gate is, If A AND B are both 1, then Q should be 1. You can see that behavior in the logic table for the gate. You read this table row by row, like this：
?The next gate is an OR gate. Its basic idea is, If A is 1 OR B is 1 or both are 1, then Q is 1.
Those are the three basic gates thats one way to count them. It is quite common to recognize two others as well： the NAND and the NOR gate. These two gates are simply combinations of an AND or an OR gate with a NOT gate. If you include these two gates, then the count rises to five. Heres the basic operation of NAND and NOR gatesyou can see they are simply inversions of AND and OR gates：NOR Gate
NAND Gate
?The final two gates that are sometimes added to the list are the XOR and XNOR gates, also known as exclusive or and exclusive nor gates, respectively. Here are their tables：XOR Gate
XNOR Gate
購物車/收銀台(
0
) | 在線留言板
| 付款方式
| 運費計算
| 聯絡我們
| 幫助中心 |
加入書簽
HOME
新書上架
