Semester: Spring 2004 Instructor: Peter Ohring Office: Natural Sciences Building 3002 Hours: Tu,Th: 10:30-12:00 Phone: (914) 251-6678 email: peter@purchase.edu Course Links: Home Page Assignments Resources on the Web Misc.	About Discrete Mathematics: Discrete is defined as "distinct from others; separate; consisting of distinct parts; discontinuous" (Thorndike and Barnhart, 1983). The text for the course- click for more info Discrete mathematics involves the study of objects and ideas that can be divided into separated or discontinuous parts. In fact, one definition of discrete mathematics is the study of mathematics properties of sets and systems that have only a finite number of elements. The sets could be codes used to encrypt information, skateboards produced by a factory or the permutations of {1,2,3}. The systems could be computer networks, electrical circuits or Pascal's Triangle. While this probably sounds pretty esoteric to the uninitiated, discrete mathematics is central in many applications of mathematics, in particular in computer science and business. The course will touch upon many of the highlights of Discrete Mathematics and it's applications. Along the way we will encounter problem solving, proofs, Arpanet, precursor to the Internet and example from Graph Theory graph theory, combinatorics, discrete probability, recursion, sets, logic, function and relations and algebraic structures. Course Structure: There will be three class meetings per week. These will be a mix of lectures, discussions, and other activities (?!?). At times we will break into small groups for collaborative work. People learn more working in teams, and cooperative efforts present a more realistic model of the working world than individuals operating in isolation. Attendance at all classes is required. There will be a strong emphasis on reading the text; we will not cover all the material in class. The classes will include clarification of important points made in the text. One way to promote in-class discussion is to write a question on the board before class. A truth is never truly assimilated except insofar as it has first been reconstituted or rediscovered by some activity. - Jean Piaget Assignments: A mix of exercises will be assigned regularly throughout the semester. While consultation between students on these assignments is encouraged, the write-ups of the assignments are to be done individually. Late homework will not be accepted except under extenuating circumstances. Course Exams and Grades: There will a mid-term and a final. The final course grade will be determined by the exams, homework, and class participation with the exams making up about 60% of the grade.	New Media New Media Program New Media @Purchase Summer Camp SMILE 1999 SMILE 2000 Math/CS Math/CS Program Course Pages Natural Sciences Division