2. Let a, b and c are variables. Which of the following is a postfix expression?

(A) a/(b + c)；

(B) xabc/+；

(C) abc + /；

(D) /a + bc.

3. Let a = 3, b = 8, c = 6 and d = 5. What is the value of the prefix expression × ba + dc?(A) 13；(B) 14；(C) 15；(D) 16.

4. The ADT stack can be defined by the following axioms:(aStack.createStack()).isEmpty() = true(aStack.push(item)).isEmpty() = false(aStack.createStack()).pop() = error(aStack.createStack()).getTop() = error(aStack.push(item)).getTop() = item(aStack.push(item)).pop() = aStackFor the following expression:(((((((aStack.createStack()).push(1)).push(2)).pop()).push(3)).pop()).pop()).isEmpty()what is the value returned?(A) an item；(B) a stack；(C) true；(D) false.

5. Suppose a stack is implemented by a variable top and an array B[4]. Note that top denotes the index of the last element pushed. Initially, the stack is empty. Then the following operations are performed in order:push(1), push(2), pop(), push(3), push(4), pop(), getTop(), push(5), pop(), push(6).Which of the following is true in the end?(A) B[0] = 3；(B) B contains 4 integers available；(C) An overflow occurred, so the operations could not be completely done；(D) top is 2.

6. Let the height of a tree be the number of nodes along the longest path from the root node to the leaf nodes. Consider the integers 30, 41, 25, 29, 94, 37, 70, 23, 65, 75, 68, 67 in order to create a binary search tree. Which of the following is true?(A) The node for 37 is a leaf node；(B) The root node is 41；(C) The node for 70 has only one child；(D) The height of the tree is 5.

7. Consider a complete binary tree with exactly 5000 nodes, implemented with an array starting from index 0. Suppose that a node has its value stored at index 999 in the array. What index is the value stored at for this node's left child?(A) 999；(B) 1999；(C) 998；(D)2998.

8. Consider a tree with A as the root node. The left and right child of A are B and C, respectively. The left and right child of B are D and E, respectively. The left and right child of E are F and G. What is the order of the nodes processed in the pre-order traversal?(A) A-B-E-D-F-G-C；(B) D-B-F-E-A-G-C；(C) A-B-D-G-F-E-C；(D) A-B-D-E-F-G-C.

9. Suppose we start with an empty max-heap of integers, and enter the numbers 20 through 30 into this heap in order. Let the resulting max-heap be stored in an array. What index is 28 stored at in the array?(A) 2；(B) 3；(C) 4；(D) 5.

10. Suppose we start with an empty max-heap of integers, and enter the numbers 20 through 30 into this heap in order. Let the resulting max-heap be stored in an array. Then remove the root node from the heap. What index is 28 stored at in the array?(A) 4；(B) 3；(C) 2；(D) 1.

11. An empty hash table has a capacity of 13, and you insert six entries with keys 21, 16, 8, 10, 22, 34, and 49. Using linear probing and the hash function 1%(13), what index 49 is stored at in the table? Note that % is the remainder operator, e.g., (100)%(13)=9.(A) 0；(B) 5；(C) 11；(D) 8.

12. Consider the integers 30, 41, 25, 29, 94, 37, 70, 23, 65, 75, 68, 67 in order to create an AVL tree. Which of the following about the tree is false?(A) The node for 37 is a leaf node.(B) The root node is 41.(C) The node for 70 has only one child.(D) The height of the tree is 4.

110年 - 110 國立中山大學_碩士班招生考試_電機系(戊組)、通訊所(乙組)、電波聯合：電磁學#105515

109年 - 108 國立中山大學_碩士班招生考試_電機系(甲、戊、己組)：工程數學甲#125234

109年 - 108 國立中山大學_碩士班招生考試_電機系(甲組)：電子學#124112

109年 - 108 國立中山大學_碩士班招生考試_電機系(己組)：計算機結構#124091

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

109年 - 108 國立中山大學_碩士班招生考試_電機系(丁組)：電路學#124085

109年 - 108 國立中山大學_碩士班招生考試_電機系(甲組)：半導體概論#124080

108年 - 108 國立中山大學_碩士班招生考試_電機系(戊組)、電波領域：電磁學#108273

107年 - 107 國立中山大學_碩士班招生考試_電機系(戊組)、通訊所(乙組)、電波領域：電磁學#110172

106年 - 106 國立中山大學_碩士班招生考試_電機系(戊組)、電波領域：電磁學#110197