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

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.

其他試題