access Lȡͨ·M
adjacency list method ӱʾ
adjacency matrix method Ӿꇱʾ
algorithm 㷨
array M
ATM(asynchronous transfer mode) ݔģʽ
b.. real programs kernels ij
b.. toy benchmark synthetic benchmark λʳ ͺϻʳ
bandwidth
benchmark yԇ
best - fit algorithm m㷨
BFS(breadth first search) Vȃ
binary M
binary relation ԪPϵ
binary tree *
bit series
black - box white - box ں
block miss KʧЧ
blocked ȴBҲQiB
boundary 羀 ֽ
bridge W
bubble sort ð
candidate key xIoI
capacity
cartesian product ѿe
CASE(com.. aided sof.. engineering) ӋCoܛ
CCP(communication control processor) ͨſ̎C
cell Ԫ
characteristic
circuittching ·Q
circular wait ѭhȴ
CISC(complex instruction set computer) sָӋC
class
clock cycle/clock rate r/rl
coaxial cable ͬS|
cohesion/coupling Ⱦ/
coincidental logical procedural functional żȻȾ ߉Ⱦ ^
ԴIyܛyԇW http://www.kjueaiud.com/