作者tsungsyu (OLiVe)
看板TransCSI
標題[問題](考古題)還有幾題寫不出來,跪求解答。
時間Sat Jun 14 15:29:56 2008
維基跟辜狗找了好久,還是有些答案不太肯定。麻煩板上的高手幫忙解答囉。
十分感激。
(1)The process of associating a symbolic name with a physical memory address is called
_____.
(A)synchronizing (B) validating (C) binding (D) registering
(2)_____ can transmit information between networks using totally different
communication techniques.
(A) repeaters (B) routers (C) bridges (D) ports
(3)Which of the following statements is correct?
(A) scientists still think it is necessary to write a Turing machine when they talk about an
algorithmic computation.
(B) a Turing machine that is executing an algorithm to solve some task must halt when
begun on a tape containing input appropriate to that task.
(C) a Turing machine that is executing an algorithm to solve some task need not halt
when begun on a tape containing input appropriate to that task.
(D) just running the Turing machine enables us to decide about halting.
(4)If a Turing machine program consists of the following four instructions:
(1,0,1,2,R)→(1,1,0,2,R)→(2,0,0,2,R)→(2,b,b,2,L) then which of the following is a
halting configuration?
(A)... b 1 1 b b b ... (current state = 2, symbol 1 is being read)
(B) ... b 1 1 b b b ... (current state = 1, symbol 1 is being read)
(C) ... b 1 0 b b b ... (current state = 1, symbol 0 is being read)
(D) ... b 1 0 b b b ... (current state = 2, symbol 0 is being read)
關於第一題 我知道邏輯位址與實際位址連結叫binding,跟題目指的是一樣的東西嗎?
第二題想選(D)ports,不知道有沒有(C)選項這東西。
第三題跟第四題,一直提到Turing machine。計算計概論課本好像沒看到這個,
如果是我眼殘可以告訴我這是什麼嗎?
謝謝版上的各位。
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.171.12.97
1F:推 avogau:第二題應該是(B)吧 06/22 18:22
2F:→ tsungsyu:感謝 06/27 09:51