AQA A Level: 4.4.1 Abstraction

What is the definition of: Algorithm

• “Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

• “The process of separating ideas from specific instances of those ideas at work. Computational structures are defined by their meanings while hiding away the details of how they work."

• “A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

• “The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method"

What is the definition of: Pseudocode

• “Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

• “Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

• “A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

• “The reduction of a particular body of data to a simplified representation of the whole. For example, a stack could be implemented as an array and a pointer for the top of the stack.”

What is the definition of: Test data

• “Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

• “Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

• “A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

• “Data which has been specifically identified for use in testing a computer program.”

What is the definition of: Abstraction

• “Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

• “Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

• “A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

• “The process of separating ideas from specific instances of those ideas at work. Computational structures are defined by their meanings while hiding away the details of how they work."

What is the definition of: Procedural abstraction

• “Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

• “Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

• “A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

• “The process of separating ideas from specific instances of those ideas at work. Computational structures are defined by their meanings while hiding away the details of how they work."

What is the definition of: Functional abstraction

• “Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

• “A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

• “The process of separating ideas from specific instances of those ideas at work. Computational structures are defined by their meanings while hiding away the details of how they work."

• “The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method."

What is the definition of: Data abstraction

• “Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

• “A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

• “The reduction of a particular body of data to a simplified representation of the whole. For example, a stack could be implemented as an array and a pointer for the top of the stack.”

• “The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method."

What is the definition of: Problem abstraction

• “Removing details from a problem until it can be represented in a way that is possible to solve because the problem reduces to one that has already been solved.”

• “A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

• “The reduction of a particular body of data to a simplified representation of the whole. For example, a stack could be implemented as an array and a pointer for the top of the stack.”

• “The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method."

What is the definition of: Decomposition

• “Removing details from a problem until it can be represented in a way that is possible to solve because the problem reduces to one that has already been solved.”

• “The process by which a complex problem or system is broken down into parts that are easier to conceive, understand, program and maintain.”

• “The reduction of a particular body of data to a simplified representation of the whole. For example, a stack could be implemented as an array and a pointer for the top of the stack.”

• “The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method."

What is the definition of: Composition

• “Removing details from a problem until it can be represented in a way that is possible to solve because the problem reduces to one that has already been solved.”

• “The process by which a complex problem or system is broken down into parts that are easier to conceive, understand, program and maintain.”

• “The process of building a composition abstraction by combining procedures to form new compound procedures.”

• “The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method."