📚 A-Level AQA Computer Science: Common Mistakes Explained | A-Level AQA 计算机：易错题精讲
In AQA A-Level Computer Science, even strong students often lose marks on questions that appear straightforward. Understanding common pitfalls can transform your exam performance. This article explores frequently misunderstood topics and typical exam question traps, providing detailed explanations to help you avoid these errors.
在AQA A-Level计算机科学考试中，即使成绩优秀的学生也常常在一些看似简单的题目上丢分。了解常见错误陷阱能极大提升你的考试成绩。本文深入剖析经常被误解的知识点和典型考题陷阱，提供详细讲解，帮助你避免这些错误。
1. Recursion: Missing Base Case | 递归：缺少基础情况
Many students write recursive functions without a proper base case or with a base case that is never reached, leading to infinite recursion and stack overflow errors. For example, a factorial function defined as if n == 0 return 1 else return n * factorial(n-1) is correct, but omitting the n == 0 check causes infinite calls. A typical mistake is writing factorial(n): return n * factorial(n-1).
很多学生编写递归函数时缺少正确的基础情况，或者基础情况永远无法满足，导致无限递归和堆栈溢出。例如阶乘函数定义为
Published by TutorHao | A-Level Computer Science Revision Series | aleveler.com 更多咨询请联系16621398022（同微信）如果 n == 0 返回 1 否则返回 n * factorial(n-1) 是正确的，但省略 n == 0 检查会造成无限调用。常见错误：factorial(n): 返回 n * factorial(n
或截图后用「扫一扫 → 相册」选择本图