U E D R , A S I H C RSS

Postech/Quality Entrance Exam06

area 1
  1. •Œ๊ณ ฆฌฆ˜ ‹œ๊ทธงˆ 1~ i4 ๊นŒ€ ƒ€Šธฅผ กœšฐ น…˜ค ‚ฌšฉ•˜—ฌ ฆ…
  2. ๊ฐ  ˆฒจ˜ งฅ‹œฉˆ …ธ“œ˜ ˆ˜ ฆ…
    †’ ‡ผ•Œ ตœŒ€ …ธ“œ˜ ˆ˜ ฆ…
  3.  •ˆ˜ 4๊ฐœผ•Œ ตœ†Œ น„๊ต šŸˆ˜กœ †ŒŒ… •ผ
  4. ๊ทธž˜”„ ‚ฌ ฐพŠ” •Œ๊ณ ฆฌฆ˜
  5. right linear กœ AB* U C* ธ๊ฑฐ ๊ทธž˜จธกœ  ๊ธฐ
  6. 1~3๊ฐœ ฌธ œ ŽŒ•‘  ˜งˆ ‚ฌšฉ•˜—ฌ ฆ… ˜น€ ˜ค† งˆƒ€กœ ๊ทธ ค„œ regular — †•œ‹ค๊ณ  ฆ… •˜๊ธฐ
    area 2

    1. boolean algebra ˜  •˜
      boolean algebra ™€ ordinary algebra ˜ ฐจ
      …ธ”„˜ งต


    1. ‹œฎ€ •Š€ JK ”Œฆฝ ”Œกญ 2๊ฐœ žˆŠ” šŒกœ๊ฐ€ žˆ๊ณ  ๊ฒƒ˜ ˜ค† งˆƒ€ ๊ทธฆฌ๊ธฐ Moore จธ‹ œผกœ
      ๊ฒƒ“ค JK ”Œฆฝ ”Œกญ 1๊ฐœกœ งŒ“ค ˆ˜ žˆ‚˜

    1. Machine Language Like •œ ”„กœ๊ทธžจ งŒ“ค๊ธฐ. ฝ”“œ ฃผ๊ณ . Šค•ž •ˆ˜ ˜ธถœ•˜Š” €ถ„ žˆ๊ณ  ŒŒผฏธ„ฐ Œจ‹ฑ„ „ค…•••จ.

    4.2 way assoiate บ‹œ—„œ žˆŠธ ˜—ˆ‚˜ •ˆ˜—ˆ‚˜, ญ ๊ทธŸฌ๊ณ  ๊ตฌกฐ ๊ทธฆฌ๊ณ  ๊ฐ index, tag, byte offset “ฑ š”†Œ •Œ•„ งžถ”๊ธฐ

    1. DMA ๊ณ„‚ฐ•˜Š” ฌธ œ

    area 3
    1. Page ฌ๊ธฐ๊ฐ€ ž‘„•Œ˜ žฅ ๊ณผ ‹จ 
    2. ™€ ‹จŽธ™”Š” —‡ฉฐ TLB ฅผ ‚ฌšฉ•˜—ฌ ––๊ฒŒ •๊ฒฐ? ๊ทธฆฌ๊ณ  ‚€ ‹จŽธ™”™€ ™€ ‹จŽธ™” Œ€กฐ,,


    1. 2 32 Šน   ๊ฐ€ƒ ฉ”ฆฌ ฌ๊ธฐ, 2 18 Šน  ‹ค œ ฉ”ฆฌ ฌ๊ธฐ ‹ค. Ž˜€ ฌ๊ธฐ๊ฐ€ 4096(2 12Šน) ผ•Œ ฉ”ฆฌ 115324221412 (Œ€žต  •„) ฃผ†Œฅผ
      ‹ค œ ฉ”ฆฌ ฃผ†Œกœ งค•‘ •˜ ––๊ฒŒ ˜‚˜.

    1. Mutual Exclusion —„œ Bounded Waiting, Progress, Mutual Exclusion  •„‹Œ๊ฒƒ •˜‚˜ฅผ ๊ณ ๊ธฐ

    - ––ค ๊ฒฝšฐ— counting semaphore ฅผ “ฐŠ”€,,

    1. Corutine, CoProcess, IPC — ๊€•„œ..

    1. Pass by name, Pass by reference, pass by name

    1. žž˜ žž˜ •œ €ฆˆ“ค
Dynamic Scoping —„œ Shallow Access •˜Š” ๊ฒฝšฐ— ƒ๊€ —†Š” ‚ค›Œ“œ ฐœ๊ฒฌ•˜๊ธฐ.

  1. pointer restrict ๊€ จ ฌธ œ
    10 Dynamic Scoping —„œ Static type ‚น„ –ˆ„•Œ ––ค ฌธ œ ๊ฐ€ ฐœƒ•˜Š”๊ฐ€


  1. Weakest precondition ๊€ จ ฌธ œ
  2. Denotational semantics

Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:24:00
Processing time 0.0128 sec