Discrete Mathematics
General data
Course ID:  0600IS11MDY  Erasmus code / ISCED:  11.101 / (unknown) 
Course title:  Discrete Mathematics  Name in Polish:  Matematyka dyskretna 
Department:  (in Polish) Instytut Informatyki  
Course groups: 
(in Polish) 1 rok 1 stopnia sem. letni Informatyka (in Polish) 3L stac. I st. studia informatyki  przedmioty obowiązkowe 

ECTS credit allocation (and other scores): 
5.00 view allocation of credits 

Language:  Polish  
Type of course:  obligatory courses 

Short description: 
Course objectives: To learn basic methods and tools of combinatorics, graph theory, and number theory and how one can use them in solving of computational problems. 

Full description: 
Course profile: General Academic Form of study: Fulltime studies Course type: Basic Year/semester of study: 1 / 2 Prerequisites (sequential system of courses and exams): Items introducing: Elements of Logic and Set Theory, Linear Algebra with Analytic Geometry, Mathematical Analysis 1, Lecture: 30 Exercise classes: 30 Teaching methods: Lectures. Exercise classes where students solve simple tasks and problems from combinatorics, graph theory, and number theory. ECTS credits: 5 Balance of student workload: Class attendance:  lecture 30h  exercise classes 30h Course preparation:  lecture 10h  exercise classes 15h Literature study: 5h Reports, homeworks: 10h Preparation for tests: 8h Preparation for the exam: 15h Exam duration: 2h Individual consultation with the teacher: 3h Student workload: Direct interaction with the teacher: 65, 2 ECTS Practical exercises: 45, 2 ECTS 

Bibliography: 
Bibliography: K.A.Ross, Ch.R.B.Wright, Matematyka dyskretna, PWN, Warszawa 1996 R.L.Graham, D.E.Knuth, O.Patashnik, Matematyka konkretna, PWN, Warszawa 1996 Z.Palka, A.Ruciński, Wykłady z kombinatoryki, WNT, Warszawa 1998 

Learning outcomes: 
Learning outcomes: The student knows mathematical tools necessary to construct and analyse algorithms. K_W01 The student knows basic notions of combinatorics, graph theory, and number theory. K_W01 The students can apply combinatorics, recurrence, and mathematical induction to solve simple computational problems. K_U02, K_U04 The student can apply the breathfirst search method to searching of the shortest path in a weighed graph. K_U06 The student understands the need of continual learning. K_K02 

Assessment methods and assessment criteria: 
Form of assessment: class tests and the final exam (written or oral). 
Classes in period "Academic year 2017/2018" (in progress)
Time span:  20171001  20180630 
see course schedule 
Type of class: 
Class, 30 hours more information
Lecture, 30 hours more information 

Coordinators:  Zenon Sadowski  
Group instructors:  Zenon Sadowski  
Students list:  (inaccessible to you)  
Examination:  Examination 
Copyright by University of Bialystok.