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.0122 sec