4.4 - Theory of computation Flashcards

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

What is information hiding?

A

Information hiding is part of abstraction, it involves removing unnecessary information which isn’t relevant to the current problem.

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

What is procedural abstraction?

A

A type of abstraction applied in programming where you take a procedure and remove parts of it so that the procedure is more generalized, it can then be used in multiple scenarios instead of just one.

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

What is functional abstraction?

A

A type of abstraction applied in programming in which functions are separated from the main working program, meaning you don’t need to know how a function works to be able to use it, you give the function the required inputs and it returns the outputs.

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

What is problem/representational abstraction?

A

Problem abstraction is applied by breaking down a problem and using information hiding and decomposition to remove unnecessary data from the problem which makes it easier to solve.

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

Examples of problem abstraction?

A

For example finding the shortest path for a data packet, you won’t need to know the type of cable, if the cable is in the sea or land…

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

What is decomposition?

A

Decomposition is the first step of problem abstraction, taking a problem and breaking it down into smaller parts to allow you to solve each part individually or decide if it is necessary to solve.

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

What is composition?

A

This is the process of building the solution from the individually solved parts to create a full solution to a certain problem.

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

Example of a problem where abstraction can be applied?

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

What is automation?

A

The process of modelling a problem to predict future changes.

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

Example of automation?

A

You can create a model to predict climate change by modelling the rate of C02 increase in the atmosphere.

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

What are the metacharacters in regular expression and what do they mean?

A
  • (0 or more repetitions)
    + (1 or more repetitions)
    ? (0 or 1 repetitions)
    | (or)
    ( ) to group regular expressions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How is regular expression and FSM related?

A

Regular expressions and FSMs are equivalent ways of defining a regular language.

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

How is Backus-Naur form represented?

A

<digit> -> 0|1|2|3|4|5|6|7|8|9
<natural> -> <digit>|<digit><natural>

This represents any natural number, where a digit is defined by the numbers 0-9 and it uses recursion to represent any length of these digits.
</natural></digit></digit></natural></digit>

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

What is a tractable problem?

A

Problems that have a polynomial (or less) time solution.

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

What is an intractable problem?

A

Problems that do not have a polynomial (or less) time solution. Heuristic techniques are used to solve these problems.

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

What is the halting problem?

A

This states that there are some problems that cannot be solved by a computer.

17
Q

What is a set?

A

A set is an unordered collection of values with no duplicates.

18
Q

Difference between a proper subset and a non-proper subset?

A

Proper subset means items in one set are all part of the original set but not all of the values e.g {0, 1, 2, 3} is a subset of {0, 1, 2, 3, 4}. A non-proper subset would be {0, 1, 2, 3} is a subset of {0, 1, 2, 3}

19
Q

What is cardinality of a set?

A

Cardinality means the number of elements in the set.

20
Q

What is the symbol for difference between two sets?

A

\ or -

21
Q

What is the symbol for union of two sets?

A

U

22
Q

What is the symbol for intersection of two sets?

A

n

23
Q

What is the regular expression symbol for 0 or 1?

A

?

24
Q

What is the regular expression symbol for 1 or more?

A

+

25
Q

What is the regular expression symbol for 0 or more?

A

*

26
Q

What is the regular expression symbol for an altercation (or)?

A

|

27
Q

What does a double circle mean on an FSM?

A

Accepting state

28
Q

What steps would you take to solve an intractable problem?

A

Use a heuristic. Break down the problem/Solve a simpler version of the problem.

29
Q

What is a universal Turing Machine?

A

A Turing machine which can compute any computable sequence.

30
Q

What is abstraction by generalisation?

A

Grouping by common characteristics.