History of Computer Development_01

1. Early related technologies:

  Morse code. Samuel Morse. USA. Samuel Finley Breese Morse 1791.4.27 - 1872.4.2

  Braille. Louis Braille. France

2. The movement of electrons formed the early application of microelectronics.

3. Relay.relay

4. Binary and hexadecimal are the basis of modern logic circuits. 4 binary digits = 1 hex digit

5. The basic theory of logic circuits: the logic gate invented by Boolean

  George. Boole. England. George Boole. "Research on the Law of Thinking". Collection. Union, etc...

6. Logic gates: logical AND, logical OR, logical NOT

  (basic door)

  AND gate (AND), truth table: all equal to true, otherwise false

  OR gate (OR), truth table: all false is false, otherwise true

  NOT gate (NOT), truth table: the opposite of the corresponding value

  NAND gate (NAND), truth table: false when all are true, otherwise true (all true, except when all are true and false)

  NOR gate (NOR), truth table: true when both are false, otherwise false (all false, except when all are false and equal)

7. The circuit forms the switch of the circuit through these gates and then forms the addition and subtraction operations of the logic circuit (addition and subtraction are the most basic logic algorithms)

8. Circuit addition and subtraction. Subtraction is slightly different and requires complement calculation.

9. Since binary is used for traditional decimal addition and subtraction operations, and the representation of positive and negative values, it is slightly different when editing the circuit, and the original code, inverse code, and complement code appear.

  in principle:

  When a positive integer: the original code, the inverse code and the complement code are the same

  When the number is negative or positive: the original code and the inverse code are converted to each other: the sign bit remains unchanged, and the value bit is inverted bit by bit

          The original code and the complement code are converted to each other: the sign bit remains unchanged, the value bit is inverted bit by bit, and 1 is added at the end

          Known's complement, find the complement of the negative number of the original code: invert the sign bit and the value bit, add 1 to the last bit

  for example:

  122 (decimal) = 0 1111010 (binary)

  Original code = Inverse code = Complement code = 0 1111010,---Add 0 in front of it == 0 1111010 (0 can be added first, indicating a positive number)

  -122 (decimal) = 1 1111010 (binary)

  Original code=1 1111010

  Inverse code=1 0000101

  Complement code = 1 0000110 (plus 1, every two into one)

10. Latches, flip-flops, oscillators

11. Byte and hexadecimal 8 bits = 1 byte

12. memory and storage are not the same, RAM array, random access memory

13. From abacus to chip

14. Harvard Structure and Von Neumann Structure, Harvard Structure, Howard Aiken, Turing Machine

15. UNIVAC, ENIAC, all are decimal, vacuum tube, transistor, semiconductor, silicon crystal PN

16. Gordon. Moore. Fairchild. SSI, MSI, LSI. VLSI. SLSI, small scale integrated circuits, large scale integrated circuits...

17. 8080, Intel microprocessor 8-bit, 8085, 8086, 80286, 80386, 80586..

18. ASCII encoding

19. IBM Hole Punch

20. BUS

21. Operating system: UNIX, DOS...

22. Precision of floating point numbers

  

 

  

 

Guess you like

Origin http://43.154.161.224:23101/article/api/json?id=325067136&siteId=291194637