| Size: 497 Comment:  | Size: 2476 Comment:  | 
| Deletions are marked like this. | Additions are marked like this. | 
| Line 1: | Line 1: | 
| * AddressingModes * AmdahlsLaw * AreaBorderRouter | |
| Line 2: | Line 5: | 
| * AutonomousSystem (AS) * AverageNormalizedExecutionTime * ["Bijection"] * BooleanAlgebra * BooleanTerm * BoothsAlgorithm * CaChe * CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions) | |
| Line 3: | Line 14: | 
| * CpuTime * CriticalSection * CyclesPerInstruction (CPI) * DataPath * ["Decidable"] and SemiDecidable * DelayBandwidthProduct * DelayedBranch * ["Dichotomy"] * DijkstrasAlgorithm * DisjunctiveSyllogism * DistanceVector * ExecutionTime | |
| Line 5: | Line 28: | 
| * InternetGatewayRoutingProtocol IGRP | * FiveClassicPartsOfaComputer * FixedPoint * FloatingPointRepresentation (IEEE 754) * ForwardingVsRouting * FrameBuffer * FreeBooleanAlgebra * GeometricMean * GroundClause * GroundBooleanTerm * HammingCode * HardwareDesignPrinciples * HypotheticalSylogism * InteriorGatewayRoutingProtocol (IGRP) | 
| Line 7: | Line 42: | 
| * InternetProtocolV4 | * InternetProtocolV4 (IPv4) * InternetProtocolV6 (IPv6) | 
| Line 9: | Line 45: | 
| * InstructionSetArchitecture (ISA) * LogicalImplication (|= symbol and also |-) * LogicalMemory | |
| Line 10: | Line 49: | 
| * LinearlyDecomposable | * ["Latency"] * LinearlyDecomposableDomains * LinkerSteps * LinkState * MaximumTransmissionUnit (MTU) * MemoryStallClockCycles | 
| Line 12: | Line 56: | 
| * OpenShortPathFirst OSPF | * ModusPonens * MonotoneBooleanTerm * ObjectFile * OpenShortestPathFirst OSPF * OsiModel (7 layer OSI network Model) * PageTable * ["Performance"] * PipeLine | 
| Line 14: | Line 65: | 
| * PowerSet * ["Proposition"] or PropositionalLogic * ["Processor"] or CPU * QueuingTheory * RaceCondition * RecursivelyEnumerableSets * ["Register"] (MIPS register) * RelationallyComplete * ResponseTime * RoutingArea * RoutingInformationProtocol (RIP) | |
| Line 16: | Line 78: | 
| * SemanticsSyntaxSortsInLogic * SemiDecidable and ["Decidable"] * SequenceNumber * SlidingWindowProtocol * SpatialExtent * SpeedUp * SuperScalar * ["Tautology"] * TcpFastRetransmit * TcpFastRecovery * ThroughPut * TransmissionControlProtocol (TCP) * ["taxonomy"] | |
| Line 17: | Line 92: | 
| * ["Undecidable"] | |
| Line 18: | Line 94: | 
| * VirtualMemory * WallClockTime | 
- 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
