null
US
Sign In
Sign Up for Free
Sign Up
Remove ads
We have detected that Javascript is not enabled in your browser. The dynamic nature of our site means that Javascript must be enabled to function properly. Please read our
terms and conditions
for more information.
Info
Ratings
Comments
Mind Map
by
Ricky Zúñiga Gar
, created
more than 1 year ago
Ricardo Zúñiga García - A01422545 A chart about discrete mathematics, its topics and applications.
Pinned to
819
0
0
No tags specified
discrete mathematics
mathematics
mapa mental
Created by
Ricky Zúñiga Gar
over 9 years ago
Rate this resource by clicking on the stars below:
(0)
Ratings (0)
0
0
0
0
0
0 comments
There are no comments, be the first and leave one below:
To join the discussion, please
sign up for a new account
or
log in with your existing account
.
Close
4311471
mind_map
2016-11-02T00:31:22Z
Discrete Mathematics
Topics
Applications
Knowledge Management
Database
Systems
Software Engineering
Programming Languages / Data
Structures
Hardware Topics
Classical
Logic
Fuzzy
Logic
Sets and Combinatorics
Functions
Relations and Matrices
Induction
Recursion
Algorithms
Graphs and Trees
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.
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.
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 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.
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.
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 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.
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.
A procedure or formula for solving a problem.
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.
Double click this node
to edit the text
Click and drag this button
to create a new node
New
0
of
0
Go to link
Track All
Untrack All
You need to log in to complete this action!
Register for Free