PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
CENG 106	DISCRETE MATHEMATICAL STRUCTURES	3 + 0	2nd Semester	4

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.

COURSE LEARNING OUTCOMES

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

COURSE'S CONTRIBUTION TO PROGRAM

	PO 01	PO 02	PO 03	PO 04	PO 05	PO 06	PO 07	PO 08	PO 09	PO 10	PO 11	PO 12
LO 001	5	4	2		1		3	2	2
LO 002	5	4	2		1		3	2	2
LO 003	5	4	2		1		3	2	2
LO 004	5	4	2		1		3	2	2
LO 005	5	4	2		1		3	2	2
LO 006	5	4	2		1		3	2	2
Sub Total	30	24	12		6		18	12	12
Contribution	5	4	2	0	1	0	3	2	2	0	0	0

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION

Activities	Quantity	Duration (Hour)	Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)	14	3	42
Hours for off-the-classroom study (Pre-study, practice)	14	2	28
Assignments	2	6	12
Mid-terms	1	10	10
Final examination	1	12	12
Total Work Load ECTS Credit of the Course			104 4

COURSE DETAILS

Select Year

Course Details

Course Code	Course Title	L+P Hour	Course Code	Language Of Instruction	Course Semester	Mode of Delivery
CENG 106	DISCRETE MATHEMATICAL STRUCTURES	3 + 0	1	Turkish	2014-2015 Spring	Face to Face

Course Coordinator	E-Mail	Phone Number	Course Location	Attendance
			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.

Topics

Weeks	Topics
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

Resources	Resources Language
Discrete Mathematics, Schaum's Series	English
Discrete Mathematical Structures, Kolman, Bushby & Ross	English
Discrete Mathematics and its Applications, Rosen	English

Course Assessment

Assesment Methods	Percentage (%)	Assesment Methods Title
Final Exam	50	Final Exam
Midterm Exam	50	Midterm Exam

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes

Prospective Student