CSC 230

Syllabus

   
...

CSC 230

*Syllabus*

Homework

...

 

Class Logistics

Class meets Tuesday and Thursday nights from 6:30-8:20 pm at Carnegie Hall, room 13.

Our textbook is "Discrete Methematics and Its Applications", Fifth Edition, Kenneth H. Rosen. The publisher's web site for the text is: www.mhhe.com/rosen 

The official class description, straight from the North Central web site:

230 Discrete Structures I (3.00)

(Same as: MTH 230.) Fundamental topics in mathematics and computer science including formal logic, proof techniques, sets, relations and functions, combinatorics, graphs, logic circuits, and finite state machines. Prerequisites: CSC 160, MTH 121 or higher. Core: Mathematics. Offered: Annually.

   


Instructor

My name is Bill Krieger. I am a part-time professor in the Computer Science department at North Central College.

My email is wtkrieger@noctrl.edu 

My North Central web site is william.krieger.faculty.noctrl.edu... there's a link to our class web site there.

My office is located at 309 Carnegie. My office hours this term are Tuesday and Thursday from 3:00-5:00. Please see/email me if these hours are not convenient for you, and we will work out a better time to meet.


Grades

Your final grade will be comprised of the following:

Item Points
Class participation  10
Homework  10
Exam 1  25
Exam 2  25
Final Exam  30
Total 100

To clarify, class participation will include completion of reading assignments, preparation of notes, coming to class and contributing.

The standard North Central grading scale will be used:

A (93-100%) B+ (87-89%) C+ (77-79%) D (60-69%)
A- (90-92%) B (83-86%) C (73-76%) F (0-59%)
  B- (80-82%) C- (70-72%)  

Material Covered

This plan is tentative:

Chapter Sections Comment
1 1.1 - 1.8  
2 2.7 Matrices
3 3.1 - 3.4 Proofs, induction, recursion
4 4.1 - 4.6 Counting, combinatorics
5 5.1 Probability
6 6.1, 6.5 Recurrence relations, sets
7 7.1 - 7.6 Relations
8 8.1 - 8.8 Graphs
9 9.1 - 9.5 Trees
10 10.1 - 10.4 Boolean algebra
11 11.1 - 11.5 Grammars, state machines

The material in Chapters 10 and 11 will be covered last, so it we run short on time, this is where we will cut material covered.