http://www.merlot.org:80/merlot/ A search of MERLOT materials Copyright 1997-2013 MERLOT. All rights reserved. Tue, 18 Jun 2013 17:37:39 PDT Tue, 18 Jun 2013 17:37:39 PDT http://www.merlot.org:80/merlot/images/merlot.gif http://www.merlot.org:80/merlot/ 44 34 http://www.merlot.org/merlot/viewMaterial.htm?id=519846 This online course comes from the Open Learning Initiative (OLI) by Carnegie Mellon. “The course includes self-guiding materials and activities, and is ideal for independent learners, or instructors trying out this course package.”״Discrete mathematics, also called finite mathematics or decision mathematics, is the study of mathematical structures that are fundamentally discrete in the sense of not supporting or requiring the notion of continuity. Objects studied in finite mathematics are largely countable sets such as integers, finite graphs, and formal languages. Concepts and notations from discrete mathematics are useful to study or describe objects or problems in computer algorithms and programming languages.״At this point only one of the planned 15 modules is currently available, that on Groups. http://www.merlot.org/merlot/viewMaterial.htm?id=620073 This course describes discrete mathematics, which involves processes that consist of sequences of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. This free course may be completed online at any time. See course site for detailed overview and learning outcomes. (Computer Science 202)