加載中. ..
PDF
100 ( )
(
)
96301
96401
(
)
96601
96701
(
)
________________
(
)
!"#$%&'
()*+, -#./01
234567 89:;03<=>46>>?:
30
: @ :
2
0 A /
60
0BC<D
>?:
2
: @ :
20
0 A /
40
0B1
>?:EF
2B
GHIJ '>KLMN O#PQRST #./01
D>?:EFUVWXHYZ[HIJ
]'^_`4abcd
efTghi.Q0
1
j)klmno;p[/qr s#ktKuv w#xyz{|}~|1
!"#$%&'()*+,-.
!"#$%&'()*+,-. !"#$%&'()*+,-.
!"#$%&'()*+,-./
//
/01234
0123401234
01234/
//
/567-.8
567-.8567-.8
567-.8/
//
/9 : ;
9:;9:;
9:;
10
<
<<
<=
==
=
%&'>?@ABCDE9FGHIJK
%&'>?@ABCDE9FGHIJK%&'>?@ABCDE9FGHIJK
%&'>?@ABCDE9FGHIJKL
LL
L
M N O
M N OM N O
M N O
(
P
PP
P
)
Q R S
Q R SQ R S
Q R S /
//
/TRS89:UV<%&
TRS89:UV<%&TRS89:UV<%&
TRS89:UV<%&L
LL
L
30
2
3
1.
IPv4
IP
10.20.40.60 110.120.140.160 210.220.240.260 255.255.255.0
4
2. IPv4
32
bits
IPv6
!
48 64 96 128
4
3.
"#
$
%
&
'(
)*
+
open system interconnection, OSI
, -
./
0
./
1
2
3 4
56
1
387
59
:
;<
5
presentation
8=
>?
@A
5
data link
BC
5
application
8=
>?
@A
5
data link
;<
5
presentation
8=
DE
5
physical
BC
5
application
8=
DE
5
physical
1
4.
F
&
'
GH
I
C
J
KL
”
MN
OP
”
E-mail
FTP IMAP SMTP POP3
3
5.
Q
R
ST
UV
.W
X
Y
Z[
coverage
S
]^
_
`
WAN > LAN > MAN MAN > LAN > WAN WAN > MAN > LAN MAN > WAN > LAN
4
6.
a
bc
d
;
number presentation
e
_f
^
g
`
A = 199
(10)
B = 11000110
(2)
C = 311
(8)
D = C8
(16)
A < B < C < D B < A < C < D A < B < D < C B < A < D < C
3
7.
hi
jk
c
175.375
(10)
l m
jk
/
x.y
(2)
n
;
o
p
10101110.011
(2)
10101110.110
(2)
10101111.011
(2)
10101111.110
(2)
2
8.
hi
jk
q
c
-119
(10)
l
8
r
bits
Sm
jk
2
Ss
c
2’s complement
n
;
o
p
10001000
(2)
10001001
(2)
10001010
(2)
11110111
(2)
1
9.
J
Mt
qu
v
w
”
xy
z{
|}
x
”
S~
ALU DMA DOS BIOS
3
10.
”
”
calls
F(n) = F(n – 1) + F(n – 2)
¡¢
£¤
¥
¦§
iteration
¨©
jumping
ª«
recursion
¬
looping
4
11.
®
¯°
±²
³
´
µ
¶
· ¸
¹º
»¼
²
constructs
£½
¥
¾¿
input
=
ÀÁ
decode
8=
¾Â
output
¾¿
input
=
ÃÄ
verify
=
v
w
execute
Å
C
fetch
=
ÀÁ
decode
8=
v
w
execute
¬`
sequence
8=
Æ
Ç
decision
=
¦§
repetition
2
12.
È
É
1207
ÊË
ÌÍ
Î
Ï
sorted
¶ Ð
Ñ
ÒÓ
binary searching
Ô
Õ
Ó
ÊÖ
×
ÌÍ
Ø
ÙÚ
Û
Ü
”
ÝÞ
ÌÍ
”
ßà
áâ
ãä
±å
¥
10 11 12 13
3
13.
æ
ç
stack
8è
é
queue
±²
êë
ì
í
ÌÍ
îï
ð
ñ
ò
£¤
¥
ó
FIFO
£
”
ôõ
ôö
”
÷
LIFO
£
”
ø
õ
ôö
”
ù
ú
FIFO
=
û
FIFO
ù
ú
FIFO
=
û
LIFO
ù
ú
LIFO
=
û
FIFO
ù
ú
LIFO
=
û
LIFO
1
14.
ê
¤
í
£
´
A × (B + C) – E × F
ü
Þ
ý
”
øþ
”
postfix
ÿ
´
¥
A B C + × E F × – A B × C + E F × – A B C + × E – F × A B × C + E – F ×
4
15.
ê
¤
â
´
Ø
î
´
¢
Ø
õ
ÌÍ
(swap
¥
ù
ú
stack
E
û
queue
E
Å
cache
E
virtual
1
16.
ê
ÌÍ
î
¤
í¢
ÌÍ
îï
data access
Û
!
¥
"
#$
register
%
&
'
hard disk
(
E
main memory
Å
E
cache memory
3
17.
)
®
!*
flash
+
,
×
£
8 GB
Giga Bytes
ÙÚ
-
+
,
£
Ü
.
/
Ñ
¼
Bytes
¥
2
13
2
23
2
33
2
43
2
18.
/0
12
£
6000
(16)
~8FFF
(16)
3
/0
â
î
16
/
Ñ
ÙÚ
Ô
+
,
£
Ü
.
KB
Kilo Bytes
¥
12 KB 24KB 48 KB 96 KB
1
19.
ê
ò
´
4
5
ROM
¤
í
â
6
78
9
:
;
´
<
”
=
>
”
Î
î
ÌÍ
¥
EEPROM EPROM PROM ROM
4
20.
®
x
è
y
£
Ð
Ñ
?
x’, y’
£
-
@
A
´
B
ÿ
XOR
C
D
A = (x
B
y)
B
y’
E
A
£
ê
¤
í
¥
1 0 x x’
3
21.
Ð
õ
/
10100011
(2)
F
/
G
arithmetic shift
HI
G
/
Ñ
bit
ø
ÙÚ
ü
ã
±å
£¤
¥
01000110
(2)
01010001
(2)
11010001
(2)
11000110
(2)
1
22.
®
A = 100011
(2)
è
B = 011011
(2)
J
£
2’s
@
A
´
K
6
/
Ñ
ÙÚ
A + B =
¥
-2
(10)
-1
(10)
1
(10)
2
(10)
2
23.
®
K
10
/
Ñ
Ð
õ
/
L
2’s
@
A
´
E
Ô
M
â
ÿ
12
£¤
¥
-512
(10)
~ 512
(10)
-512
(10)
~ 511
(10)
-511
(10)
~ 512
(10)
-511
(10)
~ 511
(10)
3
24.
ê
NO
b
ü
´
P
Q
Ð
í
J
R
”
ST
U
H
´
”
object-oriented
¢
´
P
Q
£¤
¥
C/C++ C/LISP Java/C++ Java/LISP
4
25.
V
Ñ
2000
W
”
XY
Z
”
[
]
100
W
”
^
W
Z
”
ì
í
ü
_
[
ê
¤
¹
É
`
¥
ab
c
d
>?
;
ab
c
d
IP
e
f
>?
;
gh
i
j
e
f
3
26.
k
ÌÍ
lm
n
¢
ÌÍ
o
data model
¶
ê
¤
í
p
q
£
r
6
¥
@A
linked
>?
./
s
network
>?
./
#
+
relational
>?
./
t
5
hierarchical
>?
./
2
27.
ê
¤
í
£
r
6
ÌÍ
lm
n
¢
ÌÍ
uv
P
Q
¥
ADA SQL LISP COBOL
1
28.
É
`
MPEG
wx
encoding
;
-
ÌÍ
8
y
compression
ð
ñ
£
ê
¤
í
¥
"
z
lossy
{
'
|
}
"
z
lossy
~
|
}
z
lossless
{
'
|
}
z
lossless
~
|
}
3
29.
®
¯
o
¼
ص
ý
o
¼
ñ
coupling
[
ñ
cohesion
£¤
¥
=
=
=
=
1
30.
ü
6
¢
”
”
waterfall
o
-
õ
£¤
¥
9
D
n
9
D
n
9
D
n
9
D
n
!
!!
!
" # $
" # $ " # $
" # $
$
$$
$
20
ADSL
HTTP
(
)
4
( 7A7
(16)
XOR B8B
(16)
) OR 123
(16)
!"#$%&
12
' #(
XOR
)
”
* +
”
(
OR
)
”
”
, - . / 0
16
123
)
6
45 6 78 9 : ; <
”
= >
”(cache)
? @ A B C D E
4
FG H I
(processes)
78 9 : J K
”
L .
”(deadlock)
M EFN C O P Q
”
* +
” (mutual exclusion)
N R !S 4N
6
#
# #
#
5 6 T U H V W
(multiprogramming)
XYBCZ[
5
0M ] Y
(demand segmentation)
^7_ < ? @ A ` H ab c
”
Rde
f
”(external fragmentation)
Eg h i j k
”
ef
”
El m
5
4
1.
5 6 0nY
(paging)
^7_ < ? @ A B C Z o
4
2.
7nY pn
(page)
Eq $%
”
` r
”
”
` s
”
t u v w x y z
{ 5 6 |
6