106年 - 106 國立中山大學_碩士班招生考試_電機系(丙組)：資料結構#110221

科目：中山◆電機◆資料結構 | 年份：106年 | 選擇題數：0 | 申論題數：33

試卷資訊

所屬科目：中山◆電機◆資料結構

選擇題 (0)

申論題 (33)

1.1 [3] How many integers can be stored in the array PP?

1.2 [3] How many bytes does the array PP itself take?

1.3 [3] What is the starting address of the element PP[10,5]?

1.4 [3] What is the starting address of the element PP[5, 10]?

1.5 [3] What is the starting address of the last element in PP?

2.1 [3] What is the size, in the number of bytes, of each node of the list?

2.2 [3] What is stored in the variable head?

2.3 [3] What is the content of the first node of the list?

2.4 [3] What is the content of the last node of the list?

2.5 [3] Suppose we delete the second node from the list. After deletion, what is the content of the first node of the resulting list?

3.1 [5] What is the fifth node of the preorder sequence of this tree?

3.2 [5] What is the fifth node of the inorder sequence of this tree?

3.3 [5] What is the fifth node of the postorder sequence of this tree?

4.1 [3] What is the content of A[3] of the resulting array?

4.2 [3] What is the content of A[6] of the resulting array?

4.3 [3] What is the content of A[10] of the resulting array?

4.4 [3] What is the content of A[13] of the resulting array?

4.5 [3] We delete the root node from the heap and make it into a max heap again. What is the content of the A[6] of the resulting array?

5.1 [3] What is the minimum number of nodes in T?

5.2 [3] What is the maximum number of nodes in T?

5.3 [3] There are n possible complete binary trees of depth 100. What is n?

5.4 [3] Suppose we number the nodes T by starting with the node on level 1, and continuing with the nodes on level 2, and so on. Nodes on any level are numbered from left to right. Let the first node be numbered 1, the second node be numbered 2, and so on. For a node numbered 200, what is its left node numbered?

5.5 [3] Following above, for a node numbered 3001, what is its parent node numbered?

6.1 [2] What is the content of A[O]?

6.2 [2] What is the content of A[3]?

6.3 [2] What is the content of A[6]?

6.4 [2] What is the content of A[9]?

6.5 [2] What is the content of A[12]?

7.1 [3] What is the left child of the root node?

7.2 [3] What is the right child of the node containing 80?

7.3 [3] What is the left child of the node containing 25?

7.4 [3] What is the right child of the node containing 55?

7.5 [3] What is the height of the binary tree? Let one-node tree have a depth of 1.