1910
Comment:
|
2317
|
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) * DataPath |
|
Line 21: | Line 25: |
* FiveClassicPartsOfaComputer | |
Line 22: | Line 27: |
* FloatingPointRepresentation (IEEE 754) | |
Line 23: | Line 29: |
* FrameBuffer | |
Line 27: | Line 34: |
* HammingCode * HardwareDesignPrinciples |
|
Line 33: | Line 42: |
* InstructionSetArchitecture (ISA) | |
Line 37: | Line 47: |
* LinkerSteps | |
Line 42: | Line 53: |
* ObjectFile | |
Line 45: | Line 57: |
* PipeLine | |
Line 48: | Line 61: |
* ["Processor"] or CPU | |
Line 50: | Line 64: |
* ["Register"] (MIPS register) | |
Line 62: | Line 77: |
* SuperScalar |
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"]
FloatingPointRepresentation (IEEE 754)
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