Office hours before and after class.īesides the time for classes, you’ll spend time on reading the text, doing the assignments, and studying of for quizzes and tests. (There is a seventh edition, but the sixth edition is widely available and less expensive. Discrete Mathematics and its Applications, sixth edition, by Kenneth H. The text and class discussion will introduce the concepts, methods, applications, and logical arguments students will practice them and solve problems on daily assignments, and they will be tested on quizzes, midterms, and the final. They will be able to solve problems using these various concepts and methods, they will know a number of applications of discrete mathematics, and they will be able to follow logical arguments and develop modest logical arguments. Students will be able to apply the specific concepts and methods described in the syllabus - logic, set theory, sequences and series, number theory, combinatorics, discrete probability, and graph theory. Structures that are central to mathematics, computer science, and statistics
Includes elementary logic and set theory, equivalence relations, functions, counting arguments, asymptotic complexity, inductively defined sets, recursion, graphs and trees, Boolean algebra and combinatorial circuits, finite state automata, and diagonalization and countability arguments. Math 114 course description: Covers mathematical structures that naturally arise in computer science.