Mathematical techniques Flashcards
what is decomposition?
Decomposition, is the process of breaking a large problem into more manageable sub-problems. The motivating principle is that large problems are disproportionately harder to solve than small problems.
what is pattern recognition?
pattern recognition, involves finding the similarities or patterns among small, decomposed problems that can help us solve more complex problems more efficiently.
what is abstraction?
Abstraction; The quality of dealing with ideas rather than events. Its main goal is to handle complexity by hiding unnecessary details from the user. That enables the user to implement more complex logic on top of the provided abstraction without understanding or even thinking about all the hidden complexity.
what is an algorithm?
Algorithms; A process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer.
The common categories of algorithms that you should know:
Sorting algorithms: bubble sort, insertion sort, quick sort, etc
Search algorithms: binary search, breadth-first search, depth-first search,
Shortest path algorithms: Bellman–Ford algorithm, Dijkstra’s algorithm,
Math algorithms: Fibonacci numbers sequence, greatest common divisor, least common multiple
what are sorting algorithms used for?
A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure.
what are search algorithms used for?
Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored. Based on the type of search operation, these algorithms are generally classified into two categories:
Sequential Search: In this, the list or array is traversed sequentially and every element is checked.
Interval Search: These algorithms are specifically designed for searching in sorted data-structures.
what are Shortest path algorithms used for?
an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.
what are Math algorithms used for?
An algorithm in mathematics is a procedure, a description of a set of steps that can be used to solve a mathematical computation: but they are much more common than that today.
what is mathematical logic used for?
The math that we do use everyday in software development is called Mathematical Logic. In particular, software development involves a lot of Boolean Algebra
