U E D R , A S I H C RSS

TAOCP/Information Structures

2.2. Linear Lists

2.2.2. Sequential Allocation

ํ•œ …ธ“œ— “ค–ดžˆŠ” WORD˜ ˆ˜€ cฐœฉด ‹คŒ ฐ™ด “ธ ˆ˜ žˆ‹ค.
LOC(Xj + 1) = LOC(Xj) + c

ƒˆ˜ L0 base addressณ  ํ•œ‹คฉด ‹คŒ ฐ™ด„ “ธ ˆ˜ žˆ‹ค.
LOC(Xj) = L0 + cj

Sequential Allocation€ stack„ ‹คฃจŠ”ฐ ํŽธฆฌํ•˜‹ค.
''ƒˆ ›†Œ „ธฐ(To place a new element Y on top)
T โ† T + 1; XT โ† Y;
งˆ€ง‰ ›†Œ ธฐ(setting Y equal to the top node and delete)
Y โ† XT; T โ† T - 1;''

queue‚˜ deque ‚˜ํƒ€‚ดŠ” ฒƒ€ €” ณตžกํ•˜‹ค.
''ƒˆ ›†Œ „ธฐ(inserting an element at the rear of the queue)
R โ† R + 1; XR โ† Y;
งจ •ž ›†Œ ธฐ(removing the front node)
F โ† F + 1; Y โ† XF; if F = R, then set F โ† R โ† 0''

ํ•˜€งŒ ณต„‚ญ„€ ฌดํ•œํ•  ˆ˜ žˆ‹ค.( F, Rด „†ฆ€ํ•˜ธฐ •Œฌธด‹ค.) ”ฐ„œ ดŸฐ ฌธ œ(the problem of the queue overrunning memory) ํ•ดฒฐํ•˜ คฉด, Mฐœ˜ …ธ“œ(X1...XM)€ ˆœํ™˜ํ•˜„ก ํ•œ‹ค.
''if R = M then R โ† 1, otherwise R โ† R + 1; XR โ† Y.
if F = M then F โ† 1, otherwise F โ† F + 1; Y โ† XF.''

—ฌํƒœŒ€Š” ฌธ œ(” „„ ณต„ด —†‚˜, ” €šธ ฒƒด —†Š” ฒฝšฐ)€ —†‹คณ  € •ํ–ˆ‹ค. ด ฌธ œŒ€ ณ  คํ•œ  •ด ‹คŒ ฐ™‹ค.
p.245 (2a),(3a),(6a),(7a)

(6a),(7a)—„œŠ” ดˆธฐ กฐด F = R = 1ด‹ค. งŒ•ฝ F = 0ดฉด ˜ค„ํ”Œกœšฐ€ ƒธฐ€ •Šธฐ •Œฌธด‹ค.
AnswerMe ทธ ‡‹คฉด ƒˆ ›†Œ „œฉด X2€„“ค–ด„‹คŠ” €? --Leonardong

˜ค„ํ”Œกœšฐ™€ –ธ”ํ”Œกœšฐ€ –ด‚ฌ„ •Œ –ด–ปฒŒ ํ•ด• ํ• Œ? –ธ”ํ”ŒกœšฐŠ” ํ•˜‚˜˜ ˜žˆŠ” กฐด - —Ÿฌ ƒํ™ฉด •„‹ˆ - ด‹ค. ํ•˜€งŒ ˜ค„ํ”ŒกœšฐŠ” ” “ค–ดฐˆ ณต„ด —†Š”ฐ “ค–ดฐˆ  •ณด€ ‚จ•„žˆ–ด„œ —Ÿฌด‹ค. ”ฐ„œ ˜ค„ํ”Œกœšฐ€ ƒธฐฉด šฉŸ‰ํ•œ„ „˜–ด„œ„œ ํ”„กœทธžจด ข…ฃŒํ•œ‹ค.

€Šฅํ•œ ณต„— ฆฌŠคํŠธ€ ‘ ฐœ žˆ‹คฉด (ณ  •œ)bottom„ ฐ™ด “ธ ˆ˜ žˆ‹ค. (p.246 ทธ ฐธณ ) ดŸฐ ฒฝšฐ ‘ ฆฌŠคํŠธ€ ฉ”ชจฆฌ ชจ‘ จ„ฆด •ŒŒ€ ˜ค„ํ”ŒกœšฐŠ” ƒธฐ€ •ŠŠ”‹ค. ดŸฐ ํ˜•ํƒœŠ” งคšฐ ž “ฐธ‹ค.

ํ•˜€งŒ ฆฌŠคํŠธ€ ” งŽœฉด bottomด ›€ง ˆ˜ žˆ–ด• ํ•œ‹ค.(we must allow the "bottom" elements of the lists to change therir positions.) MIX—„œ Iฒˆงธ ํ•œ WORD rA— € ธ˜คŠ” ฝ”“œŠ” ‹คŒ ฐ™‹ค.
''LD1 I ;I rI2— „Š”‹ค.
LDA BASE(0:2) ;BASE—  €žฅœ L0†Œ rA— „Š”‹ค.
STA *+1(0:2) ;ทธ †Œ ‹คŒ ฉ”ชจฆฌ(LDA *,1ด žˆŠ”)— „Š”‹ค.
LDA *,1 ;—ฌธฐ— I ”ํ•œ †Œกœ €„œ ทธ ฐ’„ rA— „Š”‹ค.''

nฐœ˜ Šคํƒด žˆŠ” ฒฝšฐ iฒˆงธ(1โ‰คiโ‰คn) Šคํƒ— ›†Œ „ณ  Š”  •„ ‹คŒ ฐ™ด  „ ˆ˜ žˆ‹ค.
p.247 (9) (10) ฐธณ 

—ฌธฐ„œ iฒˆงธ Šคํƒ—„œ ˜ค„ํ”Œกœšฐ€ ƒธฐฉด ฉ”ชจฆฌ žฌฐฐ˜(repack memory) ํ•  ˆ˜ žˆ‹ค. ช‡€€ ฐฉฒ•ด žˆŠ”ฐ €ธˆ€„ž„ธํžˆ •Œ•„ณดž.
''ดˆธฐ กฐด : p.247 (11) ฐธณ 
iฒˆงธ Šคํƒ—„œ ˜ค„ํ”Œกœšฐ€ ƒ„ •Œ''
a) œ„กœ ํ•œ”ฉ €ธฐ(moving things up)'''
i๏œkโ‰คnธ k €šดฐ TOPk < BASEk+1ธ €žฅ ž‘€ k ฐพŠ”‹ค. ฐพœฉด TOPk โ‰ฅ L๏žBASEi+1ธ L— Œ€ํ•ด„œ ‹คŒ„ ํ•œ‹ค.
CONTENTS(L+1) โ† CONTENTS(L) (L€ ํฐ ฒƒ€„‹ค. ํ•ด‹‚ฌํ•ญ —†œฉด •„ฌดฒƒ„ ํ•˜€ •ŠŠ”‹ค.)
ทธฆฌณ  งˆ€ง‰œกœ iณด‹ค ํฌณ  kณด‹ค ํฌ€ •Š€ ชจ“  BASE™€ TOP„ ํ•˜‚˜”ฉ œ„กœ ‹ค.

b) •„ž˜กœ ํ•œ”ฉ €ธฐ(moving things down)''' a)— ํ•ด‹ํ•˜Š” k€ —†„ ฒฝšฐ
iโ‰คk๏œnธ k €šดฐ TOPk < BASEk+1ธ €žฅ ํฐ k ฐพŠ”‹ค. ฐพœฉด TOPi โ‰ฅ L๏žBASEk+1ธ L— Œ€ํ•ด„œ ‹คŒ„ ํ•œ‹ค.
CONTENTS(L-1) โ† CONTENTS(L) (L€ ž‘€ ฒƒ€„‹ค. ํ•ด‹‚ฌํ•ญ —†œฉด •„ฌดฒƒ„ ํ•˜€ •ŠŠ”‹ค.)
ทธฆฌณ  งˆ€ง‰œกœ kณด‹ค ํฌณ  iณด‹ค ํฌ€ •Š€ ชจ“  BASE™€ TOP„ ํ•˜‚˜”ฉ •„ž˜กœ ‹ค.
c) „งœ ˜ค„ํ”Œกœšฐ
ณต„„ ฐพ„ ˆ˜ —†‹ค. ํฌธฐํ•ด• ํ•œ‹ค.
''
(p.248— (12)™€ ทธ 4Š” ˜ˆ œด‹ค. ฐ –ด ต‹ค. 3ฒˆ„ ํ•ดณด•˜œ‚˜  œŒ€กœ ‚˜˜คงˆ •Š•˜‹ค.)

ดˆธฐฐ’œกœ ํšจœจ ธ ‹œž‘ œ„˜ Š” ฒƒด €Šฅํ•˜‹ค. (p.248 (13), ํ‰ท  œกœ BASE „ํฌ‹œํ‚จ‹ค.)

ํ•œ ฒˆ ฉ”ชจฆฌ žฌฐฐ˜ ํ•  •Œงˆ‹ค ณต„„  ‹ํžˆ งˆ จํ•˜Š” ฐฉฒ•„ €Šฅํ•˜‹ค.( ทธŸฌ‚˜ ดํ•ดํ•˜€ ชปํ–ˆ‹ค.p.250— ค‘„— ณดฉด œ„ •Œณ ฆฌฆ˜(Algorithm G‚˜ R) „Šทํ•œ ™  ฉ”ชจฆฌ ํ• ‹ •Œณ ฆฌฆ˜˜ ˆ˜ํ•™  „„€ งคšฐ –ด ต‹คณ  ‚˜™€žˆ‹ค. )

Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:28:09
Processing time 0.0432 sec