1. (10%) Write down the sequence of the 7 keys in the array that results after performing 3 successive delete-the-max opecrations on the following maximun-oriented binary heap of size 10:
97 82 89 3466 78 8515 28 51

5. 請直接在譜例上標示出 1 至 10 小節的調性(例如：C 大調, a 小調 ...等) (5%)與和 聲進行(例如：ii6、V、i6…等)。

6. 根據您的觀察，此樂曲最有特色的部份有那些？

一、近年來，隨著社會大眾福利意識的覺醒，專業社會工作在台灣發展拓展 出嶄新的局面。請以你個人的觀點，闡述社會工作在台灣發展所面臨的 問題困境及未來的專業發展趨勢為何?

二、社會工作是一門助人的專業，有其一套基本的價值體系，形成了專業使 命，以及實務工作者應該遵守的優先原則。請闡述社會工作的專業核心 價值觀及專業倫理守則的目的、功能與範疇為何?

2. (10%) Write down the sequence of the 13 keys in the array that results after inserting the sequence of 3 keys: 25 16 12into the following maximum-oriented binary heap of size 10: 86 82 77 75 70 35 68 31 45 30

3. (20%) Write a pseudocode function that can re-construct a binary tree by using its preorder and inorder traversals. Please return the root of the binary tree as the output. Note: A node in a binary tree has two pointers, named 'lett' and 'right', respectively, where the 'left' pointer is used to find the left child of the node and the 'right' pointer is used to find the right child.

4. (20%) Write a pseudocode function that removes the nodes in even positions (the second, fourth, sixth, and so forth) in a given linked list. No return values are expected. Note: A node in a null-terminated linked list has one pointer, named 'next', that points to the next node if it is not null.

5. (20%) Given a reference that points to a node x in a doubly circular linked list. Please write a pseudocode function to delete the node x from the doubly circular linked list. No return values are expected. Note: A node in a doubly circular linked list has two pointers, named 'next' and 'prev', respectively, where the 'next' pointer is used to find the next node and the ' prev' pointer is used to find the previous

(10%) a. List both the advantages and disadvantages of adjacency list and adjacency matrix for the graph representation, respectively.

(10%) b. Analyze the complexity of depth-first search (DFS) on a graph represented by the adjacency list or adjacency matrix, respectively.