CSCE 235

Introduction to Discrete Structures

Class Syllabus

Spring 2009

General Information

Instructor: Prof. Leen-Kiat Soh

E-mail: lksoh@cse.unl.edu

Phone: (402) 472-6738

Office: 122E Avery Hall

Office Hours: Open Door Policy, 1:30 PM – 2:30 PM MWF

Lecture: 119 Avery Hall, 12:30 PM – 1:20 PM MWF

Recitation: Session 152 – 110 Avery Hall, 3:30 PM – 4:20 PM M

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

Recitation Instructor and Graduate Teaching Assistant: Nobel Khandaker

E-mail: knobel@cse.unl.edu

Office Hours: 9:00 – 11:00 AM T, S9:00 - 10:00AM R, tudent Resource Center, Avery Hall

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. (2007). Discrete Mathematics and Its Applications, New York, NY: McGraw-Hill, 6th 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.