COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
CENG 106DISCRETE MATHEMATICAL STRUCTURES3 + 02nd Semester4

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Compulsory
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
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 01542 1 322   
LO 02542 1 322   
LO 03542 1 322   
LO 04542 1 322   
LO 05542 1 322   
LO 06542 1 322   
Sub Total302412 6 181212   
Contribution542010322000

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

ECTS Credit of the Course






104

4

COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2014-2015 Spring1NECDET GÜNER

Course Details
Course Code:  CENG 106 Course Title:  DISCRETE MATHEMATICAL STRUCTURES
L+P Hour : 3 + 0   Course Code : 1   Language Of Instruction: Turkish Course Semester :  2014-2015 Spring
Course Coordinator :  PROFESSOR NECDET GÜNER E-Mail:  nguner@pau.edu.tr Phone Number : 
Course Location MUH A03153,
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.
Attendance : %
Topics
WeeksTopics
1 Logic and proof (induction)
2 Sets and functions
3 Matrices
4 Counting (Pigeon hole, permutations and combinations)
5 Advanced counting techniques
6 Advanced counting techniques
7 Relations on sets
8 Representing Relations. Directed graphs
9 Hasse diagrams
10 Euler and Hamiltonian Graphs
11 Euler and Hamiltonian Graphs
12 Boolean Algebra
13 Boolean Algebra
14 Review of semester
Materials
Materials are not specified.
Resources
ResourcesResources Language
Discrete Mathematical Structures, Kolman, Bushby & RossEnglish
Discrete Mathematics and its Applications, RosenEnglish
Discrete Mathematics, Schaum's Series English
Discrete Mathematical Structures, Kolman, Bushby & RossEnglish
Discrete Mathematics and its Applications, RosenEnglish
Discrete Mathematics, Schaum's Series English
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam50Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes
© 2021 PAU