Scribd
Upload
66 views6 pages

MTH 136fall2021 Syllabus

This document provides information about the MTH 136 - Discrete Mathematics course. It outlines the course description, goals, requirements, evaluation methods, content, and homework assignments. The course introduces concepts of discrete structures including sets, relations, functions, graphs, trees, and methods of proof. Students will learn to apply problem solving and critical thinking skills to solve applied problems. Assessment includes homework, proofs, quizzes, presentations, midterm and final exams. The course follows chapters from the textbook Discrete Mathematics and Its Applications.

Uploaded by

Edgar Chisholm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
66 views6 pages

MTH 136fall2021 Syllabus

This document provides information about the MTH 136 - Discrete Mathematics course. It outlines the course description, goals, requirements, evaluation methods, content, and homework assignments. The course introduces concepts of discrete structures including sets, relations, functions, graphs, trees, and methods of proof. Students will learn to apply problem solving and critical thinking skills to solve applied problems. Assessment includes homework, proofs, quizzes, presentations, midterm and final exams. The course follows chapters from the textbook Discrete Mathematics and Its Applications.

Uploaded by

Edgar Chisholm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

MTH 136 – Discrete Mathematics

Instructor: Professor Brooke Orosz


Phone Number: (631) 327-5513
Email: [email protected]

Course Description: This is a course in finite mathematical structures relevant to computer


science and computer information systems. Topics include sets, relations, functions, graphs,
trees, methods of proof including mathematical induction, Boolean algebras and their use in
circuit design, elementary combinatorics, coding theory and formal languages.

General Education Goals: The aggregate of the core courses required for any major at ECC have
the following goals:

1. Students will communicate effectively in both speech and writing.


2. Students will apply appropriate mathematical and statistical concepts and operations to
interpret data and to solve problems.
3. Students will apply the scientific method of inquiry to draw conclusions based on verifiable
evidence, use scientific theories and knowledge to understand the natural world, and
explain the impact of scientific theories, discoveries and technological changes on society.
4. Students will use critical thinking and problem solving skills in analyzing information
gathered through different media and from a variety of sources.
5. Students will use social science theories and concepts to analyze human behavior and social
and political institutions.
6. Students will analyze works of the literary, visual or performing arts.
7. Students will analyze historical events and movements in western and non-western societies
and assess their subsequent significance.
8. Students will analyze the implications of commonalities and differences among culturally
diverse peoples.
9. Students will recognize, analyze and assess ethical issues and situations.
Measurable Course Performance Objectives (MPOs): Upon successful completion of this
course, students should specifically be able to do the following:
1. Demonstrate knowledge of the fundamental concepts and theories of discrete mathematics:
(GEG 2)

1.1 Describe and correctly use structures such as graphs, trees and Boolean algebras;
1.2 Identify computable problems and model them using formal language theory.
2. Utilize various discrete math problem-solving and critical-thinking techniques to set up and
solve applied problems in finance, economics, geometry, sciences, and other fields; (GEG 2)

2.1 Solve counting problems using combinatorics


2.2 Use or construct algorithms and determine algorithm efficiency.
3. Communicate accurate mathematical terminology and notation in written and/or oral form
in order to explain strategies to solve problems as well as to interpret found solutions.
(GEG 1, GEG 2)

3.1 Interpret and write proofs using formal logic


3.2 Use the language of mathematics to describe sets, number systems and relations
between mathematical objects.

Methods of Instruction: Instruction will consist of a combination of lectures, class discussion,


group work, individual study/projects, and computer/calculator projects.

Outcomes Assessment: All test and exam questions are blueprinted to course objectives. Data
is collected and analyzed to determine the level of student performance on these assessment
instruments in regards to meeting course objectives. The results of this data analysis are used
to guide necessary pedagogical and/or curricular revisions.

Course Requirements:
1. Regular attendance.
2. Completing homework on time.
3. Developing a portfolio of complete, valid proofs. Rewriting is permitted.
4. Taking quizzes, tests and exams in class as required or making up quizzes, tests or exams if
permitted by the instructor.

Methods of Evaluation: Final course grades will be computed as follows:


% of
Grading Components final course grade

 Homework and Proof Portfolio 7%


 Proof Portfolio 8%
 5-6 quizzes 20%
 Presentations 10%
 Midterm Exam 25%

 Final Exam 30%

Video proctoring for quizzes and tests is required.

Academic Integrity: Dishonesty disrupts the search for truth that is inherent in the learning
process and so devalues the purpose and the mission of the College. Academic dishonesty
includes, but is not limited to, the following:
 plagiarism – the failure to acknowledge another writer’s words or ideas or to give
proper credit to sources of information;

 cheating – knowingly obtaining or giving unauthorized information on any test/exam or


any other academic assignment;

 interference – any interruption of the academic process that prevents others from the
proper engagement in learning or teaching; and

 fraud – any act or instance of willful deceit or trickery.

Violations of academic integrity will be dealt with by imposing appropriate sanctions. Sanctions
for acts of academic dishonesty could include the resubmission of an assignment, failure of the
test/exam, failure in the course, probation, suspension from the College, and even expulsion
from the College.

Course Content Outline: based on the text Discrete Mathematics and its Applications, 7th
edition, by K. Rosen; published by McGraw-Hill; ISBN #: 978-0-07-338309-5

Class Meeting
(80 minutes) Chapter/Section

CHAPTER 1 THE FOUNDATIONS: LOGIC AND PROOFS, SETS AND FUNCTIONS


1 1.1 Logic
2 1.4 Predicates and Quantifiers
3 1.7 Introduction to Proofs, Packet
4 1.8 Proof Methods and Strategy

Chapter 1 Quiz

CHAPTER 2 BASIC STRUCTURES: SETS, FUNCTIONS, SEQUENCES, AND SUMS


5 2.1 Sets
2.2 Set Operations
6 2.3 Functions
2.4 Sequences and Summations
7 2.5 Cardinality of Sets
2.6 Matrices

Chapter 2 Quiz

CHAPTER 3 THE FUNDAMENTALS: ALGORITHMS, THE INTEGERS, AND MATRICES


8 3.1 Algorithms
3.3 Complexity of Algorithms
4.1 Divisibility and Modular Arithmetic
9 4.2 Integer Representations and Algorithms
4.3 Primes and Greatest Common Divisors
Chapter 3/4 Quiz
CHAPTER 5 MATHEMATICAL REASONING, INDUCTION, AND RECURSION
10 5.1 Mathematical Induction
11 5.2 Strong Induction and Well Ordering
12 5.3 Recursive Definitions and Structural Induction

13 Review for Midterm


14 Midterm Exam

CHAPTER 6 COUNTING
15 6.1 The Basics of Counting
6.2 The Pigeonhole Principle
16 6.3 Permutations and Combinations

Chapter 6 Quiz

CHAPTER 9 RELATIONS
17 9.1 Relations and Their Properties
18 9.3 Representing Relations
19 9.5 Equivalence Relations

Chapter 9 Quiz

CHAPTER 10 GRAPHS
20 10.1 Graphs and Graph Models
21 10.2 Graph Terminology and Special Types of Graphs
22 10.3 Representing Graphs and Graph Isomorphism
10.4 Connectivity
Chapter 10 Quiz

CHAPTER 11 TREES
23 11.1 Introduction to Trees
24 11.2 Applications of Trees

Chapter 11 Quiz

CHAPTER 13 MODELING COMPUTATION


26 13.1 Languages and Grammars
27 13.2 Finite-State Machines with Output
28 13.4 Language Recognition

29 Review for Final Exam


Comprehensive Final Exam on all course material covered
List of assigned homework problems:
1.1 # 3, 4, 7, 9, 13
1.3 # 1abc, 5, 9abc, 11ab
1.4 # 1, 5, 11, 19, 21
2.1 # 1, 3, 9, 13, 14
2.2 # 1, 3, 4, 5
2.3 # 1, 2, 5, 9, 12, 13,
2.4 # 1, 3, 9, 13, 31
2.5 # 1
2.6 # 1, 2, 3, 4
3.1 # 35, 53
3.3 # 19, 21
4.1 # 1, 3, 9, 28, 31,
4.2 # 1, 3, 5, 9
4.3 # 1, 3, 33, 35
5.3 # 1, 3, 5
6.1 # 1, 3, 12, 21, 33
6.2 # 1, 3, 5, 15, 21
6.3 # 1, 5, 6, 15, 17, 27, 31
9.1 # 3, 5, 6, 8, 42
9.3 # 1, 3, 5, 7, 11
9.5 # 1, 3, 5, 9, 13, 24, 26
10.1 # 3, 5, 7, 9, 15, 24
10.2 # 1, 3, 5, 21, 23, 25, 26
10.4 # 1, 3, 5, 11, 19, 21
11.1 # 1, 3, 9
11.2 # 1, 7, 11, 13
13.1 # 3, 13, 17, 19
13.2 # 1, 2, 3, 5, 7, 18
13.3 # 1, 3, 5, 11, 17, 23

Proofs:
For Midterm:
1.7 # 1, 2, 6, 9, 16, 20, 23
1.8 # 2, 6, 11, 13, 29, 44
4.1 # 4, 8, 36

For Final:
5.1 # 1, 3, 4, 7, 14, 18, 20
5.2 # 4, 6, 7, 10
5.3 # 12, 13
Reading Packet
NOTE: Proofs may be revised and resubmitted for full credit. Regular homework will be subject to
a 10% late penalty, with no credit if more than 2 weeks late.

You might also like