所屬科目:研究所、轉學考(插大)、學士後-計算機概論
1. (a) If an array is declared \(A[upper_{0}][upper_{1}] ... [upper_{n-1}]\)., to give the number of elements in the array A. (5%)
(b) Suppose that α is the address for A [0][0][0] and A is declared as A[upper0][upper1][upper2], to give the formula for addressing the 3D array A[i][j][k]. (10%)
2. Write the prefix and postfix forms of the following expressions: (20%)
3. To give the depth first search DFS(1) spanning tree of the following undirected graph. (15%)
(a) 395
(b) 21.15625
5. What is memory hierarchy in computer architecture? Why is memory hierarchy important? (10%)
6. What is DNS? Explain the relationship between domain name and IP address. (10%)
7. What are deadlock and starvation in process management? (10%)