1836
Comment:
|
2393
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AddressingModes * AmdahlsLaw |
|
Line 4: | Line 6: |
* AverageNormalizedExecutionTime | |
Line 7: | Line 10: |
* BoothsAlgorithm | |
Line 10: | Line 14: |
* CyclesPerInstruction (CPI) * DataPath |
|
Line 14: | Line 20: |
* DelayedBranch | |
Line 19: | Line 26: |
* FiveClassicPartsOfaComputer | |
Line 20: | Line 28: |
* FloatingPointRepresentation (IEEE 754) | |
Line 21: | Line 30: |
* FrameBuffer | |
Line 22: | Line 32: |
* GeometricMean | |
Line 24: | Line 35: |
* HammingCode * HardwareDesignPrinciples |
|
Line 30: | Line 43: |
* InstructionSetArchitecture (ISA) | |
Line 31: | Line 45: |
* LogicalMemory | |
Line 34: | Line 49: |
* LinkerSteps | |
Line 39: | Line 55: |
* ObjectFile | |
Line 41: | Line 58: |
* PageTable | |
Line 42: | Line 60: |
* PipeLine | |
Line 45: | Line 64: |
* ["Processor"] or CPU | |
Line 47: | Line 67: |
* ["Register"] (MIPS register) | |
Line 59: | Line 80: |
* SuperScalar | |
Line 68: | Line 90: |
* VirtualMemory |
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