Scribd
Upload
96 views4 pages

MET CS248 Summer 2022 Syllabus

This document provides an overview of a Discrete Mathematics course including: the topics to be covered such as logic, counting, sets, relations, and graphs; course objectives of providing a survey of discrete math concepts needed for computer science; prerequisites of algebra and an intro CS course; policies on attendance, assignments, and academic conduct; and a tentative schedule outlining the topics and weeks. Grades will be based on a midterm, final, and assignments.

Uploaded by

TryMyTutor com (Trymytutor)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
96 views4 pages

MET CS248 Summer 2022 Syllabus

This document provides an overview of a Discrete Mathematics course including: the topics to be covered such as logic, counting, sets, relations, and graphs; course objectives of providing a survey of discrete math concepts needed for computer science; prerequisites of algebra and an intro CS course; policies on attendance, assignments, and academic conduct; and a tentative schedule outlining the topics and weeks. Grades will be based on a midterm, final, and assignments.

Uploaded by

TryMyTutor com (Trymytutor)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

DISCRETE MATHEMATICS

MET CS248 A1

Course Description:

Fundamentals of logic (the laws of logic, rules of inferences, quantifiers, proofs of theorems),
Fundamental principles of counting (permutations, combinations), set theory, relations and functions,
graphs, trees and sorting, shortest path and minimal spanning trees algorithms. Monoids and Groups.

Course Objectives

 Provide a survey of Discrete Mathematics, the study of finite systems, needed in computer
science.
 Further develop the mathematical concepts and technique which should serve as a
preparation for more advanced quantitative courses.

Prerequisites

 High school algebra


 One introductory computer science course (recommended).

Textbook

 Recommended not Required - "Mathematical Structure for Computer Science", Judith L.


Gersting, W. H. Freeman & Company. (Any edition). Available at Barnes & Noble or on-line
 Any old or new discrete math textbook will also do the job.

Courseware:

All course materials for this class and information about the instructor can be found on: Blackboard

BU Community COVID-19 Public Health Policies

All students returning to campus will be required to be vaccinated against COVID-19, and upload
information about their status (including applications for a medical or religious exemption or an
extension) to the Patient Connect portal. In addition to the vaccine requirement, students must follow
all other safety protocols, including the face covering policy, and screening, contact tracing, and
testing requirements. At the beginning of each class you will be asked to show a green Healthway
compliance badge on your mobile device to the instructor, and wear your face mask over your mouth
and nose at all times.
Class Policies

1) Attendance & Absences – Students are expected to attend and sit through the entire class
meetings. In case of an absence, the student is responsible to arrange for notes and missed
announcements. Three (3) or more absences may result in a withdrawal from the class.

2) Assignment Completion & Late Work – Late assignment submission is not allowed, unless a
permission is granted by the instructor prior to the deadline. Students should submit a physical
to the instructor by the due date. If the student is to be absent that day, completed
assignments should be submitted via email before class begins.

3) Academic Conduct Code – Cheating and plagiarism will not be tolerated in any Metropolitan
College course. They will result in no credit for the assignment or examination and may lead to
disciplinary actions. Please take the time to review the Student Academic Conduct Code:

http://www.bu.edu/met/metropolitan_college_people/student/resources/conduct/
code.html.

NOTE: [This should not be understood as a discouragement for discussing the material or your
particular approach to a problem with other students in the class. On the contrary – you
should share your thoughts, questions and solutions. Naturally, if you choose to work in a
group, you will be expected to come up with more than one and highly original solutions
rather than the same mistakes.]

Grading Criteria

 Midterm 35% - Wednesday, June 8th.


 Final 35% - Wednesday, June 29th.
 Assignments 30% - Due dates detailed on Blackboard

Class Meetings, Lectures & Assignments

Lectures, Readings, and Assignments subject to change, and will be announced in class as applicable
within a reasonable time frame.

WEEK TOPIC DESCRIPTION

1-2 Logic I. Statements and logical connectives; truth tables.


II. Predicates logic and Quantifiers
III. Proof techniques, the nature of mathematical theorems
and proofs; direct proof, proof by contraposition, by
contradiction; use of counterexamples; the principle of
mathematical induction

2-3 I. The notation of set theory - Subsets and the power set;
binary and unary operations on a set; set operations of
union, intersection, complementation, difference, and
Cartesian product
Sets
II. Demonstration of the denumerability of some sets and the
use of Cantor diagonalization method to prove the
uncountability; partition of a set

4-5 I. Binary relations as ordered pairs and verbal description;


the reflexive, symmetric, transitive and antisymmetric
properties of binary relations; the definition and
terminology about partial orderings; graphs of partially
Relations & ordered finite sets; the definition of equivalence relation
Functions and equivalence class
II. Functions; definition and examples; properties of
functions one-t-one, onto, bijective; function composition,
inverse function

6 I. Counting; fundamental counting principles, including the


multiplication and addition principles
II. Sampling and selecting
Combinatorics III. Permutations and combinations; formulas for counting the
number of permutations and combinations of k-objects
from n distinct objects

8 Midterm Examination

7-9 I. Graph terminology; undirected graphs, simple, complete,


path, cycle, adjacency matrix, connectivity; Euler’s path
and Hamiltonian circuit; graph representation, trees
Graphs
II. Digraphs and connectivity problems - Reachability matrix
analysis; Warshall’s algorithm
10 - 11 I. Discussion and Definition; similarities between
propositional logic and set theory; mathematical structures
as models or abstractions incorporating common
properties found in different contexts
Boolean Algebra
II. Logic circuits; basic logic elements of AND gate, OR gate
& Computer
and inverter; representation of a Boolean expression as a
Logic
combinational network and vice versa; procedure to find a
canonical sum-of-product Boolean expressions using
Karnaugh map or Boolean algebra properties

11 - 12 I. Definition of binary operation and structure; discussion of


the associative, commutative, identity and inverse
properties; definition of semigroup, monoid, and a
substructure
Algebraic
II. Group structure; elementary group theorems, uniqueness
Structures
of identity and inverse; cancellation laws; definition and
properties of a subgroup; application to error correcting
codes

13 I. Definition of FSM; state tables and state graphs


II. FSM as transducers and recognizers
Finite State
III. Discussion of limitations of FSMs; introduction to formal
Machines
languages

14 Final Examination

You might also like