All Flashcards
What are the differences between linear and binary search?
Linear: Checks each element sequentially, works on unsorted data | Binary: Requires sorted data, eliminates half the data with each step.
What are the differences between parameters and arguments?
Parameters: Variables in procedure definition | Arguments: Values passed when calling the procedure.
What are the differences between reasonable and unreasonable time complexity?
Reasonable: Polynomial or lower | Unreasonable: Exponential or factorial.
What are the differences between decidable and undecidable problems?
Decidable: An algorithm can always find a solution | Undecidable: No algorithm can always find a solution.
What is Data Abstraction?
Simplifying data for easier program management.
What is Procedural Abstraction?
Using a procedure without knowing its implementation details.
What is Modularity?
Dividing a program into independent modules or procedures.
What is Selection?
Choosing which code to execute based on a condition.
What is an API?
A set of rules that programs can follow to communicate.
What is a Simulation?
A simplified representation of a real-world system or process.
What is Algorithmic Efficiency?
A measure of how well an algorithm uses resources.
What is a Heuristic?
An approach that may not be optimal but is practical.
What is a Decidable Problem?
A problem for which an algorithm can always produce a solution.
What is an Undecidable Problem?
A problem for which no algorithm can always produce a solution.
What are the steps of binary search?
- Sort the data. 2. Find the middle element. 3. Compare target to middle. 4. Eliminate half the data. 5. Repeat until found or exhausted.