Unit 5 Vocab
0.0(0)
Studied by 0 people
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt PlayCard Sorting
1/21
There's no tags or description
Looks like no tags are added yet.
Last updated 9:44 PM on 3/13/25
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
22 Terms
1
New cards
Procedural abstraction
Provides a name for a process and allows a procedure to be used only knowing what it does, not how it does it.
2
New cards
Modularity
The subdivision of a computer program into separate subprograms.
3
New cards
Function/Procedure
A named group of programming instructions that may have parameters and return values; also known as method or function.
4
New cards
Parameters
Input variables of a function/procedure.
5
New cards
Arguments
Specify the values of the parameters when a procedure is called.
6
New cards
Array or List
An ordered sequence of values.
7
New cards
Traversing
Accessing elements in a list, which can be complete (all elements) or partial (some elements).
8
New cards
Linear search (sequential search) algorithms
Check each element of a list, in order, until the desired value is found or all elements have been checked.
9
New cards
Binary search algorithms
Starts at the middle of a sorted data set and eliminates half of the data, repeating until the desired value is found.
10
New cards
Software library
Contains functions/procedures that may be used in creating new programs.
11
New cards
Application program interfaces (API)
Specifications for how programs, functions or procedures behave and can be used by other software.
12
New cards
Simulation
A representation that uses varying sets of values to reflect the changing state of a phenomenon.
13
New cards
Problem
A general description of a task that can (or cannot) be solved algorithmically.
14
New cards
Decision problem
A problem with a yes/no answer.
15
New cards
Optimization problem
A problem with the goal of finding the 'best' solution among many.
16
New cards
Efficiency
An estimation of the amount of computational resources used by an algorithm.
17
New cards
Reasonable amount of time
Algorithms with a polynomial efficiency or slower.
18
New cards
Unreasonable amount of time
Algorithms with exponential or factorial efficiencies.
19
New cards
Heuristic
An approach to a problem that produces a solution that is not guaranteed to be optimal.
20
New cards
Decidable problem
A decision problem for which an algorithm can be written to produce a correct output for all inputs.
21
New cards
Undecidable problem
A problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer.
22
New cards
Instance
specific input of a problem (ex; sorting is a problem; soring the list ( 2, 3, 7, 1) is an instance of the problem.
