This requires a purchase of online access to the book for the semester.Ĭlass participation, online and written homework, tests and a group presentation will be used for evaluation. The textbook we will be using is an interactive online textbook called Discrete Math, available through. I recommend the book Concrete Mathematics by Ronald Graham, Donald Knuth, and Oren Patashnik. Recurrences and Generating Functions in Algorithms. For examples of discrete mathematics at work, see. Students will learn to understand logical reasoning, construct well formed proofs, define one-to-one and onto functions, prove that sets are countable and work with prime numbers. Basically, discrete mathematics is the branch of mathematics that studies the underlying principles which govern discrete structures and the binary universe. For this reason, discrete mathematics often come up when studying the complexity of algorithms on data structures. Discrete implies noncontinuous and therefore discrete sets include. Students are assumed to have taken COMP 1805 (Discrete Structures I), which covers mathematical rea-soning, basic proof techniques, sets, functions, relations, basic graph theory, asymptotic notation, and countability. We will focus on logic and proofs, sets and functions, primes and divisibility and advanced proof techniques. discrete structure A set of discrete elements on which certain operations are defined. course COMP 2804 (Discrete Structures II). Prereqs enforced by the system: CS 020 or 021 or 110 and MATH 021 or 023 Open to Degree and CDE students Section Descriptionĭiscrete Structures covers the fundamental mathematical tools that Computer Science students will need for upper level classes. Discrete structures can be finite or infinite. courses of Punjab Technical University and other technical universities of India. Prerequisites: CS 020 or CS 021 or CS 110 MATH 021 or MATH 023. Examples of structures that are discrete are combinations, graphs, and logical statements. This book has been written according to the latest syllabi for B. Credit not given for more than one of CS 064, MATH 052 or MATH 054. Introduction to analytic and formal methods of computer science with practical examples, including analysis or data structures, recursion relations, proof methods, and logic programming.