Discrete Math - Introduction Flashcards
Review Major Concepts of Discrete Math Basics
What is Discrete Mathematics?
Discrete Mathematics describes processes that consists of a sequence of individual steps.
What are the prerequisites for learning Discrete Mathematics?
Algebra is a requirement for learning Discrete Mathematics.
List and Briefly Describe: Major Themes of Discrete Mathematics
Logic & Proof: thinking is terms of logically valid forms of argument and avoid common logical errors.
Induction & Recursion: to address a problem by assuming that similar problems of a smaller nature have already been solved and figuring out how to put those solutions together to solve the larger problem.
Discrete Structures: Discrete mathematical structures are the abstract structures that describe, categorize, and reveal the underlying relationships among discrete mathematical objects, such as the sets of integers and rational numbers, general sets, Boolean algebras, functions, relations, graphs and trees, formal languages and regular expressions, and finite-state automata.
Combinatorics and Discrete Probability: Combinatorics is the mathematics of counting and arranging objects, and probability is the study of laws concerning the measurement of random or chance events.
Algorithms and their Analysis: an algorithm is a step-by-step sequence of instructions for the computer to follow. Designing an algorithm requires an understanding of the mathematics underlying the problem to be solved. Determining whether or not an algorithm is correct requires a sophisticated use of mathematical induction.
Applications and Modeling. Mathematical topics are best understood when they are seen in a variety of contexts and used to solve problems in a broad range of applied situations.
