Pre-U CCEA Computer Science: Cross-disciplinary Integrated Question Practice | Pre-U CCEA 计算机：跨学科综合题型训练

📚 Pre-U CCEA Computer Science: Cross-disciplinary Integrated Question Practice | Pre-U CCEA 计算机：跨学科综合题型训练

Welcome to this comprehensive guide on tackling cross-disciplinary integrated questions in the CCEA Pre-U Computer Science examination. These questions blend core computing concepts with real-world scenarios from mathematics, science, economics and beyond, testing not only your technical knowledge but also your ability to apply computational thinking in diverse contexts.

欢迎阅读本全面指南，帮助应对CCEA Pre-U计算机科学考试中的跨学科综合题型。这些题目将核心计算概念与数学、科学、经济学等领域的真实场景融合，不仅考查你的技术知识，还考查你在多样化情境中运用计算思维的能力。

1. Understanding the Cross-disciplinary Approach | 理解跨学科题型

In the Pre-U examination, you will encounter questions that require you to transfer skills across domains. For instance, a problem might ask you to model a biological process using a finite state machine, or to analyse economic data using SQL queries. The key to success is to break down the problem into known computational components and then map them to the given context.

在Pre-U考试中，你会遇到需要跨领域迁移技能的题目。例如，一道题可能会要求你用有限状态机对生物过程建模，或用SQL查询分析经济数据。成功的关键在于将问题分解为已知的计算组件，再将其映射到给定情境。

Always start by identifying the core computing topic – such as algorithms, data representation, logic, or networking – that forms the backbone of the question. Then, examine how the other discipline influences the data or the requirements. Practise drawing a concept map that links the computing pillar to the external domain, ensuring you do not overlook any domain-specific vocabulary that may carry marks.

始终从识别构成题目主线的核心计算主题入手，如算法、数据表示、逻辑或网络。然后，考察其他学科如何影响数据或需求。练习绘制概念图，将计算支柱与外部领域联系起来，确保不遗漏任何可能带来分数的领域特定词汇。

2. Mathematics & Logic: Boolean Algebra and Set Theory | 数学与逻辑：布尔代数与集合论

Mathematical logic is heavily examined in integrated questions. You might be given a set of access control rules expressed in natural language and asked to simplify them using Boolean algebra or set operations. Understanding laws such as commutativity, associativity, distributivity, absorption and De Morgan’s is essential.

数学逻辑在综合题中考查较多。你可能会得到一组用自然语言表达的访问控制规则，并被要求使用布尔代数或集合运算进行简化。理解交换律、结合律、分配律、吸收律和德摩根律至关重要。

Example question: A system grants access if a user is an admin OR (employee AND during working hours). Denote A = admin, E = employee, H = working hours. Express the rule as a Boolean expression and simplify if possible. The initial expression is A ∨ (E ∧ H). Using the absorption law, A ∨ (A ∧ B) = A, but here the bracket does not include A, so it cannot be reduced further. It is already in minimal sum-of-products form. This tests recognition of standard forms and simplification limits.

例题：如果用户是管理员 或（员工且在工作时间内），则系统授权。设 A = 管理员，E = 员工，H = 工作时间。将该规则表示为布尔表达式 A ∨ (E ∧ H)，并尝试简化。由于括号内不含A，无法进一步简化，已经是最简与或式。此题考查标准形式与化简边界的辨识。

Now apply set theory to a school database: Let S be the set of students who take Computer Science, M those who take Mathematics. In a class of 30, |S|=18, |M|=22, and |S ∩ M|=12. Use the inclusion-exclusion principle to find |S ∪ M| = 18+22−12 = 28. Therefore, 2 students take neither subject. The number taking exactly one subject is (18−12)+(22−12)=16. Such questions integrate set operations with data interpretation, a common theme.

现在将集合论应用于学校数据库：设 S 为选修计算机科学的学生集合，M 为选修数学的学生集合。某班30人，|S|=18，|M|=22，|S ∩ M|=12。利用容斥原理求 |S ∪ M| = 18+22−12 = 28。因此，2名学生两科都不选。恰好只选

Published by TutorHao | Pre-U Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）