College of Science, Engineering and Technology
College of Science, Engineering and Technology -
Chapters Syllabus Objectives Labs Practice Area Lecture Notes Sample Tests
     » Home
     » Our Profile
     » Academic Programs
     » Centers of Excellence
     » Outreach
     » Scholarships
     » Web-Enhanced Courses
     » Contact Us
     » STARS
     » DNIMAS
     » News & Extras
     » About Us

NSU - Norfolk State University
CSC 270 : Syllabus

Text: Discrete Source--The Prentice Hall Custom Program for Discrete Mathematics (ISBN: 0-536-99271-1)

Credit: 3 Hours

Course Description: An introduction to the areas of discrete mathematics that are important for computer science. Topics include logic, sets, functions, relations, algorithms, counting methods, and graph theory.

Prerequisites:CSC-260, MTH-251

Grading Standards:

900 points or more A
870-899 points B+
800-869points B
770-799 points C+
700-769 points C
600-699 points D
599 points or less F

Course Rationale: This is a required course in all Computer Science curricula to give the fundamental of discrete mathematical structures to Computer Science students. It is also required by accreditation standards.

Course Goals and Intended Outcome:

  • To introduce students to topics in discrete mathematics which are important for advanced computer science courses
  • To expand students’ mathematical reasoning capabilities so that they can read, comprehend and construct mathematical arguments successfully.
The student will be able to
  • Explain with examples the basic terminology of functions, relations, and sets.
  • Perform the operations associated with sets, functions, and relations.
  • Relate practical examples to the appropriate set, function, or relation model, and interpret the associated operations and terminology in context.
  • Apply formal methods of symbolic propositional and predicate logic.
  • Describe how formal tools of symbolic logic are used to model algorithms and real-life situations.
  • Use formal logic proofs and logical reasoning to solve problems such as puzzles.
  • Outline the basic structure of and give examples of each proof technique described in this unit.
  • Discuss which type of proof is best for a given problem.

Attendance Policy:The University expects students to attend all classes. While unnecessary absences are discouraged, the University recognizes that on occasion, students may have legitimate reasons for be absent from class such as representing the University in activities, illnesses, or personal emergencies. If the student is absent when a quiz or test is given, you must see the instructor and make arrangements before the next class meeting. Make-up quizzes are not given because of the exam / quiz replacement grade policy.

Requirements for the Student:

  1. The student should pre-study (read) all new topics before they are presented in class. You are expected to complete daily homework assignments by the time class meets the first time following discussion of lesson material in the classroom. The instructor will ascertain the daily progress in accomplishing homework exercises and will devote a portion of classroom activities to the solution of any "troublesome exercises".
  2. Separate notebooks should be maintained for classroom discussion notes and homework exercises.
  3. All homework should be carefully completed. A minimum of two hours outside the class preparing for each hour of class is necessary for learning and proper understanding of the material.
  4. Students are strongly encouraged to participate in classroom discussions.
  5. Tests will be administered during the course; also the student can expect random quizzes; a departmental final examination will also be given.
  6. All cell phones, pages, etc. must be turned off before entering the classroom.
  Copyrights © 2008. - - all rights reserved.