SLR6 Abstraction and automation Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Algorithm

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Pseudocode

A

“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.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Test data

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Abstraction

A

“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.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Procedural abstraction

A

“Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed. A simple example is a debit operation that performs various steps to debit a certain amount from a bank account.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Functional abstraction

A

“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; this is functional abstraction.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Data abstraction

A

“The reduction of a particular body ofdatato 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.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Problem abstraction

A

“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.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Decomposition

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Composition

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

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

A

Algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

“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.”

A

Pseudocode

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

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

A

Test data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

“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

Abstraction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

“Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed. A simple example is a debit operation that performs various steps to debit a certain amount from a bank account.”

A

Procedural abstraction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

“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; this is functional abstraction.”

A

Functional abstraction

17
Q

“The reduction of a particular body ofdatato 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.”

A

Data abstraction

18
Q

“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

Problem abstraction

19
Q

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

A

Decomposition

20
Q

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

A

Composition