Aqa Gcse Computer Science Paper 1 Study Guide Rated A+

Define algorithm {Ans: An algorithm is a sequence of steps that can be followed to complete a task.}How does a binary search work? {Ans: First the middle element is compared to the value. If the value is found the search returns true. However if the value is smaller than the middle element then delete the second half and vice versa. Search the middle value of the shorter list and repeat the previous processes.}Define parameter {Ans: A variable that a subroutine requires in order to run}How does a linear search of an array work? {Ans: The search begins with the first element and it is compared to the value being searched for. The search iterates over the elements sequentially. The search returns true if the value is found in the array.}Define subroutine (subprogram) {Ans: A subroutine is an 'out of line' block of code that performs a specific task}Define decomposition {Ans: Decomposition means breaking a problem into a number of sub-problems, so that each subproblem accomplishes an identifiable task, which might itself be further subdivided.}Define abstraction {Ans: Abstraction is the process of removing unnecessary detail from a problem.}