• Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

Card Range To Study

through

image

Play button

image

Play button

image

Progress

1/20

Click to flip

Use LEFT and RIGHT arrow keys to navigate between flashcards;

Use UP and DOWN arrow keys to flip the card;

H to show hint;

A reads text to speech;

20 Cards in this Set

  • Front
  • Back
Algorithm
Any well defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output
Input
Value or set of values given to an algorithm
Output
Value or set of values yielded from an algorithm
Computational Problem
A problem that specifies in general terms the desired input / output relationship
Instance
An example of input for a problem
Shortest path problem
Given an origin and destination, respond with the shortest route to get to the destination
Traveling salesman problem
Given there are many vehicles to travel to many locations, respond with the shortest route for all vehicles so that each destination is met, and have the vehicles return back to the original location
Merge sort
A sorting algorithm that uses a divide and conquer approach
Insertion sort
A sorting algorithm that uses an incremental approach
Subsequences
A sequence of an original sequence with some or no elements removed
Master method
A very common method to solve algorithms using divide and conquer
Divide & Conquer
A technique to divide computations into smaller computations in order to reduce the number of computations needed to yield the results
Dynamic programming
A general technique to solve algorithms with large data sets
Convex hull
The smallest convex polygon containing points of a plane
Plane
A flat surface with data points
Data structure
A way to store and organize data in order to facilitate access and modifications
NP-Complete problems
A problem in which no efficient solution is known
Computational Procedure
Specific technicaly defined steps for achieving an input / output relationship
Convex
Having an outline or surface curved like the exterior of a circle or sphere
Convex polygon
Having only interior angles measuring less than 180 degrees