4.4 Theory of Computation Flashcards

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

What is representational abstraction?

A

A representation arrived at by removing unnecessary details

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

What is abstraction by generalisation?

A

Grouping by common characteristics to arrive at a hierarchical relationship of the ‘…is a kind of…’ type.

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

What is procedural abstraction?

A

The result of abstracting away actual values to create a computational method, a procedure.

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

What is functional abstraction?

A

A further abstraction of a functional abstraction, which disregards the particular computational method.

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

Why do we use data abstraction?

A

It enables us to isolate how a compound data object is used from the details of how it is constructed.

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

What is problem abstraction?

A

Removing details until the problem solves itself.

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

What is decomposition?

A

Breaking a problem into a number of sub problems so that each sub problem accomplishes an identifiable task.

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

What are the metacharacters used in regular expressions?

A
*   0 or more repetitions
\+   1 or more repetitions
?   0 or 1 repetitions
     ie, optional
|    alternation
     ie or
( )  to group regular 
     expressions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the purpose of BNF?

A

To describe a programming language in a simple and concise manner

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