📚 A-Level CIE Computer Science: Calculation Practice | A-Level CIE 计算机：计算题专项训练
Mastering calculation-based problems is essential for success in the CIE A-Level Computer Science examinations. From number systems and Boolean algebra to assembly language and network addressing, numerical precision and logical steps are key. This article brings together the most common calculation question types with clear examples and bilingual explanations.
掌握计算题是 CIE A-Level 计算机科学考试取得高分的关键。从数制转换、布尔代数到汇编语言与网络地址划分，数值计算与逻辑步骤至关重要。本文汇总了最常见的计算题型，辅以清晰的示例和双语解析。
1. Number System Conversions | 进制转换
de by 2 and record remainders: 202 ÷ 2 = 101 R0, 101 ÷ 2 = 50 R1, 50 ÷ 2 = 25 R0, 25 ÷ 2 = 12 R1, 12 ÷ 2 = 6 R0, 6 ÷ 2 = 3 R0, 3 ÷ 2 = 1 R1, 1 ÷ 2 = 0 R1. Reading remainders from bottom to top gives 11001010₂.
十进制、二进制、十六进制与八进制之间的转换是常考题型。例如，将十进制数 202 转换为二进制，不断除以 2 并记录余数：202 ÷ 2 = 101 余 0，101 ÷ 2 = 50 余 1，50 ÷ 2 = 25 余 0，25 ÷ 2 = 12 余 1，12 ÷ 2 = 6 余 0，6 ÷ 2 = 3 余 0，3 ÷ 2 = 1 余 1，1 ÷ 2 = 0 余 1。从下往上读取余数得到 11001010₂。
xadecimal, group bits into nibbles (4 bits): 1101 1010. 1101₂ = D, 1010₂ = A, giving DA₁₆.
将二进制 11011010₂ 转换为十六进制，先划分为四位一组：1101 1010。1101₂ = D，1010₂ = A，结果为 DA₁₆。
Example: 3F2₁₆ → 0011 1111 0010₂
示例：3F2₁₆ → 001111110010₂
2. Binary Arithmetic and Two's Complement | 二进制算术与补码表示
: 1+0=1; 1+1=10, write 0 carry 1; 0+1+carry=10, write 0 carry 1; 1+0+carry=10, write 0 carry 1; final carry gives 1, so result 10001.
无符号二进制数加法与十进制类似，但满 2 进 1
Published by TutorHao | A-Level Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图