作者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