[問題] 數題考古題...
是非題
(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
推
07/03 17:15, , 1F
07/03 17:15, 1F
→
07/03 19:02, , 2F
07/03 19:02, 2F
推
07/04 00:27, , 3F
07/04 00:27, 3F
→
07/04 00:28, , 4F
07/04 00:28, 4F