CSC 1300: Discrete Structures
Fall 2000

Lecture notes | Homework assignments

Where and when: In Mendel G30, Mondays and Wednesdays from 3:30pm to 4:45pm

Course Home Page:

Instructor: Dr. Giorgi Japaridze

Teaching assistant: Mr. Sandeep Gandra

Textbook: "Discrete Mathematics and its Applications" by Kenneth H.Rosen, 4th edition, 1999 (required)
Comes with "Student Solutions Guide" (recommended)

Description and goals: This course can be defined as Mathematics for Computer Science. The two major goals of it are:


  1. Logic, Sets and Functions (1.1-1.7)
  2. Algorithms, the Integers and Matrices (2.3, 2.4, 2.6)
  3. Mathematical Reasoning (3.1-3.3)
  4. Counting (4.1-4.4)
  5. Advanced Counting Techniques (5.1, 5.5)
  6. Relations (6.1, 6.3, 6.5)
  7. Graphs (7.1-7.5)
  8. Trees (8.1)

Prerequisites: csc1051 (Algorithms and Data Structures 1) is a prerequisitive and csc1052 (Algorithms and Data Structures 2) is a corequisite for this course.

Grading: Homework --- 20%, quizzes --- 10%, in-class (2 midterm, 1 final) examinations --- 70%.
Homework papers will be collected on Mondays, Quizzes will be given on Wednesdays. No late homework will be accepted, no missed quiz will be excused!

Examination schedule (tentative):