Shepherd University

MATH 155-01 Discrete Structures

FALL 2008

INSTRUCTOR                                     : Osman Guzide

OFFICE LOCATION                          : Stutzman and Slonaker Hall #211A

OFFICE HOURS                                  : Monday, Wednesday, and Friday 10am -12 pm or by appointment 

PHONE                                                  : (304) 876-5304

E-MAIL                                                  : oguzide@shepherd.edu

COURSE DESCRIPTION:

Topics include solutions for a system of linear equations, matrix algebra, optimization problems and duality, counting arguments, combinations and permutations, elementary probability theory, Markov Chains, elementary graph theory, and other applications arising out of finite mathematics.

COURSE OBJECTIVES:

• To solve various word problems using linear functions, and the ability to perform operations using matrices
• To formulate linear programming problems and solve by graphing and the simplex algorithm.
• To employ set operations in counting techniques and apply them in calculating probability.
• To identify and solve a strictly determined game and calculate the expected value of a game with mixed strategy.
• To be able to understand basic concepts of Markov Chains
• To gain an understanding of graphs and trees

PREREQUESTS:    MATH 105 or satisfactory math placement. Students in the Department of Computer Sciences, Mathematics, and Engineering must use this course instead of MATH 154 as the general studies requirement.

TEXTBOOKS:    Required textbook(s):

Finite Mathematics by Jay Graening, Paul E. Long, Paula Grafteon Young, Tom Lee, Pearson

TENTATIVE COURSE TOPICS:

1. Introduction to Linear Systems (Chapters 1 and 2)
2. Matrix Algebra (Chapter 3)
3. Linear Programming (Chapters 4 and 5)
4. Logic, Sets, and Counting Techniques (Chapter 7)
5. Topics in Probability (Chapters 8 and 9)
6. Statistics (Chapter 10)
7. Markov Chains (Chapter 11)
8. Game Theory (Chapter 12)
9. Introduction to Graph Theory

GRADING:            Midterm Exam(s)/Quizzes 60%

                                Final Exam  20%

                                Assignments/Homeworks                          20%

-Before class meeting, every student should read chapter before coming class. Every student finish chapter exercise next meeting after the class finishes the chapter.

- No makeup for midterm exam(s) and final unless a verifiable reasons (see make-ups below)

- No make up for quizzes

A= 100- 90             B= 89-80                 C= 79-70                 D= 69-60                F= below 60

LATE WORK:      There will be a some reduction in grade per day for all assignments turned in after the due date unless a verifiable reason (see make-ups below) is provided for missing the due date or a new time has been approved in advance!!!

MAKE-UPS:          There will be no make-up of tests unless previously arranged with the instructor or an acceptable and verifiable reason for the absence. In general, acceptable reasons include:

1) An absence that is the result of an order from an attending physician or University health nurse, that directs the student not to attend class for health reason,

2) A death in the student’s immediate family,

3) Participation in an official University activity,

4) or an absence that the instructor considers an acceptable reason for missing class. See Attendance policy in the University catalog.

ATTENDANCE: In accordance with the course catalog.

THE INSTRUCTOR RESERVES THE RIGHT TO IMPROVE ANY PORTION OF THIS SYLLABUS AT ANY TIME.