390 likes | 517 Views
What is a Computer?. Hardware:. IBM PC, Printer, Network Card Pentium 4, Monitor, Mouse, Scanner, RJ45, Wireless router. Software:. Windows XP, MS Office: Word, Excel, PowerPoint, Access, Outlook; NetBeans, IE, Netscape,... IBM/370.
E N D
What is a Computer? Hardware: IBM PC, Printer, Network Card Pentium 4, Monitor, Mouse, Scanner, RJ45, Wireless router Software: Windows XP, MS Office: Word, Excel, PowerPoint, Access, Outlook; NetBeans, IE, Netscape,... IBM/370 Today, if you don't know these, you can hardly find a no-sweat-job... 30 years ago, if you knew this, you can easily earn $$$,$$$ a year CCLi
Hardware Central Processor Unit: Internal Storage Control Unit + Arithmetic-Logic Unit (ALU) Input device Output device CCLi
What is Computer Science?What are we studying? Theory Hardware Software Architecture Language CCLi
Computer! Computer! Computer! What are they, really? CCLi
Computer -- A machine that can Compute! What is machine? A machine is a device that follows a certain fixed causal rules. What is Computation? A computation is a sequence of procedures that manipulate data. CCLi
René Descartes (1596-1650) Brains are Machines!! Body Dualism: Mind-Body Mind Image from http://www-groups.dcs.st-and.ac.uk/~history/PictDisplay/Descartes.html CCLi
Let’s Compute!! Gottfried W.V Leibniz (1646-1716) “ Sir! Let’s sit down and compute!! ” Image from http://sunsite.informatik.rwth-aachen.de/phil/filosofer/leibniz.html CCLi
Dispute that can't be resolved f(x) dx Gottfried W.V Leibniz (1646-1716) Isaac Newton (1643-1727) Image from http://turnbull.mcs.st-and.ac.uk/ CCLi
Real Life There any tons of problems that can’t be solved by computers? Ideal Life a pure world of forms with infinite computing power Are there any problems that can’t be solved by any computation? CCLi
Alan Turing (1912-1954)– The Enigma The man who invented the computer. Turing Machine Image from http://ei.cs.vt.edu/~history/Turing.html CCLi
Turing Machine: 0 0 0 1 0 1 1) if ... move right.. and go to (4) 2) if ... move left.. 3) if ... write 1.... 4) if .. ...... ...... ...... 1002) .... 1. A Tape (infinite) 1 2. A fixed finite set of symbols (0,1) 3. Four actions: (to do) (1) read and (2) write symbols from/onto the tape, move the w/r head (3) back and (4) forth. 4. A finite transition table (what to do) And, that is enough to beat any Super-Computer!! CCLi
Thephilosopher of the 20th century Ludwig Wittgenstein (1889-1951) “In logic nothing is accidental” “Turing Machines are human that compute” Image from http://www.ags.uci.edu/~bcarver/wgallery.html CCLi
From 8008 to Pentium 4 8008 (Intel 1972) 2500 Transistors Pentium 4 (Intel 2000) 42,000,000 Transistors 8080 (Intel 1975) 4500 Transistors CCLi
Image from http://www.hothardware.com Moore's Law A computer is a vast collection of logical gates. So, nothing is accidental in a computer. CCLi
1: true 0: false AND operator OR operator NOT operator Logical Gates NOT A A AND OR TTL gates 1: 3.5 volts 0: 0.2 volt B B CCLi
Vcc 14 13 12 11 10 9 8 TTL 7400 Gate AND AND NOT NOT AND AND NOT NOT 1 2 3 4 5 6 7 GND CCLi
Counting 0 1 2 3 4 0 5 6 1 7 8 10 10 9 11 11 100 12 20 101 13 21 110 . . . . 19 90 100 22 1000 111 91 23 1001 92 . . . . 29 1010 10000 . . . 93 1011 . . . . 99 1100 1101 1110 1111 CCLi
Adder (half adder) A S Half Adder B c CCLi
Logical Gates for an Adder (half adder) Half-Adder 1 A 1 1 1 1 • 1 • 1 • 1 OR B 1 0 0 1 AND S 0 0 AND NOT c 1 Ghz: 11095=200106 CCLi
Logical Gates and Clock 400 MHz 4108/sec A 1 1 1 1 1 1 OR 1 0 B 0 1 AND S 0 0 AND NOT c Half-Adder CCLi
Binary Addition carry 1 0 1 1 1 1 1 1 0 0 0 1 1 1 0 0 +) 1 1 0 0 0 0 1 0 1 1 1 0 0 0 1 0 CCLi
Full Adder Co Ci Full Adder A S B CCLi
Logical Gates for a Full-Adder • A full-adder can be constructed from half-adders. A Full Adder Ci 1 0 1 half- adder c 0 1 1 1 0 1 1 0 1 1 Co A 0 OR S half- adder c 0 B 1 S S CCLi
A 1 0 1 1 4 bits Adder B 0 0 1 0 0 0 0 1 Full Adder Full Adder Full Adder Full Adder 0 0 1 0 1 1 0 1 CCLi
Full-Adder and Clock Ci half- adder c A s OR Co half- adder c B s S 1 3 3 1 1 For a 16 bits adder: 167+2=114 4108 114 3.5 106 CCLi
Leopold Kronecker(1823-1891) “God created the integers, all else is the work of man. “ Image from http://www-groups.dcs.st-and.ac.uk/ ~history/Mathematicians/Kronecker.html CCLi
A 1 0 1 1 Adder, that’s enough! B 0 0 1 0 0 0 1 0 Full Adder Full Adder Full Adder Full Adder 0 0 1 0 1 1 0 1 XXXXX Created full-adders, all else is the work of programmers CCLi
Most Significant digit Least Significant digit Decimal Number: 3784 CCLi
Binary number : 110010012 Least Significant bit Most Significant bit 110010012 = 127+ 126 + 123 + 120 = 201 CCLi
Trinary number : 110010013 110010013 = 137+ 136 + 133 + 130 = 2944 CCLi
Hexadecimal number :FA9H FA9H = 15162 + 10161 + 9160 = 4009 CCLi
Conversion between Hexadecimal, Octal, and Binary Numbers CCLi
Binary Octal = 128 + 027 + 126 + 025 + 024 + 123 + 022 + 121 + 120 = (122 + 021 + 120) 26 + (022 + 021 + 120) 23 + (022 + 121 + 120 ) 1 = (122 + 021 + 120) (23)2+ (022 + 021 + 120) (23)1 + (022 + 121 + 120 ) (23)0 = 5 82 + 1 81 + 3 80 = 5138 CCLi
Binary Octal(shortcut) Least Significant bit 1111101010012=7651o Least Significant bit 101100101010012=26251o CCLi
Binary Hexadecimal = 0211 + 0210 + 029 + 128 + 027 + 126 + 025 + 024 + 123 + 022 + 121 + 120 = (023 + 022 + 021 + 120 ) (24)2+ (023 + 122 + 021 + 020) 24 + (123 + 022 + 121 + 120 ) 1 = 1 (16)2+ 4 16+ 11 160 = 14BH CCLi
Binary Hexadecimal(shortcut) Least Significant bit 1111101010012 =FA9H Least Significant bit 101100101010012 =2CA9H CCLi