1893
Comment:
|
2409
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AddressingModes * AmdahlsLaw |
|
Line 8: | Line 10: |
* BoothsAlgorithm * ["Cache"] |
|
Line 11: | Line 15: |
* CyclesPerInstruction (CPI) * DataPath |
|
Line 12: | Line 18: |
* DelayBandwidthProduct * DelayedBranch |
|
Line 14: | Line 22: |
* DelayBandwidthProduct | |
Line 20: | Line 27: |
* FiveClassicPartsOfaComputer | |
Line 21: | Line 29: |
* FloatingPointRepresentation (IEEE 754) | |
Line 22: | Line 31: |
* FrameBuffer | |
Line 26: | Line 36: |
* HammingCode * HardwareDesignPrinciples |
|
Line 32: | Line 44: |
* InstructionSetArchitecture (ISA) | |
Line 33: | Line 46: |
* LogicalMemory | |
Line 36: | Line 50: |
* LinkerSteps | |
Line 41: | Line 56: |
* ObjectFile | |
Line 43: | Line 59: |
* PageTable | |
Line 44: | Line 61: |
* PipeLine | |
Line 47: | Line 65: |
* ["Processor"] or CPU | |
Line 49: | Line 68: |
* ["Register"] (MIPS register) | |
Line 61: | Line 81: |
* SuperScalar | |
Line 70: | Line 91: |
* VirtualMemory |
AutonomousSystem (AS)
- ["Bijection"]
- ["Cache"]
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