作者hothero (hothero)
看板TransCSI
标题[问题] 数题考古题...
时间Thu Jul 3 12:26:37 2008
是非题
(a)Memory access is the slowest step in the instruction fetch-execute cycle
(h)The selection sort algorithm does the same amount of work no matter
how the items in the list are initially arranged.
(i)Correcting errors is as easy as detecting them.
(j)A Turing machine can store information in and retrieve it from memory.
---------------------------------------------------------------------------
1.What of the following is an andvantage of using dynamic linking?
(a)smaller execution file (b)shorter running time
(c)easier maintenance (d)less dependency on external files
2.What is the lower bound of comparison sorts under the Von Neumann architecture??
(a)O(n^2) (b)O(nlogn) (c)O(n) (d)O(logn)
以上数题，烦请指教~谢谢^^
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 220.134.245.25
1F：推 avogau:1:C 2:B 07/03 17:15
2F：→ hothero:可以请问为什麽2是b吗?? 07/03 19:02
3F：推 avogau:(H) True 07/04 00:27
4F：→ avogau:(I) False 07/04 00:28