Classification Of Algorithms

Question 1

What has to be allocated to algorithms

Answer 1

Time and space

Question 2

Time complexity of a
Binary search

Answer 2

O Log(n)

Question 3

Time complexity of a
Linear search

Answer 3

O (n)

Question 4

Time complexity of a
Bubble sort

Answer 4

O (n)^2

Question 5

Time complexity of a
Merge sort

Answer 5

O (nlog(n))

Question 6

Time complexity for exonential

Answer 6

O a^n

Question 7

What is set of possible inputs for a function

Answer 7

Domain

Question 8

What is all the possible outcomes of a function

Answer 8

Range

Question 9

What is a function

Answer 9

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

Question 10

What are Hueristics

Answer 10

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

Question 11

When is a problem computable

Answer 11

If it can be solved using an algorithm.

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

Question 12

What is the halting problem

Answer 12

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

Question 13

What is the co-domain

Answer 13

It is the possible outputs of a function.