Computational Theory and Mathematics Flashcards

1
Q

Decomposition

A

Breaking a large problem into smaller ones.
Could be modelling code - design phase
Or code decomposition where you break clunky code into smaller bits

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

Pattern Recognition

A

finding similarities or patterns amongst decomposed problems

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

Abstraction

A

The quality of dealing with ideas rather than events

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

Algorithims

A

A process or set of rules to be followed in calculation or other problem solving operation.

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

Sorting algorithm

A

use to rearrange a given array according to the comparison operator
Comparison operator used to determine the new order

bubble/insertion/quick sort

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

Search algorithm

A

used to check or retrieve and element from a data structure
Binary search
breath-first search
deep-first search

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

Search algorithm - sequential search

A

array or list is traversed sequentially and every element is checked

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

Search algorithm - interval search

A

designed to search sorted data structures

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

Shortest Path algorithm

A

finding shortest path between nodes in a graph

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

Math algorithm

A

a description of a set of steps that can be used to solve mathematical computation

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

Recursive algorithm

A

a function which calls itself is recursion, that corresponding function is the recursive function.

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

Dynamic programming algorithm

A

solving an optimization problem by breaking into down into simple sub problems.

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

Backtracking algorithm

A

Solving problems one by one in order to reach the best possible solution

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

Bruteforce Algorithm

A

Sorting algorithm

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

Randomised algorithm

A

employs a degree of randomness as part of the logic

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

Greedy Algorithm

A

Makes optimal choice at each step as it attempts to find the overall optimal way.
Huffman encoding
Dijkstra’s algorithm

17
Q

Divide and Conquer

A

dividing problem into sub problems, conquer sub problem recursively till solved. Combine: sub problem solved so we get solution