Limits of computation

Limits of computation

Assessment

Assessment

Created by

Mark Gadsby

Computers

12th Grade

1 plays

Easy

5 questions

Show all answers

1.

OPEN ENDED

3 mins • 1 pt

Describe what a heuristic method is.

2.

OPEN ENDED

3 mins • 1 pt

Describe what an intractable problem is.

3.

OPEN ENDED

3 mins • 1 pt

Why is it that Dijkstra's shortest path algorithm can be described as accurate, optimal and complete?

4.

OPEN ENDED

3 mins • 1 pt

Under which circumstances is it possible to solve an intractable problem with a computer?

5.

OPEN ENDED

3 mins • 1 pt

What do these time complexities all have in common O(1), O(log n), O(n), O(n log n) & O(n2)