Module 5 Flashcards
What is Decomposition?
Decomposition is the breaking down of a complex problem into a series of smaller or simpler problems.
What is Pattern recognition?
Pattern recognition is the identification of common characteristics among different problems and within the same problem.
What is Abstraction?
Abstraction is the generalization of a problem so that a solution can be applied to different specific problems.
What are Algorithms?
Algorithms are sequences of instructions used to solve problems or perform tasks in a structured manner.
What is Sorting?
Sorting is the process of converting a list of elements into ascending (or descending) order.
What is algorithm time efficiency?
The number of calculations required to solve a problem.
What is computational complexity?
Computational complexity is the amount of resources used by the algorithm.
What is runtime complexity?
Runtime complexity is a measure of how long it takes an algorithm to run, as a function of the size of its input.
What is space complexity?
The space Complexity of an algorithm is the total space taken by the algorithm with respect to the input size
What is a hypothesis?
A hypothesis should be a statement of a possible cause, stated to be either true or false.
What is worst case?
An algorithm’s worst case is the scenario where the algorithm does the maximum possible number of operations.
What is best case?
An algorithm’s best case is the scenario where the algorithm does the minimum possible number of operations.
What is a test?
A test is a procedure in which the result validates or invalidates a hypothesis.
