Classification Of Algorithms Flashcards

(13 cards)

1
Q

What has to be allocated to algorithms

A

Time and space

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

Time complexity of a
Binary search

A

O Log(n)

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

Time complexity of a
Linear search

A

O (n)

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

Time complexity of a
Bubble sort

A

O (n)^2

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

Time complexity of a
Merge sort

A

O (nlog(n))

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

Time complexity for exonential

A

O a^n

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

What is set of possible inputs for a function

A

Domain

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

What is all the possible outcomes of a function

A

Range

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

What is a function

A

Mapping that maps the set of inputs onto the set of outputs.

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

What are Hueristics

A

A rule of thumb that allows a goal to be achieved. It gives a rough value but not exact answer

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

When is a problem computable

A

If it can be solved using an algorithm.

If not is is Non computable. Can’t be solved from an algorithm

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

What is the halting problem

A

Given a program and the inputs of the program. Determine if it will halt or not depending on the inputs.

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

What is the co-domain

A

It is the possible outputs of a function.

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