Activities
1.1 Planning and System Installation - Exercises
1. A software company has been asked by a warehouse manager to design a computer system that allows them to mange stock, suppliers, customers and deliveries. the first step the software company want to...
Activities
1.1 Harkness discussion: Planning and system installation
Read through the 1.1 Planning and system installation page in the eBook. Bring your research around any of the areas. It is good to find real-life examples for each subsection where relevant as this...
Activities
Paper 3: Sample B
One of a series of sample Paper 3 exams. Computer Science Higher Level Paper 3Duration: 1 hourInstructions to Candidates: 1. Latency and Processing Power a. Define the term "critical path" in the context...
Activities
Paper 3: Sample A
One of a series of sample Paper 3 exams. Computer Science Higher Level Paper 3Duration: 1 hourInstructions to Candidates: 1. Latencya. Define the term latency in the context of a chatbot. [2 marks]b....
Activities
1.1 User Focus - Exercises
1. Choose a real-life example of user documentation. (Online manual / digital manual (pdf) / embedded assistance / FAQ) a) For your chosen documentation answer the following questions: b) Rate each...
Activities
Paper 3: Sample B - Markscheme
Markscheme for the series of sample Paper 3 exams. 1. Latency and Processing Power a. "Critical path" refers to the shortest and most efficient sequence of linked machine learning models required to...
Activities
Paper 3: Sample A - Markscheme
Markscheme for the series of sample Paper 3 exams. 1. Latencya. Latency refers to the time delay between a user's input to the chatbot and the chatbot's response. [2 marks] b. Methods to reduce latency...
Activities
Pseudocode 9: Queues
In computer science, a queue is a fundamental data structure that follows the First-In-First-Out (FIFO) principle. This means that the first element added to the queue will be the first one to be removed....
Activities
Pseudocode 8: Stacks
In computer science, a stack is a fundamental data structure that operates on the Last-In-First-Out (LIFO) principle. This means that the most recently added element is the first one to be removed. They...
Activities
Pseudocode 7: 2D Arrays
In computer science, a 2D array (two-dimensional array) is a data structure that organizes elements in a grid-like format with rows and columns Each element in the array is accessed using two indices:...