Course Syllabus Course number: Course Title: Instructor: Office: Office hours: Telephone: Email: TA: Course Prerequisite CS 3305 .001 Discrete Mathematics for Computing II Credit Hours: 3 MW 8:30am - 9:45am ECSS 2.410 Dr. Bhadrachalam Chitturi ECSN 3.604 Monday 1:30 pm-2:30 pm. Additional time slots are allotted by appointments. (972) 883-2316 chalam@utdallas.edu TBA. CS 2305 with a grade of C or better. Catalog Description Discrete Mathematics for Computing II (3 semester hours): Advanced counting methods; recurrence relations, divide and conquer algorithms, principle of inclusion and exclusion. Algorithmic complexity. Graph theory. Number theory. Equivalence classes and Posets. ____________________________________________________________________________________________________ Student Learning Objectives After successful completion of this course, the following competencies are expected: Ability to recognize and construct proofs including structural induction. Ability to apply asymptotic notation, understand recursive definitions and solve recurrence relations Ability to apply advanced counting techniques including binomial theorem, combinations with repetitions, principle of inclusion-exclusion, and combinatorial arguments. Understand and apply the principles of number theory. Understand and apply basic graph theory and graph algorithms. Ability to recognize and use equivalence relations and partial orderings References Discrete Mathematics and Its Applications, Eighth Edition, by Rosen, Kenneth H., McGraw Hill, 2019. Additional Course Materials Course materials are/will be available at elearning.utdallas.edu. Assignment and Calendar All assignments must be submitted by the deadline. Turn in what is completed by the deadline for partial credit. Late submissions are not accepted in general and carry a penalty. If you need to submit late, then do so at the earliest and inform the TA. All submissions must be your own work. Regular class attendance and participation is expected and is the responsibility of the student. There is a strong correlation between regular class attendance and good performance. The student is responsible for the contents of the missed lectures. Grading Policy Your course average will be calculated as follows: Exam #1, #2 and #3 – 30% each; total: 90% Homework and other assignments 10% Tentative dates for exams: Exam 1 Sep 27 Exam 2 Nov 13 Exam 3 Dec 6 Group study is encouraged. Exams have corresponding syllabus; however, familiarity with all the syllabus that is covered up to the time of the exam is expected. The final grades will be awarded based on absolute performance and the natural clusters of the final scores. Thus, both the absolute score and the relative position matter. Course & Instructor Policies If you have any question about grading, then you must contact the instructor immediately. Any incorrectly posted grade must be notified to the grader via official e-mail within a week of posting the grade. It is possible that your assignment, quiz, or exam grade may decrease when it is regraded. Student Conduct & Discipline All University Guidelines apply. CS 3305 Course Syllabus Page 1 For the latest information, please refer to UTD's policies at https://go.utdallas.edu/syllabus-policies Comet Creed This creed was voted on by the UT Dallas student body in 2014. It is a standard that Comets choose to live by and encourage others to do the same: “As a Comet, I pledge honesty, integrity, and service in all that I do.” ________________________________________________________________ UT Dallas Syllabus Policies The contents of this syllabus are subject to change at the discretion of the instructor. For latest policies please refer to: https://go.utdallas.edu/syllabus-policies CS 3305 Course Syllabus Page 2
