Lesson 1 Flashcards
The branch of mathematics dealing with objects that can assume
only discrete and separated values. It concerns counting,
propositional logic, probability and limit processes over discrete
sets. Matrices, set theory, the idea of function, recurrence
relations and permutations are all part of ______________.
Discrete Mathematics
It is an essential part of the foundations of (theoretical) computer science, statistics, probability theory, and algebra.
Discrete Math
Students must understand ______________ ___________in order to read, comprehend and construct mathematical arguments.
Mathematical Reasoning
An important problem-solving skill is the ability to count or enumerate objects; it includes the discussion of basic techniques of counting.
Combinatorial Analysis
A course in discrete mathematics should teach students how to work with ________ _________, which are the abstract mathematical structures used to represent discrete objects and relationships between these objects.
Discrete Structure
Certain classes of problems are solved by the specification of an algorithm. After an algorithm has been described, a computer program can be constructed implementing it.
Algorithmic Thinking
Discrete mathematics has applications to
almost every conceivable area of study. There are many applications to computer science and data networking in this course.
Application and Modeling
math based on the continuous number line,
or the real numbers. The defining quality of it is that given any two numbers, you can always find another number between them - in fact, you can always find an INFINITE set of numbers between them.
Continuous Mathematics
working with distinct values - given any two
points in discrete math, there (NOT an infinite or It is FINITE) number of points between them.
Discrete Mathematics
