# SYLLABUS ECS2305 - Discrete Math For Computing I C.P. Bernardin http://www.utdallas.

edu/~cpb021000/ Fall 2010 M-W-F; Time: 1:30-2:20 PM, ECSS 2.312 First Class: Friday August 20, 2010

The details of this Syllabus are subject to change at any time during the course (see web for updates) Textbook: DISCRETE MATHEMATICS AND ITS APPLICATIONS, by Kenneth H. Rosen. 5th Edition, Chapters 1, 2, 3, 4, 5, 6, 7, 8, and 9 ISBN-13: 978-0072930337 (Hardcover)

Tests: There will be one test (20% of your grade) in the beginning of the semester, composed of traditional problems taken from the book and my lectures. Although there will be no Final Exam, there will be two tests given on the last two days of class, which will be equally weighted and cumulatively worth 40% of your grade. The test dates will be announced at least one week in advance. There will be no makeup test or repeated exam. Project: There will be one multi-week computer project. The project will count for 20% of your grade (= to one test). The project will require students to develop an elementary knowledge of programming. Students will be expected to program in BASIC and also Microsoft Excel. (e.g., reference "Chipmunk BASIC" for Windows, http://www.nicholson.com/rhn/basic/ For Excel: http://www.ksu.edu/stats/tch/malone/computers/excel/ and http://www.bioss.sari.ac.uk/smart/unix/mbasexc/slides/frames.htm )

Grading Distribution: Attendance Homework Test #1 Project Test #2 Test #3 5% 15% 20% 20% 20% 20%

Instructor Office Rm 3.207 ECS Building Course Learning Objectives: • Ability to use and apply basic definitions and properties of logic • Ability to specify precise meaning of mathematical statements, using quantifiers and predicates • Ability to express an algorithm into working computer code • Ability to use Big O notation and algorithmic complexity • Ability to use basic counting techniques e.g. permutations, combinations, the pigeonhole principle • Ability to analyze and interpret random data

Approximate Class Schedule
Assignment Due Date Mon, Sept 6 Wed, Sept 8 Fri, Sept 17 Wed, Sept 22 Wed, Sept 29 Fri, Oct 15 Wed, Oct 27 Mon, Nov 8 Fri, Nov 19 Fri, Nov 26 Fri, Dec 3 Mon, Dec 6

Labor Day Holiday
Hmwk 1 Chapt 1 Hmwk 2 Chapt1 pt2 Test 1 Chapt 1 Hmwk 3 Algorithms Ch 2 Hmwk 4 Project Hmwk 5 Hmwk 6 Thanksgiving Holiday FINAL EXAM Part 1 FINAL EXAM Part 2

As new assignments are made, and old assignments are collected, the details of this schedule are subject to FREQUENT change as we progress throughout the course (check web regularly for updates)