4. 布林運算式 可以化簡至最簡單的式子為_________ 。(2 分)

1. 以下這段 C 程式執行後，b 的值為_________ 。(2 分)

2. 以 Huffman 編碼來壓縮一個由 26 個大寫英文字母組成的字串(26 個字母都有出現在字串內)，需先依字母出現頻 率建一顆 Huffman 樹。這顆樹共有 ________個內部節點(internal node)。(2 分)

3. 以下為一 C 語言的遞迴函數，f(9)的返回值為___________ 。(2 分)

(a) A binary tree with height h has at most ________ nodes.

(b) The height of a complete binary tree with n nodes is ________ .

(c) A perfect(full) binary tree with L leaf nodes has ________ nodes(total).

6. Tower of Hanoi with Adjacency Requirement: (each 2 points) Suppose that in addition to the requirement that they never move a larger disk on top of a smaller one, the priests who move the disks of the Tower of Hanoi are also allowed only to move disks one by one from one pole to an adjacent pole. Assume poles A and C are at the two ends of the row and pole B is in the middle, if a single disk is to be moved from pole A to pole C (using pole B), then moving the disk directly from A to C is not allowed. The disk must be first transferred to pole B and then to pole C.(A-＞B,B-＞C) The following function shows the solution for Tower of Hanoi with Adjacency Requirement. Please fill the blanks, and derive the time complexity of the program. /* note: move n disks from pole "from" to pole "to" using pole "aux" for auxiliary, where pole "from" is not adjacent to pole "to". */ void HanoiWithAdj(char from, char aux, char to, int n){

7. Write the postfix form of the following expressions: A/(B-C)+D*((E-A)*C/F) : ________________________ ( 3 points)

8. Given a two dimentional array X[][],each element in X is 4 byte. Suppose the address of X[2][3] = 7476, the address of X[5][2] = 7532. Please caculate the address of X[3][4] = _________________ ( 3 points)

9. Given a postorder sequence "ABCDEFG" and the inorder sequence "BAGCEDF" of the same binary tree. Find the preorder sequence of the tree: _____________ ( 3 points)

114年 - 114 新北市公立高級中等學校_教師聯合甄選試題：資訊科技科#129033

114年 - 114 臺南市市立國民中學_正式教師聯合甄選試題：資訊科技專門科目#128069

114年 - 114 桃園市國民中學新進教師聯合甄選試題：資訊科技科#127897

114年 - 114 中區縣市政府策略聯盟教師甄選：國中資訊科技#127548

114年 - 114 臺北市市立國民中學正式教師聯合甄選：資訊科技科#127510

114年 - 114 基隆市市立中山、安樂、八斗高級中學_教師甄選試題：資訊科技科#127291

114年 - 114 新北市立國民中學_教師聯合甄選試題：資訊科技科#127263

114年 - 114 臺北市公立國民小學教師聯合甄選初試專門類科知能試題﹕資訊科技科#127125

114年 - 114-1 新竹縣立湖口高中_教師甄選試題﹕資訊科技科#127023

114年 - 114 新竹市立香山高級中學_教師甄選試題：高中資訊科技#126975