Scribd
Upload
12 views

MATH211-Syllabus

Uploaded by

mibib18138
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
12 views

MATH211-Syllabus

Uploaded by

mibib18138
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/ 3

DISCRETE MATHEMATICS – MATH211

FALL 2024-2025

Instructo : Assist. Prof. Dr. Oya MERT COŞKUN


r e-mail : [email protected]
Lecture hours : Monday/Tuesday: 15:40-17:30

Course
Description

Logic: propositional logic, logical equivalence, predicates & quantifiers, and logical
reasoning. Sets: basics, set operations. Functions: one-to-one, onto, inverse, composition,
graphs. Integers: greatest common divisor, Euclidean algorithm. Sequences and
Summations. Mathematical reasoning: Proof strategies, Mathematical Induction,
Recursive definitions, Structural Induction. Counting: basic rules, Pigeon Hall principle,
Permutations and combinations, Binomial coefficients, and Pascal triangle. Probability:
Discrete probability. Expected values and variance. Relations: properties, Combining
relations, Closures, Equivalence, partial ordering. Graphs, directed, undirected graphs.

Textbook: Seymour Lipschutz, Marc Lars Lipson (2007), Theory and Problems of
Discrete Mathematics, 3rd edition, Schaum’s Outline Series, McGraw-Hill, New York
Keneth H. Rosen (1999), Discrete Mathematics and Its Applications, 4th edition, WCB
McGraw-Hill.

Other References:
(1) Efim Kinber, Carl Smith (2001), Mathematical Theory of Computation, Prentice
Hall, Upper Saddle River, NJ.
(2) Seymour Lipschutz, Marc Lars Lipson (2007), Theory and Problems of Discrete
Mathematics, 3rd edition, Schaum’s Outline Series, McGraw-Hill, New York

Objectives:
1. It provides basic concepts and techniques of discrete mathematics related to
computation
2. It attempts to clarify basic concepts of logic, propositional logic, set theory,
functions, arrays, counting, relations, algorithms and complexity analysis,
applications of number theory, mathematical causality, induction and
recursion
3. It aims to explain graph theory, shortest path problems, tree structures,
sorting and searching algorithms, and their applications.

Outcomes:
1- Awareness of the need for lifelong learning, ability to access information,
follow developments in science and technology, and continuous self-
renewability
2- Awareness of Entrepreneurship, innovation, and sustainable development
3- An ability to identify, formulate, resolve, and apply complex information
systems engineering problems
4- An ability to apply modern techniques to design a complex system, process,
or product to meet desired requirements
5- An ability to design and conduct experiments, collect outcomes, as well as
analyze and interpret experimental data/outcomes
COURSE
PLAN

Week Topics
1 Administrivia, Propositional logic.
2 Propositional logic.
3 Predicate logic.
4 Predicate logic. Formal and informal proofs
5 Informal proofs
6 Sets and set operations
7 Sets and set operations (cont.), Functions
8 Midterm Exam
9 Functions
10 Sequences and summations.
11 Countable and uncountable sets. Matrices.
12 Matrices. Integers and division
13 Counting: basic counting rules.
14 Counting: permutations, combinations.

Assessment

Criteria: Midterm Quantity: Percentage: % 60


1
Exam Percentage: % 40
Quantity:
Final Exam 1

All announcements will be made on the following website:

https://uzem.altinbas.edu.tr/course/

You might also like