Create better lessons quicker
Create Activity
Log In
Sign Up
English
Home
Features
Price Plans
Community
Home
Features
Community
Contact
Price Plans
Log In
Sign Up
Language
My school
My Profile Page
Edit personal details
Language and Location
Log Out
Català
Cebuano
Čeština
Dansk
Deutsch
Eesti keel
English
Español
Français
Hrvatski
Indonesia
Italiano
Latvian
Lietuvių
Magyar
Melayu
Nederlands
Norsk
Polski
Português
Română
Slovenčina
Slovenščina
Srpski
Suomi
Svenska
Tagalog
Türkçe
Vietnamese
ελληνικά
български
Русский
Српски
Українська
עִברִית
عربى
हिंदी
ગુજરાતી
ภาษาไทย
한국어
日本語
简体字
繁體字
Problem - a general description of a task that can (or cannot) be solved with an algorithm, Algorithm - a finite set of instructions that accomplish a task., Efficiency - a measure of how many steps are needed to complete an algorithm, Linear Search - a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked., Binary Search - a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated., Reasonable Time - Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time., Unreasonable Time - Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time., Heuristic - provides a "good enough" solution to a problem when an actual solution is impractical or impossible, Undecidable Problem - a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer, Sequential Computing - a model in which programs run in order, one command at a time., Parallel Computing - a model in which programs are broken into small pieces, some of which are run simultaneously, Distributed Computing - a model in which programs are run by multiple devices, Speedup - the time used to complete a task sequentially divided by the time to complete a task in parallel, Decision Problem - a problem with a yes/no answer (e.g., is there a path from A to B?), Optimization Problem - a problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?), Sequencing - the application of each step of an algorithm in the order in which the code statements are given,
14%
Unit 6 Vocabulary
Share
by
Kwendte
9th Grade
10th Grade
11th Grade
Computing
More
Edit Content
Print
Embed
Assignments
Leaderboard
Show more
Show less
This leaderboard is currently private. Click
Share
to make it public.
This leaderboard has been disabled by the resource owner.
This leaderboard is disabled as your options are different to the resource owner.
Revert Options
Match up
is an open-ended template. It does not generate scores for a leaderboard.
Log in required
Visual style
Fonts
Subscription required
Options
Switch template
Show all
More formats will appear as you play the activity.
Open results
Copy link
QR code
Delete
Continue editing:
?