Ch.

1 Data storage

{F%¥¥ÉF¥FCF&kEnNIE¥BFn ) AND : Rita 24n-b-i-kxl.FM#-3Ex0

OR :
Ftl ¥-513.1

✗ OR : 24☒¥☒ # 13,1

NOT : FC input # Efx

flip-Flop Efx :B 17-8=7 -43-0 # Rt

:

24M£ input , 1417-4-3-0,1417=4-3-1 , 4-☐ ¥-5k # input # it preserve 0¥41 It -1-28=7 state )

¥
✗
y z

EFI .
-

0 0 unchange

I 1 / undefined
ex :
o

o 0→¥xÉa¥¥Éi :
↳

unchanged
0

-21

I
0--1
↳ ¥ Into
Flip-flop -4 # E- → ¥EÉHÉ_-i / ( FFF # )
Main Memory Cells Cells : I byte =
8 bits

51 }É¥*n -43-7=12 ( random accessible )

Memory Techniques CÉÉZ 't¥¥i¥ )

RAM ◦ 5 RAM :
93.44-b flip-flop → it't -2¥ ,
# ¥¥

◦ DRAM :
-7¥ -1¥ refresh circuit

◦
SDRAM :
%ÉEEA¥☐ F- A- Ex A-

◦
DDR -9 ☒ A- ¥ A-E9HnF3- EKED '-k¥A¥¥
:

◦ Dual / Triple : 2 or 311 # ¥Zk¥¥Y¥

¥5 FE kilobyte : 21° bytes ≈ 103 bytes

megabyte : 22° bytes ≈ 106 bytes

gigabyte : 23° bytes ≈ 109 bytes

Mass storage

44k¥ life # IKE ÉÉZ 't¥ i¥ ) E☐E¥-h #¥775 -5*3%1 volatility ) -4¥ 'tE
, , ,

*FEEL? BÉq#n ( ex : tape ] , optical system ( ex :( D. DVD ) . Flash drives ( ex :

us b)

MEtrack # i¥ # ☒ sectors
Magnetic Disk Storage system win
Access Time =
rotation delay /
seek time -1
latency time
¥¥¥,¥¥iE

cylinder
[
¥9s "¥¥.EE/T3-F-tx=.ki-E'k&I.K-'EEE-- 2*-7 -¥ ,

SATA :B_¥B¥Yñ¥ñ¥¥) transfer rate [ SATA 1.3.6 . . .

)
ÉZ '¥¥c¥=¥É±h=t 'T ti> 1.7=1×-4.4 . t.tl?n-t--kA-F-Fn=FE.ZE-teE-iE--.FxE.71'IFE
sample rate ✗ ¥É4Fxbit resolution TETI :
bps

2. MIDI ÉZ¥¥É¥n=,¥a"¥EH÷k¥E # A "☒¥¥kE

Binary system 'Et%¥

.FI :{ ¥¥4i FEEL
'
= → 2 'S complement ex :
-2,4 bits -71110

binary #7¥12 's :tb4¥k≠A= -7*7-1124%77.7=145-1-10,0-11

,

2 's # 7¥ binary :E%7¥A=Fx4¥ -11

Excess F¥¥=H -12^-1 ( n :☒nbit¥×E )

ex : -44^3-2 ,
excess notation , } bits .

=
2+23-1--6=110-1 ,

* ☒ M-1 .IE#-7rE-stt-htiA7 # ¥87171 '¥¥ihÉ5Ét

( 2 's¥¥ExEt )
1+24-1--9=1001
-4¥ }
i

110
IE
"
excess + ex :
21-1-17 > bits # it
-10¥
.

↓
/ A- 9- excess notation =L -123-1--5=101
,

's
bit pattern binary 2 excess
000 0 0
-4
001 1 I -3
010 2 2
-2

011 3 3 -1
100 4 -4 0
1
101 5 -3
6 -2 2
1 10

1 11 M -

l 3
 0 I 0
overflow ex : ☒ 2 's complement 3 bits # F- A- ¥ 2+3 F¥i=ʰ¥Ñ # 5

+0*1=-3
,

1- 2) + f- 3) →
5 →
→ mod g =
,

FL 2 's % ¥ , -4M¥ Eta # D- ME TIFA# A- XD KAE overflow

111=14 ¥ Ftl fraction )

fixed -

point ex :
101 .
101 = 41-1 +
{ & 5 625
+ = .

É¥¥E9 ¥4 "ÉzBFk¥ In 4- D1ñ¥iñÉz¢=

'°
2-
Floating point ex I ✗ ?
:
_

'°
+ 2- ✗ I
01 _i¥ -1,19T¥ -

ex : I 10 1 01 01 Eh ¥11T ?
•

Sol :
(l ) ( 101 ) ( 0101 )
8¥ (t 1) ( .
0 I 0 1) =
¥ %
+ = 0.3125

( O ≤ m < 1)
"
= 2 × 0 3 1 25 = 0 6250
-
-

.
.

↳
EirF¥☒ excess

IEEE 754T¥ ¥4,7 , I sign i

11
exponent . 52 mantissa ( ¥ 64 bits ]

Truncation Error Mantissa MED ex :

2% →
.
10 1 01 ✗ 22 ☒ ± >☒t A- 7¥ III 01 1 10 ) ( 1010 ) →
2£
Normalized Form Finn -

mantissa 5=7 bit pattern

ex : 0110001 I → ( O ) ( 110 ) log 11 ) mantissa EFFETE -

¥-13 ,
I 10 } 3. f)

22
°
00 11 ✗ → → 0 100 1 1 00
•
.
1 1 00 ✗ 2

IEEE normalized form FE mantissa E-HE.BE ÉnJ¥ 9EˢA¥É¥- A- F- Ex ,

1 .
✗ ✗✗ ✗ . .
.
ex : I 10 10 10 I → ( l ) ( 101 ) ( 0101 )

I ≤ m < 2
→ ( l ) ( 101 ) ( 1 .
010
1)

431st :O A- 7 A- ¥ 91¥ E O → * it ☒ -4 ☒ 4¥ 'F¥É 21¥ 0 i 4- ¥4s 4- I

'
116T¥ a¥xÉ¥4IᵗH 3-13-41
,

s Cee e- 4)
¥xÑ=É :
CS ] ( eee ) ( mm m ) = C- 1) ✗ 1 .
mmm ✗ 2
m www

binary he 7- É¥¥
◦

5=0 → C- 1) =/ → I .

'
5- I → c- 1) = -

I → FE
23 0 .
I

4 +
¥ +
¥ →
4=1-2×23 =
-01 1001

4- ☐
7¥ 14-11-47 +
¥ →
¥.iq#-=taE7tg-x'-zg'-y=j-z ✗
23=-0111-00-00 I 4-3-7 KEEK THEME XD 'E =
4

4- D Ft 4 1- ( ¥+¥ ) → 01111000 1--010-01001 = 0 111 1000 -10111000 I = 0111 100 I = 4

{
,

{ =
-116 ✗ 23 = 000 I
É¥¥9ñ¥ # ¥-40 Dⁿ¥4ñ¥¥¥¥
.EE#&=FEYti-tFa-E%FA-
Fat , 4-

data compression ÑtkF¥¥&FEA7F¥☒:¥I¥=t -1A redundancy

F- * ¥x Lossless run -

length .
frequency-dependent → Huffman .
dictionary
* ¥x Lossy relative / difference encoding , media-zht-%F4-KA-lossyexigif.jpeg.mp3.in peg
Huffman code tt # ¥47 # A- F4¥☒ᵗt¥ÉMbits¥ÉZÉ¥c .
'
4- ☒ A- FFxÑ☒¥¥ÉbitsÉZÉ¥c

ex : AAABBBAABCAAAABD ,
4- ☐ ¥-9K # A 00
%Fn*B¥x → %P☒I # 32 bits
B 01

C 10

D 11

501 :
step ≥ . I. EA-yi-k-tQA-9.B-5.FI , D= I

step .2 ¥8m huffman tree → -1--4%-5147=721 ☒ ¥2512 -

EE

C- I
-
D= I B :5 C- I _
D= I A. 9 B :5 C :L D= I

\ / → I / → At
2 2 2

0
I
n n

I
o

16

step .
} A 0 IIAx=kEk ✗ 9¥ # bits -t9= 9×1+5×2 -11×3+1×3
B 10
C
= 9¥ ☒ 325 bits
110
D 111
¥=3n bits .IE/2-A-F-EEt4#+- tree ,

F- .FI#Ea=E4F-t---a==F-xi4-=tF5zTi
=

LZW encoding ex : ✗ yxoxyxoxyxoxyx

Sol : initial dictionary ✗ I → ✗ y ✗ ☐

-z¥h¥4ÉEIDÉE¥☒t
2
17-4-49 Eta ktn¥ ) Y 1 2 13
0 3 ( Eia )
Ex -

9☒-
xyx 4
i. ✗ yX=4
→ 121343434 #

MATTE dictionary ( I ✗ yx=4i%É=¥4kÉF¥T¥Eyx

s☒¥B¥↳ : ✗ 9×024%-87%44 'T BE.AE#--Xyx--4iAt-*F--A-7a190t3-&FxXD-zEI #iA7M¥¥
>

ATE -7¥

FE7rEf # 9- redundancy Ét¥ .to#EiE--n=7-zkEfEH- communication error

communication error error detection : check code ex :-# '

I
"
¥315.15BN parity code → ☒ FLRAID

[
.

error correction :
hamming distance
Ch.2 Data Manipulation

CPUAA-FE.to/T3-EEFaCPuEn1#E.9-b91
> D=.tn of machine instructions _tE main memory A- 71T¥ .si#m-zAbbusF-7-YCPu.F3-Ed---HQFrx1Nb--

KEEFFE ,FE21☒#¥4I°É☐A.TT#--TtA-XD/T3-E1F-*-B-/T3-F-b.-zEs-z"Ébus[k ☒
.
main
memory
◦ ( Puk # A- 9- register -h¥ } En SRAM → '
TAEK . ?¥
,

cpuA7¥3¥☒z¥ register PC program counter :( PU-t.EE#H45E7EE-IFFeFL4E-Lkl-*E-l' ¥+24571b# 3k¥ )

/
-

IR instruction register :FEEEFE¥¥t9J¥7¥ZÑ¥E

156C

1- -21=9124 ME bytes )
'

CPU -4*45=1*5 ① Fetch Tt¥F¥*PC9ItK%¥ main memory fetch 7- IRP ↓ machine cycle

② Decode 3 'A¥F¥Et¥Fb£4t¥E
③ Execution ¥+4245 Counter -1-1

Clock -

¥1451 -4--445%4,4 ☒ machine cycle

RISCV.SCT.SC RISC CISC

F¥E¥F¥☒É THE 'RE

PRCISPARC ✗ 86 .
✗ 86-64

" MD " " link

¥E¥É¥É( CIC " " -

) > Object file > ¥-4454 "Fs

( obj +
library ,
↑
XDAlibrdryltq-i.EE )
 Machine instruction → CPU Fh¥EFbkE7É
✗ AND 0 = 0
ALU AND 4- Dn¥¥EitEE¥RH7bitÉEÉ0¥ti AND 0 ,
I ¥É¥n= 0 i
✗ AND I = ×

OR X OR O = × , ✗ OR 1=1 ( AND Fx 'zFn #-)

✗ OR ✗ ✗ OR 0 =X ,
✗ ✗ OR I = NOT ✗ →
FEF¥Éñ=f bit invert
I
001 ↑ 'T }
shift
-

logic shift :
Tetro # 84¥ ¥ # 0 *É=g+¥ } # 5) that ex 01132×2 # ¥ ;¥}¥É¥"ÉItE

f-
:
,

I 10 6

arithmetic lF¥EH shift :t¥F¥EE , } .AE#tE-diE-0Eti%A1-' 0,52¥ # I

ex :
10100000 Fs # § → 11000000 -96
↑ ✗ 2
tD¥% → 11010000 -48

rotation shift ex : 10100000 E¥¥ → 01000001

to # ¥ → 01010000

☒ É¥1¥≠¥*I☒

DMA ( Direct Memory Access ) FExF¥¥ -

= KLEE device t.lk#=3-tkFt----tE-T-Ex.7rA--zk-KbCPU

" "

Cpu pipelining IEEE , ± throughput increase

5) HE FA FEE : conditional jump → HEY ¥+745 }ᵗ¥_¥2¥y7r # D.EE#y-7rEfjump ,

pre fetch
-

_a5¥☒ñ¥E÷¥¥ ,
lex :
if -

else )

→ 5) t.tn?-TE=.EyCCompi1eri=-Fx4E4t )

parallel computing -4453T¥ ";¥

'"
KID -

b # A- ☒ f- share
memory

I multiprocessor ¥3 CPU _=k¥×¥=E☒☒=H*,¥*¥b%¥¥

-

[
,

M : multi Ii instruction
MIND SIS D. SIMD S : single
MISD →
pipeline
,
D: data
#
¥-7,2 ;¥qÉt¥EÉFL¥b # A- -2T¥ -251%1*252*-45
'"
distributed computing ☒± ,
ex : Seti ( nasa )

EE ÉTE "pÉ%¥¥
"

A- EFFETE data dependency : F- 4☒E¥- depends on 1=-4 ☒

load balancing :
75K¥ A-¥¥*tÉ # F- 29¥ # £7
, ☒Z

synchronization

reliability : ¥-912T ## EFFIE ,

BYE 't # t.EE#*----n=7ITs9EtrE
¥74 # F- datadepedency.9B-lt.tn
15k¥ -

En # I # ¥7 -44554T¥

} Extra dependency

a.%Ea%aEasai-aiafai i .PH
¥7 CPU 1

Amdahl 's law ¥22T "aE¥FxtbÉKñ=7¥EFE Gain =

YIM -111 -

p )

p :# ZETA -44¥ -4454 t-aftt13.it ( Ori ) M :

CPU _n=FIk±¥

4¥¥Ép=0i8 MEINEKE } # the 'z¥E7

, ,

FE }EEk51'É

KEEFFE 15k¥ YP-mtll-pl-cp-TAA-FYHJFxknr4-3-IFEE.IE "En¥¥ÉF%Ea¥ )

 \
Ch.3 Operating System I
45-5 >☒ GUI

05 A- ¥7 ¥7k } # ¥9K # BE 'i¥

05*7 :^* -21¥ ① batch :Fᵗ¥%¥§hA7t¥É%ÉFtt=kFznE
② interactive :%y1☒ terminal -z¥F¥¥y-4☒zÉik¥p computer
③ -

realtime :FÉ¥EFx¥n=¥F¥CERA¥'¥%.EE/i:EEEt!---E.TEEt )
" " " " " " " " " "" ¥" " " # " ☒ + " " " "¥¥ " " ) # ☒ ¥ #¥ " " # " ¥"¥¥

(
" "
" " "

Ef¥Fn=¥F# ☒ Eta -9 task -4-2-4-1=45

-

multitasking
multiprocessor

kernel file manager . device drivers ,

memory managers [ Paging
virtual memory

scheduler . dispatcher

05¥ #¥-4747
,
-

bootstrapping bootloader # EH-kn.AE#EEidiskStoragetE0sFn-=Y/ main memory , 'z4¥A=tE

f- Eskil -4%1=212%505 105: '¥¥AFA-¥H¥☒¥ÉÉ☒ .EE#xbootloaderFDE*-Ettab73-t-ios )

BIOS bootloader # Eti user -4*0*1=7*2*7-7335

process ¥32T'FL -4*452%5*1474 # .FI#=tin=7H--iEE-*kTiEFLkFx-&-H454

=

ex :I1T="EpIEF¥HA7¥EÉl
-

process state timesharing # F- T¥FE¥t¥Ztiñ=7Hñ¥¥1É¥F}-

/ process table
me

OSAIFK
:
program counter

handle process
. general purpose registers , associated memory cells

EFZ :
memory D#39☒¥ } %, process , process priority .
ready / waiting

r%ñ☒n=¥=Eb¥B¥É=¥☒ .AE#- tExÉZH¥e

.it#7rEH--tEETEtr4=s7r-kEEKttbIn-y:-n--
virtual memory : main memory > ☒

-7¥ 1007k¥
2007*3=7 ¥xI¥=¥7kFt{
,
>¥¥Qb¥_ñ¥i=ᵗx¥T¥¥t4
's main memory / ¥100k ) ,
100 }

A- 5*451%17=4 >b¥ñ¥"¥F¥T¥¥FAIEk .tt#-t--k---n-=-A-7K-a-H-aD-a7HE100FE

?⃝
process administration
-

scheduler # ☐ dispatcher '8FE¥a9t¥E

-t E¥E # E- D # 131 ☒ process Ex ready
.rs#34lEn-zwaitInglEiELE%EA4--s
scheduler maintain process table ,

dispatcher context switch by calling interrupt → ( push # E-

timeslicetxk-EE-k.FR/5A-I-p-nI---Yn=7Econtex-
switch

time slice # # → response time -1A

¥it↑Ex
w
context switch
'

057-EA-EFEHIA.EE# ( E)

mutual exclusion FEE -4--4*-4-7958=7*2 -Ñ

critical region 1T£ ,¥¥-4☒F¥☒¥*n=¥ .to#-LiE7--Fan=-A--HM*E-t17A-F%7a7t }9☒t¥☒¥±lHn=¥F¥¥¥±÷F¥E7

Ata -91¥ )
semaphore 'lÉ5¥u B¥±É¥.EE/-A-kFLkEfHt-.-z-4---icritica1 region
ex : atomic Test and - -

set

11 Share memory

deadlock -51-1%5 ☒ 14 "

"¥M¥1F : ① Competition :
"¥¥É¥7rTñ_n =¥≠¥
② resource are requested on a partial basis → FEET }E¥a¥f¥É¥
T¥7t17ñ=F%¥=.EE?rEx-F-H-x-5&+tiEDEEEf4t#E.
③ resource allocated "1¥T¥i=É } # ¥144B

competition
←

'
KH-EEEEFE.tn#XFH-i--E5E--nl4
/ / ¥# ☒ ¥1 "¥n③¥ )

I
'h¥É¥42É%¥A¥
%T¥zÉ'¥iAF¥.IT# → partial basis
 A -4+7457-4427=5%-7*47%4 ,
CHEF → deadlock

cigars → * n¥_-¥_ # ¥ 4¥ %5E.ge process , C starvation

starvation -

FIFE process _pk%¥ A- 5T¥ -51¥

,
. reallocate ¥831k

aging starvation ¥7174 :# is :{ 2-

EAT ☒ process ¥5 -
t ☒ age ,
135¥ A- ¥ F-¥ # ¥ priority Entity
,

-7¥ ¥É"¥× FEE

, password

÷ : ÷÷÷÷:÷÷÷÷:÷÷:÷÷÷*÷÷÷÷÷:*
sniffing software : hack -2¥ # A- %☒%É¥¥¥ ¥22T

.
( ex .
3¥ -9¥ ¥2 '¥¥cD¥;)

. :* :*:*
:*::* .

f-worms

trojan horse
:
¥ # ¥tiñ¥*4= ¥45 HE ¥1
:
Tika "¥¥EI
.

'

priv -11 edge levels A¥¥ } #

Ch.4 Networking and the Internet

Network Topology Ring :Ét23¥uR¥É↑Éh°¥

Éf
-

f-
-
Bus

star
:

:
21=3,17%8 broadcast

center :& 'E¥Aᵗs¥T¥1ñ¥&Éb# 35

→ hub

# A "☒
☐

0*-0
p
6

Network Protocols Kx3ÉHBTE¥ÉTAÉ&¥¥zi☒FF¥tᵗx AFkF¥ ¥

token ring Attiring topology
t-FEHIF-x%FE.PT#E+Ei1-oken-n=7hFEE- FEÉÉE
.TT#ThEi&4kEtYEn-CSMA1CD-FEH7Fd-A-
token # ring

% # ethernet 1=1 bus topology ) collision detection

broadcasting
/ CSMAICA
"I collision
4- DEKE

kF¥H7Fd¥H% # ethernet
,
28%54%1=8 "IÉKñ=F7É¥*nA¥F¥ # Éti
f- ( ¥4 : -49k¥ :# it
, collision 'iTAA-ÉF¥¥z ) collision avoidance

KEEFE Channel AEB idle ,

¥ # 11¥13 .EE#nA-FP-n=A4E9Ei-.EY # ,
idle # HE¥4b9¥yÉÉ
A "aÉ1¥ÉtÉ-'E=FA Collision 1¥55 Ecc )

Access Point ¥¥%ᵗE%☒Eb device >rn-EFE-t-E.IE#EA-.En--tDAP=.En=-zH-

* ↑¥ ¥ : IEEE 802.11 b. 9in . . .

ex :A4Dn¥¥DB☒n=¥ñ¥=E44AP,AB¥ti-E¥*É☒

2*-7%-7,174%5 -n=7 device ÉEF¥*☒¥☐AE -7=7*71 compatible )ñ=F network -37M -bkÉt3¥ñ=F¥*¥F"itFtÉFE

L Repeater H%Ékʰ°¥b : -1*4=374%75%-4,7154*4417

( Bridget'¥☒F¥¥É : broadcast Ét }Fk # 13¥ -2¥ "↑nF¥2bÉ51¥≠1*¥¥¥y
,

( switch :¥.it#H-k%11IEs29F*1-tElE-F-y-n=9- bridge ¥☐1switch=¥

☐

☐ f- ☐

Router LEIF # incompatible network ( ex : bus 'z# star ,ta%¥iz¥¥¥%¥< . . . )

'T¥É¥¥.it#==7rl7protocolh=FEtYEn.YiEl'EEztiEE -2¥ "F -1A firewall _n= -9271k¥

' '

. .
.

→ =
.EE#31iEE8F-H-i-ix.7A--7Fg7iI "FÉtYE ,

1=1%54 .tk#t-tabE-7 )
" "

→ internet ( Internet
 1%1%28=-8-12*7
Inter process communication server client : ex : browser ¥¥u☒ email POP }
[
-

, ,

:-# T☒É59¥☒ -111¥ # EE 13,3 }¥1E _n=7tEFF¥

'

P2P →
server

distributed system :
Java Beans .
.NET

3,1*1%77 -1M¥
,
Domain ICANN oversee the registration of domains

gateway F¥tÉ¥ FE -9 ☒ domain -2-4=7%-7-1 Internet ±

"
:# ☒ ¥-7171 "ᵗEdataF
"

Internet Cloud

D # 7. ¥n¥¥Z¥%É .
# H¥¥

THE " '

Internet Service Provider ( LSP ) §, * A'☒ 2*-1%14%8 -7¥ '-¥E7IP

"
lex :# ¥¥E9É )

access ISP dial-up connection FÉk=¥ .

Cable connections .
DSL wireless
,

IPv4 v. s IPv6 IP address # 1¥ : IPv4 32 bits ,

IPv6 128 bits

#¥ # :%l¥E8☒É=b
'

Internet , VoIP ex :
Skype

email ,FTP( File transfer protocol ) telnet & ssh ,

P2P

webpage hypertext doucument

[ website a collection of closely related webpages

browser http www. ✗ ✗ ✗ / ✗ ✗ ✗ I •

html

www.zh-tn-t-A-7 -17k¥ "¥x domain name EE¥%¥*#☒ document name

-
Domain name →
1,7×31,4-7%2 -1 ☒ t.PH#E-n--3-1M-- domain name

[ Domain Name server → Domain name # DIP _a7¥±tF¥¥

 ✗ ML %E4E.EE#H=.FiE-iP--n=A:*n---zH ,
# ¥irrÉ¥ -127%1%7>7 ,

standard style -10 represent data as text ,

restricted mapping each opening to

each ending .

✗ HTML FTTTA start tag ¥-3 -1A end tag -n=F HTML

Internet Protocol 144b¥ ) -

Application

f-
-
Transport → to
message

Network →
.EE routing
=
,
5¥51 # E- tt¥ÉK¥±A -7%5

Link → handle transmission

TCP/IP Transport layer TCP :

handshaking reliable : -z"☒ÉÉ -2¥
[
.

UDP : 79b$ handshaking ,

unreliable TE 't # 2¥

Network layer IP ( IPv4 & IPv6 )

kwell-knownport-publ.ie
TCP / IPHKFATF.tt#stE.F-=17tgc-.4.n---E-a14-,E ÉT§tÉE

/ Private keys ✗ ☐ Fix SSL -75 ftp.https.ssh

EMI '¥¥¥± ☒ E- .IT/aEtXDHE.AFr-E-7iEsEEiiE-Eh1 ?¥ET

=

Alice -1¥ 'F¥ÉtYEa% ,

Bob ,
Alice ☒ A- EAT private key ✗ DIE / bob ☒ alice -n=F public

key A¥FÉ .BE/siEEr-AliceEE-n=y

Certificate Authority ( CA ) ¥ 'h4ÉXñ=F%E¥¥-y,Ét¥aA Public key ⁿÉ¥xÑ=7

1.EE#a1l7b----tF-Ex-h-n=7EEExp*Dq2.N--px-
RSA ÉLERSA key step

3. ∅ = ( P 1) -

(9-1) = ≤ NA-EDNEFE-A-7-tktf-n-7-t.SE#
4. É¥tF¥ -
4☒e coprime ∅ E%¥¥T¥¥* ¥ # 7¥ :&
5. Ftitud 1¥ die -=l ( Modo )

6. Pig ÉF¥ ,
(N / e) E- Public key ( Nid ) Ey private key

XD '%É me IS ( Mod N )

sf4¥¥j :
claim Sᵈ=m( mod N )
Ch.5 Algorithm
"

¥-5T Algorithm A- 7441T¥ '¥- ¥ ④ terminating

-

① ordered ② unambigous ③ executable

4- D9TD¥iz¥≠ Algorithm ① Flowchart # InÉ¥Ét%EH&KEnCÉt¥¥t4t ) ② Pseudocode

problem solving -

Top -

down FET¥fa¥A7F # FEE -1--4-54%-1 ☒ 3- FIT FEE .tt#-.T-Ey-1ME3-EA--rEA-x

/
.EE?EEa#Ett4-=-F-FF-E7)-zA-Ex'
Bottom -

up
-

% ¥15k
-

, :#Fi :-# FIFE 17=7%-7,4.EE I "A¥¥YNE1☒tF☒FdE .EE?sA4E4ExEE417b--p-HEiA-a'

THE
☒ 4P-HF.it#--Yn=7EnFnn*F-=EtiA-7mix planning → top-down , implementation → bottom-up

Iteration Loop control IT¥¥q :

① Initialization :
-zTÉdlo◦p¥¥7nEf¥7*84tE7¥☒
② Test :
-=ÉE7¥n7É¥T¥¥ÉÉ¥¥¥¥+A% JÉÉMEIOOP
( '
③ Modify :
7rmodify-A-95-EFE-z-bb-XF.fi#Fz-zn- DE

FEBTE.IR#conditionb-i'Iex.whi1e=-n---'t---h=-=E.-
FEI :
① pre -

test :¥testZ8n3TP¥É*8 loop , 24¥ -1¥ -

¥É¥tYJO=k
② Post -

test :
-

EH-4-87-%E4-HE.at#tiF-E---Yn=3E4-bQex.d0 while , repeat until

7=148%51952--1

Divide and conquer sub problems top

-

down sort
[
, ,

Dynamic programming 3- P-p7-EEA-aZP-n-F-7-EE.AE independent ,

bottom-up

matrix multiplication matrix Chain 1 04 48

shortest path Chain
-

. .
. . .

'"

¥ -1 -

E. ¥124 :zl

Algorithm Efficiency .FR#YE--=.-ta-n=Eyit--L.Et45-n--7A-I-P--n=F ,EXFE

=

dependence A- 7É¥É%F¥ñ
'
machine -1 → 0.52.0 notations

Asymptotic ( THE ? # 7 Analysis % # LET A- ¥914 # INE # DTDT Bi 90

Big Omega
-

-
ATTE 'T # KATA # 11¥
:
:
Traveler 's gold chain
0000000 MY I "¥× * ¥5 -4 ☒
-

5011 : tahini ☒ ,
-

I ¥5 -91¥

5012 .
: ① tati 3¥ 0 0000
IÉ
"

¥5 EEE D. &
'

② -

EY . 0 ,
=

¥s IF ¥50 ( ¥ E.% # 32*-1*07=000 )

"

③
"

④ ¥ ☒ * ¥50000 HE , 0¥00

⑤ Fts 7- F- ¥50 ( E- F.¥ # 35T¥ 0*00000 )

⑥ ¥4 # %
"

( E- F.% # 32*5=0*000*000007

⑨ ¥4 t.EE ¥5
'
Ch.06 Programming Language

* A=%É¥É FETE 1. Machine dependent

2. One -

to -

one mapping : -45,4A ÉF 7T¥:& -45 machine instruction

3. Assembler :FE%EÉÉEÉ-i*n°¥☐≠☒4¥'t¥¥ EF # Iti

ex :Java%EtÉE -4N
✓

51775¥ t.EE#it-.Ett7T-7H7Fb-tEnTE7rn--n=9- compiler

in-erpre-ecmn.code.FI#-*=X*n=.7-F=r-
're Protability

depends on # E. EVIE ¥☒ → driver . 054¥ -t¥**n%%F¥ # Mt

Programming Paradigms 1. Imperative ( procedure ) :T¥fx¥ :# FHF.it#.Eai-j-j=iTnzEE=-tac-tE- ? ¥, ¥£ - -

( ¥ᵗÉ= -47175,5b£ _n=7¥- -4T¥ )

.
-

2. Declarative :& "¥×.PH#ptE.FE-iE-E-n-=Z-ttiFa4 :# É÷ᵗa

3. Functional :¥sÉT¥%Hi¥rEKxY☒ -742T #E- Etta 3- Iii ,

4. Object-oriented

YH1≠EÉ¥ktiÉkÉt 7-4-30 abstraction -tᵗÉ< it

-¥¥sA=t¥ETiÉEÉtEF' 742¥-1¥
.FI#--4iEx9EH7LencapsulationEF*&i-EtaccessH-
information hiding

447K¥.EE#m-zb**EHiYnEs-n=T-Ea- ☐
( polymorphism 8T¥ :D '7Du_n=73ti%FxÉ¥F¥¥x :* INHERIT

ex :
coutscFEFE-11-KE.int string ,
. . .

Data structure Homogeneous Array

[
Heterogeneous Array

source code %E28-ncompilerE-1-bk-A.TT#step1 .

lexical analyzer identify token ex :
a- I b- [ 100-4544 then then - -

2. parser ¥-1 '¥É¥nD # 7 tokenn-zoperator.rs#7EFeoperant.E--IIb-X' ÉÉ=taEEF

3. ÉL -1 machine instruction →
obj . Code

A constant cannot be a 1- value =Tr¥ÉF asign-z-zaex.com/-inta--6;a--b ;

Chis Database

What is DB a collection of -3,21¥ 'T¥=Fg #4-

,
( multi dimension ) flat file

☒ excel ttr¥ᵗftiÉ%T☒IT¥¥

schema *¥1☒ .tn#Yt--tFn-t-A7&ibTn---*C'-FE*Y-A-F5-= -4,1¥-8=4-3-15 :& )

sub schema } # ¥4b # }ᵗ±hñtk access D # 3%75*77*4=-1 → ¥E¥≠¥E

DBMS application access -3*4=-1*74*12

FINE 1. application 4- bn-t-%EFDBT-bktt.EE#-tt,7r%E1n7E-zB-- ED # he application

2. FEEL '-F¥¥¥ -14=24 -44--1%5-8=8--1-4 / vi. FITTED -2¥ É¥¥TtF±b # } P-HDBMSF.tv#3-

,

Relational Database ☒ ¥yÉ *q☒ñ=7=¥=¥¥F¥

A column ftp.#T-- 145 ) → an attribute

[ A row (3-1) → a tuple

FIFA -

table 4%-13 Esta relation

Computer 3D Graphics

f- Egg projection FE 3D -4T¥ -1-8*7=1 2D -411-71

¥¥=¥iᵗE -445T¥ :{ 'gparrel projection →

FEZFE-t.E.EE#-,EtEitF--.--.K-aEE ?¥1¥E¥
1-
,

z¥mf¥Fk .FI prospective projection →

tt-t-KEEA-ahkh-n-FEEEE.EE "☒÷ᵗÉ¥×lz¥)=¥aÉF

¥4171k "¥¥.hr#FEin=7E*-n=EE---h-A-a.T--n-=9- 3 " n=A¥7AR

modeling ☒É # AK

En '¥x☒☒t'¥t¥Én=7 resolution ) → EE '¥x☒É%m

ᵗE¥xt#%¥k Bézier Curves → ☒ %¥irFE±É8IFÉ¥I% -1+455*7%2171=14

FEED 't # f- Er lighting ¥=¥¥HE :

1. I # Ed Ambient lighting 18=4*7%1 ( Ia )

2. -445% Directional lighting

F- KITH Point lighting

'

3. ,

( I -

Ia )
1=19+1 xdtpda +
d : 4- Ht # 7-1%518-8=7 FE¥tdÉ

IFE :# shading phong model →

FE model -11754-11*41*41771 = Ambient -1 Diffusion lÉÉFE ) + specular 1¥ '¥a☒t )

¥¥xIE7 } # ¥ 171¥ :* 'E # A- 73541¥ Fx¥t%}¥¥

≤ FAKE"ÉEr ¥ :& : 1. Flat → -

4☒=ftk÷¥< -
4☒¥i£u

2. Gouraud

3. Phong
Theory of computation

FTÉÉF function FÉIÉTTTEEI >rñ¥t→7¥ t☒%Fx¥☒KxF¥"Eñ=7ÉtFE¥¥= -1¥

-

Turing Machine Finite state automata 1- infinite RIW tape

* F¥t¥¥ÉZ't÷¥i¥