7. Why is it a good idea to first write out an algorithm in pseudocode rather than jumping immediately to a
programming language code? (10%)

8. Given that X=AAAA16 and Y=555516, please show the results of the following hexadecimal operations, respectively. (Total 15%) (1) X AND Y (3%)

(2) X OR Y (3%)

(3) X XOR Y (3%)

(4) X + Y (3%)

(5) X − Y (3%)

9. Convert the decimal integer −43 to the following integer representations with 8-bit allocation, respectively. (Total 15%) (1) Two’s complement (5%)

(2) One’s complement (5%)

(3) Sign-and-magnitude (5%)

10. Please reply to the following questions about linked list. (Total 20%) (1) Explain why the search algorithm for a linked list can only be sequential. (5%)

(2) There are a linked list called List with two parts (data part and link part) and two pointers, pre (for previous) and cur (for current). Additionally, search is an algorithm that searches for a node with a specific value in List. If the node is found, it returns true; otherwise, it returns false. When the search stops, no matter whether the target is found, cur points to the node that stops the search and pre points to the previous node. At the beginning of the search, pre pointer is null and cur pointer points to the first node of List. If the flag returned from search is false (i.e., the node is not found), we can insert a node in List. Please show the algorithm that can be used to insert a node in List. (15%)

115年 - 115 國立嘉義大學_碩士班招生考試試題_資訊管理學系：計算機概論#143936

115年 - 115 國立嘉義大學_轉學生招生考試試題_資訊管理學系：計算機概論#143910

115年 - [無官方正解]115 國立嘉義大學_轉學生招生考試試題_資訊工程學系：計算機概論#143857

115年 - 115 中央警察大學_碩士班入學考試試題_資訊管理研究所：計算機概論#139860

114年 - 114 國立嘉義大學_碩士班招生考試試題_資訊管理學系：計算機概論#144127

114年 - [無官方正解]114 國立嘉義大學_轉學生招生考試試題_資訊工程學系：計算機概論#143763

114年 - [無官方正解]114 臺灣綜合大學系統_學士班轉學生考試試題:計算機概論#137952

114年 - [無官方正解]114 台灣聯合大學系統_學士班轉學生考試試題:計算機概論#137764

113年 - 113 國立嘉義大學_碩士班招生考試試題_資訊管理學系：計算機概論#144098

113年 - [無官方正解]113 國立嘉義大學_轉學生招生考試試題_資訊工程學系：計算機概論#143937