Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
YBS 252DISCRETE MATHEMATICAL STRUCTURES3 + 05th Semester5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Elective
Course Objective Purpose of this course is to teach fundamental concepts of Discrete Mathematical Structures.
Course Content Methods of proofs. Sets and subsets. Properties of sets and relations on sets. Counting principles, pigeonhole principle, permutations and combinations. Recurrence relations. Matrices and matrix representations of relations. Directed graphs, Hasse diagrams, Lattices. Boolean algebras and properties of Boolean algebras.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Lists basic concepts of sets
2Defines basic metods of proofs
3Defines principles of counting
4Recognizes relations and digraphs
5Explains properties of Hasse diagrams and lattices
6Lists properties of Boolean algebras

COURSE'S CONTRIBUTION TO PROGRAM
Data not found.

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)13452
Hours for off-the-classroom study (Pre-study, practice)13452
Mid-terms11313
Final examination11313
Total Work Load

ECTS Credit of the Course






130

5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2017-2018 Spring1SEZAİ TOKAT


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
YBS 252 DISCRETE MATHEMATICAL STRUCTURES 3 + 0 1 Turkish 2017-2018 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Prof. Dr. SEZAİ TOKAT stokat@pau.edu.tr Course location is not specified. %70
Goals Purpose of this course is to teach fundamental concepts of Discrete Mathematical Structures.
Content Methods of proofs. Sets and subsets. Properties of sets and relations on sets. Counting principles, pigeonhole principle, permutations and combinations. Recurrence relations. Matrices and matrix representations of relations. Directed graphs, Hasse diagrams, Lattices. Boolean algebras and properties of Boolean algebras.
Topics
WeeksTopics
1 Set Theory, set operations
2 Relations
3 Functions and Algoritms
4 Propositional logic
5 Predicate logic
6 Predicate logic. Formal and informal proofs
7 Techniques of counting
8 Advanced Counting Techniques, Recursion
9 MIDTERM
10 Graph Theory
11 Directed Graphs
12 Binary Trees
13 Properties of the Integers
14 Ordered Sets and Lattices
Materials
Materials are not specified.
Resources
ResourcesResources Language
Seymour Lipschutz, Marc Lipson, Schaums Outline of Theory and Problems of DISCRETE MATHEMATICS, third edition, McGRAW-HIL, 2007.Türkçe
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam60Final Exam
Midterm Exam40Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes