MTH/CSC 447 (Discrete Mathematical Structures)

Vladimir A. Dobrushkin,Lippitt Hall 202C, 874-5095,dobrush@math.uri.edu

Discrete mathematics is the study of mathematical structures that can often be enumerated by integers. The set of counted objects studied in discrete mathematics can be finite or infinite. Discrete structures have numereous applications in real-world problems through the computer implementations. Research in discrete mathematics increased in the latter half of the twentieth century partly due to the development of digital computers that operate in discrete steps and store data in discrete bits. Therefore, theoretical computer science utilizes most of the discrete structure topics including computer algorithms, programming languages, cryptography, discrete calculus, combinatorics, automated theorem proving, graph theory including network science, computability studies, automata theory and formal language theory, logic, information theory, probability, and software development. MTH/CSC447 course gives an introduction to most of these topics. There is no official prerequisite for this course, however, it is recommended that you have been exposed to a variety of math and science courses.

MTH447, MW 3:00 - 4:15 pm, Tyler Hall, room 106

**TEXTBOOK:** Vladimir A. Dobrushkin.,

Methods in Algorithmic Analysis, 2010

Chapman and Hall/CRC Press, Taylor & Francis Group

ISBN-10: 1420068296

ISBN-13: 978-1420068290

__Information Technology:__

Information technology will play an important role in this course and a computer algebra system (such as Maple, Maxima, or Mathematica) is very helpful to avoid tedious calculations.

__Homework: __

Homework plays a central role in the class and in your understanding of the material. It is fair to say that most of the learning that you achieve during any math course is from your homework.

__Attendance:__

Because of the high level of knowledge that will be imparted and assessed during class time, attendance is highly recommended.

Students not attending courses in which they enrolled have the obligation to drop those courses before the drop deadline. Names of students who are absent from the first and second class meetings of a course and **who do not notify the course instructor of their intention to attend future class meetings** will be submitted to the Office of Enrollment Services for deletion from the class roster. Students who expect to be absent from classes or examinations for University sanctioned events shall discuss this with the instructor at least one week in advance of the sanctioned event(s).

__Make-up Exam:__

Makeup exams will only be given to students with an acceptable excuse. The only acceptable excuses are as follows: religious holy day, family emergency, school sponsored event, job interviews, or sickness. All absences require documentation. For example, sickness, a doctor's excuse. You must let me know before the exam that you will not be able to take the exam in order to be given a makeup exam. All other absences will be given a zero for that exam. No exceptions! Makeup exams will be given at a time that is convenient for both you and me.

__Accomodations: __

Students who require accommodations and who have documentation from Disability Services (874-2098) should make arrangements with me as soon as possible. As part of this process, please be in touch with Disability Services for Students Office at 330 Memorial Union.

**Weather phone number:** (401) 874-snow or 874-7669.

**Help With Your studies and homework:**

Tutors are available at both the Providence and Kingston campuses. Check with them for specific hours. Also, you can make individual appointments with me. For this, contact me by phone, e-mail, or ask me during class.

I may help you with questions during office hours, or at other times by appointment. Also, I will try to answer questions sent by electronic mail as promptly as possible. Students who require accommodations and who have documentation from Disability Services (874-2098) should make arrangements with me as soon as possible.