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)

Course Description: (3 semester hours) Principles of counting. Boolean operations. Logic and methods of proof. Sets, relations, functions. Recurrence relations. Elementary graph theory. Students who have taken CE/TE 3307 cannot receive credit for this course. Prerequisites: MATH 1326, MATH 2413 or MATH 2417 ( i.e., Calculus I and II) The following is brief, non-exhaustive list of topics in the approximate order in which they are covered: 1) Logic, Sets and Functions 2) Algorithms 3) Sorting Approaches 4) Discrete Computing in Probability and Statistics 5) Simulating Random Variables on a Computer 6) The Algorithms of Least Squares Methods 7) Math Induction & Proofs 8) Number Theory and Congruence Applications 9) Counting Prime Numbers and the Sieve of Eratosthenes 10) Numerical Computation and Linear Algebra 11) Combinations, Permutations and Counting Methods Attendance: Attending the lecture sessions is required and will affect the final grade (=5%). Attendance sheets will be collected randomly. Homework: Homework (about 8 assignments) is 15% of your grade (Attendance + Homework = to one test). A list of problems will be assigned in class. Working through these problems diligently will help your grade in the course because these problems and similar ones will appear on the tests. Students are encouraged to collaborate on these assignments. The textbook has the solutions to many problems similar to the homework. There are also some special problems that involve elementary programming. Homework is due on the stated due date. Late homework will be marked as a zero. Occasionally homework is lost during the grading process. Students are required to make a copy EACH homework before submitting it. If homework is lost before it is graded, the student must produce a copy of the original for grading or get a zero.

Tests: There will be two tests (each 20% of your grade) given in the beginning and the middle 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 additional 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.

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

Instructor Office Rm 3.207 ECS Building Course Learning Objectives: o Ability to use and apply basic definitions and properties of logic o Ability to recognize and construct valid proofs including proofs by induction o Ability to understand what an algorithm is, use algorithms, use Big-O notation and algorithmic complexity o Ability to use basic counting techniques o Ability to use and apply basic definitions and properties of sets, relations, functions o Ability to use and apply basic definitions and properties of graphs, trees

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 Test 2 Lect Notes (2-7) Hmwk 5 Hmwk 6 Thanksgiving Holiday Last Test Part 1 Last Test 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)

Sign up to vote on this title
UsefulNot useful