MAT 144 GENERIC COURSE SYLLABUS

  Effective Date: Fall 2004
Instructor: Campus: Room:
Office Hours: Phone:
I.
Course Prefix
Course Number
Course Name
Credit
Lecture
Lab
 
MAT
144
Discrete
Mathematics
3
3
0
 
II. Prerequisites:

MAT 140, College Algebra, with a grade of C or better or an appropriate score on the OCC Mathematics Assessment Test.

III. Course Description:
Course introduces concepts of discrete Mathematics. Content includes mathematical induction and recursion; set theory; relations and functions; logic, combinatorics, graph theory and trees; Boolean Algebra, probability, matrices and analysis of algorithms.
IV. Course Objectives:

 

A. Understand and use the concepts of sets and graphics.

 

B. Understand and apply the rules of symbolic logic.

 

C. Understand the properties of functions and relations.

 

D. Understand and apply proof by mathematical induction.

 

E. Understand and apply recursions in problem solving.

 

F. Use counting theory and probability in problem solving.

 

G. Use the fundamentals of graphs and trees to solve a variety of problems.

 

H. Analyze and determine machine run time of algorithms.

 

I.  Use technology to facilitate problem solving.

V. Academic Integrity:
 

Students, Faculty and administration at Oakton Community College are required to demonstrate academic integrity and follow Oakton's Code of Academic Conduct. This code prohibits:

  • cheating,
  • plagiarism (turning in work not written by you or lacking proper citation),
  • falsification and fabrication (lying or distorting the truth),
  • helping others to cheat,
  • making unauthorized changes in official documents,
  • pretending to be someone else or having someone else to pretend to be you,
  • making or accepting bribes, special favors, or threats, and any other behavior that violates academic integrity.
 

There are serious consequences to violations of the academic integrity policy. Oakton's policies and procedures provide students with a fair hearing if a complaint is made. If you are found to have violated the policy, the minimum penalty is failure on the assignment and a disciplinary record will be established and kept on file in the office of the Vice President for Student Affairs for a period of 3 years.

 

Details of the Code of Academic Conduct can be found in the Student Handbook.

   
VI. Outline of Topics:

 

A. Set theory

 

B. Logic

 

C. Combinatorics

 

D. Probability

 

E. Relations and Functions

 

F. Graph Theory and Trees

 

G. Algorithms

VII. Methods of Instruction:

(To be completed by instructor)

Methods of presentation can include lectures, discussion, demonstration, experimentation, audiovisual aids, group work, and regularly assigned homework. A TI-83 graphics calculator will be used for instructional purposes.  Other technology will be used when appropriate.
VIII. Course Practices Required:

(To be completed by instructor)

 Course practices can include attendance, assignments, special projects, classroom activities and assessments.

IX. Instructional Materials:

Required Textbook:
Discrete Mathematics with Applications, Third Edition, by Susanna Epp.  Brooks/Cole, Thomson Learning, 2003.  ISBN: 0-534-35945-0

ISBN: 9780534359454

Required Materials: A TI-83 graphics calculator.

X.

Methods of Evaluating Student Progress:

(To be determined and announced by the instructor)

Evaluation methods can include assignments, quizzes, chapter or major tests, individual or group projects, computer assignments and/or a final examination.

XI.

Other Course Information:

Individual instructors will establish and announce specific policies regarding attendance, due dates and make-up work, incomplete grades, etc.

If you have a documented learning, psychological, or physical disability you may be entitled to reasonable academic accommodations or services. To request accommodations or services, contact the ASSIST office in Instructional Support Services. All students are expected to fulfill essential course requirements. The College will not waive any essential skill or requirement of a course or degree program.

Effective Beginning Term:

Fall
2004

Ending Term:

 
(term)
(year)
 
(term)
(year)
Prepared by:

S. Stock (Chair), S. Hamed, J. Hassett, G. McClarren, N. Ressler, J. Strehler, T. Wang

Date:

Reviewed by Department/
Program Chair

Bob Sompolski Date:
Approved by Dean: Joe Kotowski

Date:

oakton home division two home sompolski, chair of math department department of math and computer science home