Department of Computer Science & Engineering

CS365 Mathematics of Computer Science (Spring 2007)

  • Meets: TR 2:30 - 3:45 pm (SEM 344)

  • Instructor: Dr. George Bebis

  • TA: TBA

  • Text: K. Rosen, Discrete Mathematics and Its Applications McGraw Hill, 6th edition, 2006.

  • Optional Text: D. Malik and M. Sen, "Discrete Mathematical Structures: Theory and Applications", Thomson Course Technology, 2004.


    Data Structures (CS 302), Calculus II (MATH 182). If you do not meet the prerequisite requirements for this course, you should see me immediately.


    The primary purpose of this course is to enhance students' reasoning and problem-solving abilities, in both a general context and in terms of solving computing-related problems. Specifcially, the course has the following objectives:
  • Familiarize students with the concepts and applications of computing - and engineering-related mathematics.
  • Teach students how to think mathematically and algorithmically.
  • Emphasize the combination of computational reasoning and problem-solving skills.
  • Introduce students to discrete structures and combinatorics.

    Course Outline (tentative)

    Exams and Assignments

    Grading will be based on two exams, quizzes, homework, a course project, and a short presentation. Specifically, there will be several quizzes in class which will be announced at least one class period in advance. Homework problems will be assigned and collected for grading on a regular basis. Odd-numbered homework assignments will be done on an individual basis while even-numbered homework assignments will be done in groups. Homework solutions will be made available within a week of the due date for the assignment. There will be two exams, a midterm and a final. The material covered by the exams will be drawn from the lectures, the quizzes, and the homework. The course project will have both individual and team components. Specifics and due dates will be announced in class. Each group of students will have to prepare a short presentation on a contemporary issue related to discrete mathematics. Presentation topics will be decided in coordination with the instructor. The presentations should be professional as if it was presented in a formal conference (i.e., slides/projector). The last quiz will be based on material related to the student presentations.

    Course Policies

    Lecture slides, homework assignments, and other useful information will be posted on the course web page. Regular attendance is highly recommended. If you miss a class, you are responsible for all material covered or assigned in class. Discussion of the assignments is allowed and encouraged between students. However, each student would be expected to do his/her own work. Assignments which are too similar will receive a zero. No late homework or project report will be accepted. If you are unable to hand in your homework or project report by the designated deadline, you must notify me before the deadline. No incomplete grades (INC) will be given in this course and a missed quiz/exam may be made up only if it was missed due to an extreme emergency.

    Disability Statement

    Any student with a disability needing academic accomodations is requested to speak with me or contact the Disability Resource Center (Thompson Building, Suite 101), as soon as possible to arrange for appropriate accomodations.

  • Syllabus

  • Summer Research Opportunities

  • Helpful Material

  • Lectures

  • Homework Assignments

  • Presentation Topics

  • Presentations

  • Presentation Guidelines

  • Course Project

    Department of Computer Science & Engineering, University of Nevada, Reno, NV 89557