📚 A-Level Computer Science: Programming Fundamentals Exam Essentials | A-Level 计算机：编程基础 考点精讲
Mastering programming fundamentals is essential for A-Level Computer Science. This article breaks down key concepts, from variables and control structures to functions, data structures, and programming paradigms. Each section is paired with clear English explanations and Chinese translations, helping you build a robust foundation for exam success.
掌握编程基础是 A-Level 计算机科学的核心要求。本文拆解了从变量、控制结构，到函数、数据结构及编程范式等关键概念。每节均配有清晰的英文说明与中文翻译，助你构建扎实的考试基础。
1. Data Types and Variables | 数据类型与变量
In programming, data types define the kind of data a variable can hold. Common primitive types include integer, real (float/double), Boolean, character, and string. Variables are named memory locations whose values can change during execution; constants hold fixed values. Understanding scope – local vs global – and type casting (implicit and explicit) is critical for writing correct code.
在编程中，数据类型定义了变量可存储的数据种类。常见的基本类型有整型、实型（浮点数/双精度）、布尔型、字符型和字符串。变量是命名的内存位置，其值可在执行期间改变；常量则持有固定值。理解作用域（局部与全局）以及类型转换（隐式和显式）对编写正确代码至关重要。
2. Operators and Expressions | 运算符与表达式
Operators perform actions on operands. Arithmetic operators (+, -, *, /, MOD, DIV) handle calculations; relational operators (=, <>, <, >, <=, >=) compare values and return Boolean results; logical operators (AND, OR, NOT) combine Boolean expressions. Be aware of operator precedence – the order in which operations are evaluated. Expressions are combinations of values, operators, and function calls that reduce to a single value.
运算符对操作数执行操作。算术运算符（+、-、*、/、MOD、DIV）处理计算；关系运算符（=、<>、<、>、<=、>=）比较值并返回布尔结果；逻辑运算符（AND、OR、NOT）组合布尔表达式。需注意运算符优先级——即运算执行的顺序。表达式是由值、运算符和函数调用组成的组合，最终求值为一个单一值。
3. Sequence, Selection, Iteration | 顺序、选择与迭代
All programs are built from three control structures. Sequence executes instructions line by line. Selection (IF…THEN…ELSE…ENDIF, CASE/SWITCH) allows decision making based on conditions. Iteration repeats a block of code: definite loops (FOR…NEXT) run a known number of times; indefinite loops (WHILE…ENDWHILE, REPEAT…UNTIL) run while a condition is true. Nested structures enable complex logic.
所有程序均由三种控制结构构建。顺序按行执行指令。选择结构（IF…THEN…ELSE…ENDIF、CASE/SWITCH）允许基于条件进行决策。迭代结构重复执行代码块：计数循环（FOR…NEXT）运行已知次数；条件循环（WHILE…ENDWHILE、REPEAT…UNTIL）在条件为真时运行。嵌套结构可实现复杂逻辑。
4. Functions and Procedures | 函数与过程
Both functions and procedures are named blocks of code that perform a specific task, promoting modularity and reuse. The key difference: a function returns a value, while a procedure does not. In some languages, a procedure is a function returning void. Defining and calling subroutines correctly, along with understanding return types and stack frames, is fundamental.
函数和过程都是执行特定任务的命名代码块，有助于实现模块化和重用。关键区别在于：函数返回一个值，而过程不返回值。在某些语言中，过程就是返回 void 的函数。正确定义和调用子程序，以及理解返回类型和栈帧，是基础要求。
5. Parameter Passing | 参数传递
Parameters allow data to be passed into subroutines. Passing by value sends a copy; changes inside the subroutine do not affect the original variable. Passing by reference (or by address) sends the memory address, so changes do affect the original. Some languages use by value by default for primitive types and by reference for objects. Understanding this protects against side effects.
参数允许数据传入子程序。传值调用传递副本，子程序内部的更改不会影响原变量。传引用调用（或传地址）传递内存地址，因此更改会影响原变量。某些语言默认对基本类型使用传值，对对象使用传引用。理解这一点有助于防止副作用。
6. Arrays and Lists | 数组与列表
Arrays store multiple values of the same type in contiguous memory locations, accessed via an index (usually zero-based). One-dimensional arrays represent lists; two-dimensional arrays model tables or grids. Dynamic structures like lists or ArrayLists can grow and shrink. Key operations include traversal, insertion, deletion, searching (linear, binary) and sorting (bubble, insertion).
数组在连续的内存位置中存储多个相同类型的值，通过索引（通常从零开始）访问。一维数组表示列表；二维数组模拟表格或网格。列表或 ArrayList 等动态结构可以增长和收缩。关键操作包括遍历、插入、删除、搜索（线性、二分）和排序（冒泡、插入）。
7. String Manipulation | 字符串处理
Strings are sequences of characters. Common operations include concatenation, substring extraction, finding length, character access, case conversion, trimming whitespace, and pattern matching. In pseudocode, functions like LEFT, RIGHT, MID, LENGTH, POSITION are often used. Real-world text processing, like validation and formatting, depends on these routines.
字符串是字符序列。常见操作包括连接、子串提取、求长度、字符访问、大小写转换、去除空白和模式匹配。在伪代码中，常使用 LEFT、RIGHT、MID、LENGTH、POSITION 等函数。验证和格式化等实际文本处理依赖于这些例程。
8. File Handling | 文件处理
Programs read from and write to files for persistent storage. Typical steps: open a file (with mode read, write, append), process data using loops, then close the file. Text files store human-readable characters; binary files store data in machine-readable form. Error handling for missing files or end-of-file (EOF) conditions is essential for robust programs.
程序通过读写文件实现持久化存储。典型步骤：打开文件（模式为读、写、追加），用循环处理数据，然后关闭文件。文本文件存储人类可读字符；二进制文件以机器可读形式存储。处理文件缺失或文件结束（EOF）等错误的机制对健壮的程序至关重要。
9. Object-Oriented Programming Basics | 面向对象编程基础
OOP models real-world entities using classes and objects. A class is a blueprint defining attributes (fields) and methods. An object is an instance of a class. Key principles include encapsulation (hiding internal state), inheritance (deriving new classes from existing ones), and polymorphism (methods with the same name behaving differently based on context). Constructors initialize new objects.
面向对象编程使用类和对象对现实世界实体建模。类是定义属性（字段）和方法（函数）的蓝图。对象是类的实例。核心原则包括封装（隐藏内部状态）、继承（从现有类派生新类）和多态（同名方法根据上下文表现不同行为）。构造函数用于初始化新对象。
10. Recursion | 递归
A recursive subroutine calls itself to solve a smaller version of the same problem. Every recursive algorithm must have a base case (stopping condition) and a recursive step that moves toward the base case. Classic examples include factorial, Fibonacci, and tree traversal. Recursion can elegantly express solutions but may consume more memory due to call stack usage.
递归子程序通过调用自身解决同一问题的更小版本来工作。每个递归算法必须有一个基本情况（停止条件）和一个朝基本情况推进的递归步骤。经典示例包括阶乘、斐波那契和树的遍历。递归能优雅地表达解决方案，但因调用栈的占用可能消耗更多内存。
11. Testing and Debugging | 测试与调试
Testing ensures a program meets its specification. Types include white-box (testing internal logic, paths), black-box (testing inputs against expected outputs), and boundary testing (edge cases). Debugging is the process of finding and fixing errors: syntax errors (typos, missing symbols), runtime errors (division by zero, null pointer), and logic errors (incorrect algorithm). Trace tables help track variable changes step by step.
测试确保程序符合其规格说明。类型包括白盒测试（测试内部逻辑和路径）、黑盒测试（根据预期输出测试输入）和边界测试（边缘情形）。调试是找出并修复错误的过程：语法错误（拼写错误、缺失符号）、运行时错误（除以零、空指针）和逻辑错误（算法错误）。跟踪表有助于逐步追踪变量变化。
12. Algorithms and Pseudocode | 算法与伪代码
An algorithm is a step-by-step procedure to solve a problem. Pseudocode uses structured English-like notation to describe algorithms without language-specific syntax. Common constructs include INPUT, OUTPUT, SET, IF…THEN…ELSE, WHILE…DO, FOR…TO…NEXT. Efficiency is evaluated through time and space complexity, often expressed using Big O notation, e.g., O(n), O(n²), O(log n).
算法是解决问题的逐步过程。伪代码使用类似英语的结构化符号描述算法，无需特定语言语法。常见结构包括 INPUT、OUTPUT、SET、IF…THEN…ELSE、WHILE…DO、FOR…TO…NEXT。效率通过时间复杂度和空间复杂度评估，通常用大 O 表示法表达，如 O(n)、O(n²)、O(log n)。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导