4311471
Description
Mind Map by Ricky Zúñiga Gar, updated more than 1 year ago
|
Created by Ricky Zúñiga Gar
over 8 years ago
|
|
Discrete Mathematics
- Topics
- Classical Logic
- The science that studies by means of mathematical tools the notions, judgments and
reasoning as well as the laws of correct reasoning. It investigates how sentences are
combined and connected, how theorems can be deduced formally from certain
axioms, and what kind of object constitutes a proof.
- The science that studies by means of mathematical tools the notions, judgments and
reasoning as well as the laws of correct reasoning. It investigates how sentences are
combined and connected, how theorems can be deduced formally from certain
axioms, and what kind of object constitutes a proof.
- Fuzzy Logic
- A logical system that generalizes the classical (two-valued) logic and includes many-valued
logic, i.e. a body of concepts, constructs and techniques which relates to modes of reasoning
which are approximate rather than exact in order to deal with the imprecision of
information.
- A logical system that generalizes the classical (two-valued) logic and includes many-valued
logic, i.e. a body of concepts, constructs and techniques which relates to modes of reasoning
which are approximate rather than exact in order to deal with the imprecision of
information.
- Sets and Combinatorics
- A set is an unordered collection of distinct objects. The objects are called
elements of the set. Combinatorics are the branch of mathematics dealing with
combinations of objects belonging to a finite set in accordance with certain
constraints, such as those of graph theory.
- A set is an unordered collection of distinct objects. The objects are called
elements of the set. Combinatorics are the branch of mathematics dealing with
combinations of objects belonging to a finite set in accordance with certain
constraints, such as those of graph theory.
- Functions
- In mathematics, a function is a relation between a set of inputs and a set of
permissible outputs with the property that each input is related to exactly one
output.
- In mathematics, a function is a relation between a set of inputs and a set of
permissible outputs with the property that each input is related to exactly one
output.
- Relations and Matrices
- A relation is a generalization of arithmetic relations. A matrix is a
rectangular array of numbers, symbols, or expressions, arranged in
rows and columns.
- A relation is a generalization of arithmetic relations. A matrix is a
rectangular array of numbers, symbols, or expressions, arranged in
rows and columns.
- Induction
- A mathematical proof technique, most commonly used to
establish a given statement for all natural numbers, although
it can be used to prove statements about any well-ordered
set. It is a form of direct proof, and it is done in two steps.
- A mathematical proof technique, most commonly used to
establish a given statement for all natural numbers, although
it can be used to prove statements about any well-ordered
set. It is a form of direct proof, and it is done in two steps.
- Recursion
- The process of repeating items in a self-similar way. For instance, when the
surfaces of two mirrors are exactly parallel with each other, the nested
images that occur are a form of infinite recursion.
- The process of repeating items in a self-similar way. For instance, when the
surfaces of two mirrors are exactly parallel with each other, the nested
images that occur are a form of infinite recursion.
- Algorithms
- A procedure or formula for solving a problem.
- A procedure or formula for solving a problem.
- Graphs and Trees
- A graph in this context is made up of vertices or nodes or points and edges or
arcs or lines that connect them. A tree is an undirected graph in which any two
vertices are connected by exactly one path. In other words, any connected graph
without simple cycles is a tree.
- A graph in this context is made up of vertices or nodes or points and edges or
arcs or lines that connect them. A tree is an undirected graph in which any two
vertices are connected by exactly one path. In other words, any connected graph
without simple cycles is a tree.
- Boolean algebra
- In the computers, these transistors switches are combined to form logic gates,
which model operations in Boolean algebra. Boolean algebra is the theoretical
basis for computer logic design. Transistors are the bricks for implementation.
Digital circuits are used to perform arithmetic, to control the movement of data
within the computer, to compare values for decision-making, etc. Combinatorial
circuits are circuits in which the results of an operation depend only of the
present inputs to the operation. A sequential circuit is dependent on the
previous state of an operation as well as the current sets of inputs.
- In the computers, these transistors switches are combined to form logic gates,
which model operations in Boolean algebra. Boolean algebra is the theoretical
basis for computer logic design. Transistors are the bricks for implementation.
Digital circuits are used to perform arithmetic, to control the movement of data
within the computer, to compare values for decision-making, etc. Combinatorial
circuits are circuits in which the results of an operation depend only of the
present inputs to the operation. A sequential circuit is dependent on the
previous state of an operation as well as the current sets of inputs.
- Classical Logic
- Applications
- Knowledge Management
- Database Systems
- Software Engineering
- Programming Languages / Data Structures
- Hardware Topics
- Knowledge Management
Want to create your own Mind Maps for free with GoConqr? Learn more.