TYPE OF COURSE UNIT	Compulsory Course
LEVEL OF COURSE UNIT	Bachelor's Degree
YEAR OF STUDY	2
SEMESTER	Third Term (Fall)
NUMBER OF ECTS CREDITS ALLOCATED	6
NAME OF LECTURER(S)	Professor Nizami Gasilov
LEARNING OUTCOMES OF THE COURSE UNIT	At the end of this course, the students; 1) Represent the propositions using logical connectives and interpret symbolic expressions. 2) Determine is a mathematical argument correct or not. 3) Develop the knowledge on recursively-defined structures 4) Gain the ability to think algorithmically. 5) Have theoretical knowledge on Equivalence relations and Partial orders; solve related application problems. 6) Learn the basic principles of counting and advanced counting techniques. 7) Obtain information about basic concepts, methods and applications of graph theory. 8) Apply discrete structures and related methods to solve problems in Computer Engineering.
MODE OF DELIVERY	Face to face
PRE-REQUISITES OF THE COURSE	No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT	None
COURSE DEFINITION	Logic. Logical operations and laws of logic, quantifiers and proofs of theorems. Sets. Subsets and operations on sets. Principles of counting. Inclusion-exclusion and pigeon-hole principles. Integers, mathematical induction. Relations and functions. Operations on relations. Partially ordered sets. Lattices. Boolean algebras. Graphs. Euler and Hamiltonian paths and circuits. Trees. Binary trees, spanning trees. Tree searching. Elements of coding theory.
COURSE CONTENTS	WEEK TOPICS 1st Week Logic 2nd Week Logical operations and laws of logic, quantifiers and proofs of theorems 3rd Week Sets 4th Week Subsets and operations on sets 5th Week Principles of counting 6th Week pigeon-hole principles 7th Week Integers, mathematical induction 8th Week Mid-term 9th Week Relations and functions 10th Week Partially ordered sets and Lattices 11th Week Boolean algebras 12th Week Graphs 13th Week Euler and Hamiltonian paths and circuits 14th Week Trees, Binary trees, spanning trees, Tree searching, Elements of coding theory
RECOMENDED OR REQUIRED READING	1. Rosen K.H., Discrete Mathematics and Its Applications, 6/E, McGraw-Hill, 2007 2. Kolman B., Busby R.C., Ross S., Discrete Mathematical Structures, 5/E, Prentice Hall, 2004 3. Grimaldi R.P., Discrete and Combinatorial Mathematics, 5/E, Addison Wesley, 2003
PLANNED LEARNING ACTIVITIES AND TEACHING METHODS	Lecture,Questions/Answers,Presentation,Report Preparation,Project,Experiment,Practice
ASSESSMENT METHODS AND CRITERIA	Quantity Percentage(%) Mid-term 1 30 Assignment 8 15 Quiz 4 15 Total(%) 60 Contribution of In-term Studies to Overall Grade(%) 60 Contribution of Final Examination to Overall Grade(%) 40 Total(%) 100
ECTS WORKLOAD	Activities Number Hours Workload Midterm exam 1 1,5 1,5 Preparation for Quiz 4 4 16 Individual or group work Preparation for Final exam 1 40 40 Course hours 14 4 56 Preparation for Midterm exam 1 30 30 Laboratory (including preparation) Final exam 1 2 2 Homework 8 3,5 28 Quiz 4 ,5 2 Total Workload 175,5 Total Workload / 30 5,85 ECTS Credits of the Course 6
LANGUAGE OF INSTRUCTION	English
WORK PLACEMENT(S)	No