2. Suppose a computer has a RAM of 1 GB. Let one addressable word consist of 4 bytes. How many address bits are required to access all the words in the RAM?
(A) 28
(B) 29
(C) 30
(D) 31
(E) 32

【已刪除】48. 有關評量工具的信度及效度，下列敘述何者正確？(A)信度是評量工具能確實評量出目標行 為或特質(B)效度是評量結果的可靠性和一致性(C)收集足夠的行為樣本以涵蓋欲評量的 行為，可以提昇效度(D)具有高信度的評量工具，效度一定高

【已刪除】49. 有關幼兒整理數與量訊息的例子，何者正確？甲、對應：同一雙襪子配在一起。 乙、序列： 依積木長短排成一列。 丙、配對：一個杯子搭配一根牙刷。 丁、型式：發現紅綠燈是紅燈 →綠燈  →黃燈、紅燈  →綠燈  →黃燈的順序重複出現。(A)甲乙(B)甲丙(C)乙丁(D)丙丁

【已刪除】50. 班級常規可由師生共同討論來制訂，在制訂班級常規時何者錯誤 ？(A)班規則數不宜過多(B) 制訂後全園通用，大家都應該遵守(C)用字應該簡潔，且幼兒容易實踐(D)可視幼兒實踐 狀況加以更換。

1. Hashing is used to create a hash table for integer keys. Let the hash table be a vector indexed from 0 to 6, the hash function be f(x) = x%7 where x denotes an integer key and % is the modulo operator, and collision be solved with the linear open addressing strategy. Suppose the four integer keys: 19, 33, 8, and 54, are processed sequentially. Where is 33 placed in the hash table? (A) The position indexed 2 (B) The position indexed 3 (C) The position indexed 4 (D) The position indexed 5 (E) The position indexed 6

3. Let x=00001111 and y=11111011 be two 8-bit 2’s complement binary numbers. What happens for x + y? (A) The result is -12 in decimal representation. (B) The result is 12 in decimal representation. (C) The result is -10 in decimal representation. (D) The result is 10 in decimal representation. (E) Overflow occurs.

4. What is bootstrap? (A) an I/O device (B) a memory device (C) an interrupt handler (D) a processor (E) a small initiation program to start up computers

5. CPU scheduler selects the next process for execution. There are several basic scheduling methods, such as first-in-first-out (FIFO), shortest job first (SJF), and round-robin (RR). Regarding to these methods, which of the following comments is INCORRECT? (A) With FIFO, the waiting time of a process may depend on the arriving order of the processes. (B) Starvation won’t occur with FIFO. (C) Theoretically, SJF is an optimal scheduling algorithm in terms of average waiting time. (D) Starvation won’t occur with SJF. (E) RR is a preemptive scheduling algorithm.

6. Virtual Memory is a storage allocation scheme in which secondary memory can be addressed as though it were part of main memory. Virtual memory can be implemented using Demand Paging. Several steps are performed in the demand paging scheme: Step 1: Operating system (OS) puts the process in the blocking state. Step 2: CPU is notified and the interrupted process is put in the ready state. Step 3: The required page is brought into the memory with the page replacement algorithm. Step 4: CPU generates an interrupt, indicating a page fault. Step 5: Page table is updated accordingly. Which of the following is the CORRECT sequence of steps performed by demand paging? (A) 1, 2, 3, 4, 5 (B) 2, 4, 3, 1, 5 (C) 3, 2, 5, 1, 4 (D) 4, 1, 3, 5, 2 (E) 5, 3, 1, 2, 4

7. Assume there are four frames in main memory. Consider the following page reference string: 2, 1, 6, 4, 1, 2, 5, 3, 1, 2, 1, 6, 7, 3, 6, 1, 2, 1, 6, 3. How many page faults occur for the OPT (Optimal Page-replacement Algorithm) replacement? Notes: All frames are initially empty, so the first unique pages will all cost one fault. (A) 7 (B) 8 (C) 9 (D) 10 (E) 11

8. Consider the execution of the following set of processes on a single-core processor.Assume we use preemptive SJF (Shortest-Job-First) scheduling. What is the average waiting time? (A) 10 (B) 12 (C) 14 (D) 16 (E) 18