|
Size: 1928
Comment:
|
Size: 2224
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * AddressingModes | |
| Line 9: | Line 10: |
| * BoothsAlgorithm | |
| Line 12: | Line 14: |
| * CyclesPerInstruction (CPI) | |
| Line 21: | Line 24: |
| * FiveClassicPartsOfaComputer | |
| Line 23: | Line 27: |
| * FrameBuffer | |
| Line 28: | Line 33: |
| * HardwareDesignPrinciples | |
| Line 34: | Line 40: |
| * InstructionSetArchitecture (ISA) | |
| Line 38: | Line 45: |
| * LinkerSteps | |
| Line 43: | Line 51: |
| * ObjectFile | |
| Line 49: | Line 58: |
| * ["Processor"] or CPU | |
| Line 51: | Line 61: |
| * ["Register"] (MIPS register) |
AutonomousSystem (AS)
- ["Bijection"]
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
CyclesPerInstruction (CPI)
["Decidable"] and SemiDecidable
- ["Dichotomy"]
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
LogicalImplication (|= symbol and also
- ["Latency"]
MaximumTransmissionUnit (MTU)
- ["Model"] of a logic formula
OsiModel (7 layer OSI network Model)
- ["Performance"]
["Proposition"] or PropositionalLogic
- ["Processor"] or CPU
- ["Register"] (MIPS register)
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula