Other Stuff I don't know 😭 Flashcards
(45 cards)
Physical Computing Innovation
An object that uses computing to operate.
Non-Physical Computing Software
A digital program/tool without a physical form (ex. photo editing software).
Non-Physical Computing Concept
An idea or system that relies on computing but isn’t a specific device or app( ex. e-commerce).
Iterative Development Process
A process that involves repeating phases, by revising and refining the program based on feedback, testing, and reflection.
Incremental Developmental Process
A method that breaks down a problem into smaller parts, ensuring each part works before combining them into the full solution.
Modular Design
Breaking a program into independent parts (modules/components), each with a specific function.
User Interface (UI) Layout
The arrangement of elements that users interact with. (Ex. buttons, menus, forms,ect.)
Data Cleaning
The process of correcting or standardizing data without changing its meaning.
Uniform Data
Data following a consistent format, style, or structure.
Visualization Tools
Graphs, charts, tables, diagrams, or text used to communicate knowledge from data analysis.
Data Filtering Systems
Tools or processes that remove unnecessary or irrelevant data to reveal patterns or to simplify analysis.
Software Library
Contains procedures and code segments that could by used in creating new programs.
Application program interfaces (API’s)
Specification for hoe procedures in a library should behave and how they should be used.
Documentation for an API/library
Necessary in understanding the behaviors provided by the API/library and how to use them.
Simulations
Abstractions of more complex objects or phenomena for a specific purpose. Its is a representation that uses varying sets of values to reflect the changing state of a phenomenon.
Problem
A general description of a task that can(or cannot) be solved algorithmically.
Instance (of a problem)
An instance of a problem is a specific input. Ex. for a sorting problem, (2,3,1,7) is a specific instance.
Decision problem
A problem with a yes/no answer.
Optimization problem
A problem with the goal of finding the “best” solution among many.
WHAT ARE POLYNOMIAL ALGORITHMS THAT RUN IN A REASONABLE TIME?
Constant, Linear, Square, Cube, ect.
WHAT ARE POLYNOMIAL ALGORITHMS THAT RUN IN A UNREASONABLE TIME?
Exponential (5^x) or Factorial (x!)
Heuristic
An approach to a problem that produces a solution that isn’t guaranteed to be optimal. Typically used in algorithms that run in a unreasonable time.
Decidable problem
A decision problem for which an algorithm can be written to produce a correct output for all inputs. Ex. “Is this number even?”
Undecidable problem
When no algorithm can be constructed that is ALWAYS capable of providing a correct yes-or-no answer. Some instances may have a algorithmic solution, but no algorithmic solution that could solve all instances of the problem.