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

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

20. Consider an infix expression: (A+B)*C+D*(E-F). What is its prefix expression? (A) **A++BC-DEF (B) ++A*BC-*DEF (C) +*+ABC*D-EF (D) *+ABC+*-DEF (E) +*+ABC*-DEF

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

22. Which one of the following terms is NOT the advantages of paging in memory management? (A) same page size (B) preventing internal fragmentation (C) preventing external fragmentation (D) enabling memory protection (E) enabling memory sharing

23. Which one of the following protocols is implemented on top of SSL/TLS? (A) HTTP (B) HTTPS (C) POP3 (D) SMTP (E) TELNET

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