ewshiawuglawehsar

0.0(0)
studied byStudied by 0 people
0.0(0)
call with kaiCall with Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/18

encourage image

There's no tags or description

Looks like no tags are added yet.

Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No study sessions yet.

19 Terms

1
New cards

problem

A general description of a task that may (or may not) be solved algorithmically

2
New cards

instance 

One case of a problem with specific inputs

3
New cards

decision problem

A type of problem with a true/false answer

4
New cards

optimization problem

A problem with the goal of finding the best solution among many

5
New cards

sequential computing

A computational model in which operations are performed in order one at a time

6
New cards

parallel computing

A computational model in which the problem is broken into smaller steps, some of which are performed at the same time

7
New cards

distributed computing

A form of parallel computing that uses multiple computers, perhaps even spread out around the world

8
New cards

processor

A piece of circuitry inside a computer that processes the instructions from computer programs

9
New cards

speedup

How many times as fast the parallel solution is compared to the sequential solution

10
New cards

simulation

Computer representations of real things or situations that vary over time

11
New cards

linear time 

How long an algorithm takes if the number of steps is proportional to the input size

12
New cards

linear search 

An algorithm that searches a list by checking each element of a list in order, also called a sequential search

13
New cards

binary search 

An algorithm that starts a search in the middle of a sorted list and repeatedly eliminates half the list until either the desired value is found or all elements have been eliminated

14
New cards

efficiency

The relationship between the input size and the number of steps required to solve a problem

15
New cards

sublinear time 

How long an algorithm takes if the number of steps grows more slowly than the size of the input

16
New cards

constant time 

How long an algorithm takes if it takes the same number of steps regardless of input size

17
New cards

quadratic time 

How long an algorithm takes if the number of steps is proportional to the square of the input size

18
New cards

polynomial time 

How long an algorithm takes if the number of steps is less than or equal to a power of the size of the input

19
New cards

exponential time 

How long an algorithm takes if the number of steps is proportional to an exponential function of the size of the input, such as 2n, 10n, etc.