20. What will be the output of the following C code?

(A) 36
(B) 39
(C) 93
(D) 63
(E) 96

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

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

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

9. Suppose computers A and B have IP addresses 10.105.1.113 and 10.105.1.91, respectively, and they both use the same netmask N. Which of the values of N given below should be used if A and B belong to the same network? (A) 255.255.255.255 (B) 255.255.255.250 (C) 255.255.255.240 (D) 255.255.255.224 (E) 255.255.255.192

10. Assume a network device sends out data at the rate of 4,000 bps. How long does it cost to send a file of 100,000 characters? (A) 100 seconds (B) 200 seconds (C) 300 seconds (D) 400 seconds (E) 50 seconds

114年 - 114 學士後醫學系招生考試試題：計算機概論與程式設計#137105

113年 - 113 學士後醫學系招生考試試題：計算機概論與程式設計#119574

112年 - 112 學士後醫學系招生考試試題：計算機概論與程式設計#137106

111年 - 111 學士後醫學系招生考試試題：計算機概論與程式設計#137107

111年 - 111 國立中山大學_學士後醫學系招生考試：計算機概論與程式設計#113521

111年 - 111 學士後醫學系招生考試：計算機概論與程式設計#107630

110年 - 110 學士後_醫學系︰計算機概論與程式設計#100246

109年 - 109 高雄醫學大學_學士後醫學系招生考試：計算機概論與程式設計#86938