所屬科目：研究所、轉學考(插大)、學士後-計算機概論
3. For a specific CPU design, there are three instruction classes as depicted in Table 1 and run at a clock rate of 100 MHz. For a given program, a compiler can produce the following executed instruction counts as depicted in Table 2. Please calculate the average CPI of this compiler. (A) 4 (B) 2 (C) 1.25 (D) 0.5 (E) All of the above are wrong.
8. Given a C code as follows, which random range initializes the array myList? (A) 0 to 100 (B) 1 to 100 (C) 0 to 99 (D) 1 to 99 (E) All the listed answers are incorrect.
10. Given a C code as follows, which one of the following is the return value of f(12, -20)? (A) -32 (B) -20 (C) 0 (D) 12 (E) 20
11. Consider the following C code. Please indicate the values of x and y after execution. (A) x = 26, y = 35 (B) x = 26, y = 34 (C) x = 26, y = 29 (D) x = 26, y = 30 (E) x = 29, y = 26
13. Given a binary tree as follows, please indicate the result of pre-order traversal. (A) 7, 5, 28, 40, 36, 12, 79, 50, 49, 86, 96, 81, 99, 43 (B) 5, 7, 12, 28, 36, 40, 43, 49, 50, 79, 81, 86, 96, 99 (C) 43, 12, 5, 36, 7, 28, 40, 99, 81, 49, 96, 50, 86, 79 (D) 43, 12, 99, 5, 36, 81, 7, 28, 40, 49, 96, 50, 86, 79 (E) 43, 12, 5, 7, 36, 28, 40, 99, 81, 49, 50, 79, 96, 86
15. Consider the following C code. Please indicate the value of x after execution. (A) 8 (B) 11 (C) 14 (D) 17 (E) 20
16. Consider a series of matrices Concerning the most efficient way to multiply this sequence of matrices, how many multiplication operations does it need? (A) 112 (B) 126 (C) 142 (D) 156 (E) 178
17. Consider five processes as follows. They arrived in the order of P1, P2, P3, P4, and P5 at time 0. What is the total turnaround time of all processes by using the shortest-job-first (SJF) scheduling algorithm? (A) 25 (B) 30 (C) 35 (D) 40 (E) 45
18. All 10.0.0.0/24 datagrams leaving local network have same single source IP address 138.76.29.7, different source port numbers. What technology does such a mechanism rely on? (A) NAT (B) NNTP (C) SMTP (D) ICMP (E) PPTP
19. Consider the following C code: After the code is executed, what is the output? (A) 25 (B) 35 (C) 45 (D) 55 (E) 65
21. Consider the following C code: What is the output of the above program? (A) 100 236 306 254 165 (B) 100 220 330 261 150 (C) 105 224 328 239 165 (D) 100 220 337 239 165 (E) Segmentation fault
24. Refer to Table 3 and Table 4, please indicate the CORRECT SQL statement that can output as depicted in Table 5. (A) SELECT * FROM movies (B) SELECT TOP 1 movies.movie, actors.name FROM movies INNER JOIN actors ON movies.actor = actors.id ORDER BY actors.salary DESC (C) SELECT movies.movie, actors.name FROM movies INNER JOIN actors ON movies.actor = actors.id ORDER BY actors.salary (D) All of the above can output the same results, as shown in Table 5. (E) None of the above can output the same results, as shown in Table 5.
25. Consider a graph as follows. Starting from node D, what is the visiting sequence of all nodes by using depth-first-search. If you have multiple choices, just follow the alphabetical order. (A) D, B, A, C, E, F, G, H, I (B) D, F, G, I, H, E, B, C, A (C) D, F, G, I, H, E, C, A, B (D) D, B, A, C, E, H, I, G, F (E) D, F, G, I, H, E, C, B, A
2. Alice writes the following code and expects that the process prints “Hello Kitty” four times. However, the process prints “Hello Kitty” three times only! Please describe the reason why Alice’s code prints “Hello Kitty” three times instead of four.
3. Consider the following processes. Please draw the schedules (Gantt Chart) and calculate the average waiting time for the Preemptive Shortest Job First, and Round Robin (time-quantum = 4 ms) scheduling policies, respectively.
4. Consider a weighted graph (the edges show the costs) as follows. Please use the Kruskal Algorithm to get the corresponding minimum (cost) spanning tree. Not only the result but also the whole procedure steps should be presented in your answer.
阿摩線上測驗
登入
阿摩線上測驗
登入
(A) 4 (B) 2 (C) 1.25 (D) 0.5 (E) All of the above are wrong.
(A) 0 to 100 (B) 1 to 100 (C) 0 to 99 (D) 1 to 99 (E) All the listed answers are incorrect.
(A) -32 (B) -20 (C) 0 (D) 12 (E) 20
(A) x = 26, y = 35 (B) x = 26, y = 34 (C) x = 26, y = 29 (D) x = 26, y = 30 (E) x = 29, y = 26
(A) 7, 5, 28, 40, 36, 12, 79, 50, 49, 86, 96, 81, 99, 43 (B) 5, 7, 12, 28, 36, 40, 43, 49, 50, 79, 81, 86, 96, 99 (C) 43, 12, 5, 36, 7, 28, 40, 99, 81, 49, 96, 50, 86, 79 (D) 43, 12, 99, 5, 36, 81, 7, 28, 40, 49, 96, 50, 86, 79 (E) 43, 12, 5, 7, 36, 28, 40, 99, 81, 49, 50, 79, 96, 86
(A) 8 (B) 11 (C) 14 (D) 17 (E) 20
Concerning the most efficient way to multiply this sequence of matrices, how many multiplication operations does it need? (A) 112 (B) 126 (C) 142 (D) 156 (E) 178
(A) 25 (B) 30 (C) 35 (D) 40 (E) 45
(A) NAT (B) NNTP (C) SMTP (D) ICMP (E) PPTP
(A) 100 236 306 254 165 (B) 100 220 330 261 150 (C) 105 224 328 239 165 (D) 100 220 337 239 165 (E) Segmentation fault
(A) SELECT * FROM movies (B) SELECT TOP 1 movies.movie, actors.name FROM movies INNER JOIN actors ON movies.actor = actors.id ORDER BY actors.salary DESC (C) SELECT movies.movie, actors.name FROM movies INNER JOIN actors ON movies.actor = actors.id ORDER BY actors.salary (D) All of the above can output the same results, as shown in Table 5. (E) None of the above can output the same results, as shown in Table 5.
(A) D, B, A, C, E, F, G, H, I (B) D, F, G, I, H, E, B, C, A (C) D, F, G, I, H, E, C, A, B (D) D, B, A, C, E, H, I, G, F (E) D, F, G, I, H, E, C, B, A
