|
Size: 1910
Comment:
|
Size: 2202
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * AddressingModes | |
| Line 12: | Line 13: |
| * CyclesPerInstruction (CPI) | |
| Line 21: | Line 23: |
| * FiveClassicPartsOfaComputer | |
| Line 23: | Line 26: |
| * FrameBuffer | |
| Line 27: | Line 31: |
| * HammingCode * HardwareDesignPrinciples |
|
| Line 33: | Line 39: |
| * InstructionSetArchitecture (ISA) | |
| Line 37: | Line 44: |
| * LinkerSteps | |
| Line 42: | Line 50: |
| * ObjectFile | |
| Line 48: | Line 57: |
| * ["Processor"] or CPU | |
| Line 50: | Line 60: |
| * ["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