CSCE 235

Introduction to Discrete Structures

Class Syllabus

Fall 2006

 

General Information

 

Instructor:  Prof. Leen-Kiat Soh

E-mail:  lksoh@cse.unl.edu

Phone:  (402) 472-6738

Office:  122E Avery Hall

Office Hours:  11:00 AM – 12:00 noon TR

  2:30 PM – 3:30 PM TR (Open door policy)

 

Lecture:  111 Avery Hall, 9:30 AM – 10:45 AM  TR

Recitation:  108 Avery Hall, 5:30 PM – 6:20 PM  T

Website:  http://www.cse.unl.edu/~lksoh/Classes/CSCE235_Fall06/

 

Teaching Assistant:  Nobel Khandaker

E-mail:  knobel@cse.unl.edu

Phone:  (402) 472-4257

Office:  122F Avery Hall

Office Hours:  10:00 AM – 11:00 AM MF  2:30 PM – 3:30 PM W

 

Catalog Listing

 

Survey of elementary discrete mathematics.  Elementary graph and tree theories, set theory including relations and functions, propositional and predicate logic, methods of proof, induction, recurrence relations, principles of counting, elementary combinatorics, and asymptotic notations.  Homework will emphasize theoretical concepts and will be augmented with programming assignments. (3 cr.)

 

Class Objectives

 

The objective of this class is to familiarize students with some fundamental issues in mathematics that are useful for problem solving and software design in computer programming.  Essentially, this class aims at equipping students with powerful tools for their further study in computer science in general, and wonderful ideas for solving programming problems in particular.  Think about this:  you will be able to formulate a problem in discrete mathematics that allows you to come up with a solution with confidence.

 

Required Background

 

Prerequisites: CSCE155/155H; MATH 106 or Equivalent.

 

Text Book

 

Rosen, K. H. (2003).  Discrete Mathematics and Its Applications, New York, NY: McGraw-Hill, 5th Edition (Required)

 

Additional information:               www.mhhe.com/rosen

 

Grading

 

Final grades in this class will be assigned based on the following scale:

 


A:         94% - 100%

A-:       90% - 93%

B+:       87% - 89%

B:         83% - 86%

B-:       80% - 82%

C+:      77% - 79%

C:         73% - 76%

C-:       70% - 72%

D+:      67% - 69%

D:         63% - 66%

D-:       60% - 62%

F:         below 60%


 

A+ is awarded to a student whose work and understanding of the class prove to be exceptional.

 

There will be about 10-12 homework assignments (a total of 45% of your grade) (some homework assignments are programming assignments), two examinations (30%), one comprehensive final examination (20%), and several pop quizzes (5%). 

 

Academic Misconduct

 

Academic dishonesty of any kind will be dealt with in a manner consistent with the CS&E Department's Policy on Academic Integrity (http://cse.unl.edu/undergrads/academic_integrity.php). You are expected to know and abide by this policy.