Hitra povezava do Youtube kanala UM
SLO | EN
Nazaj

Objectives and competences

With the usage of modern object oriented programming language, to deepen the knowledge of the basic approaches, data structures and algorithms for solving mathematical problems.

Content (Syllabus outline)

The contents of this subject is adjusted to the current needs and development. We will deepen the knowledge of using a computer to solve mathematical problems, mainly from discrete mathematics. - relations and algorithms on relations - Bool algebra - matchings in graphs

Learning and teaching methods

? Lectures, seminary ? Computer exercises

Intended learning outcomes - knowledge and understanding

Transferable/Key Skills and other attributes: ? the usage of mathematical notions in applications ? the usage of appropriate data structures while implementing mathematical algorithms ? the obtained knowledge is transferable to the other computer science oriented subjects

Readings

B. Vilfan, Osnovni algoritmi, ISBN 961-6209-13-2, Založba FER in FRI, 2. izd., 2002. Kenneth H. Rosen, Discrete Mathematics and Its Applications, ISBN 007-2880-08-2, McGraw-Hill, 6th ed., 2007. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, ISBN 026-2032-93-7, The MIT Press, 2nd ed., 2001.

Additional information on implementation and assessment

Type (examination, oral, coursework, project): Seminary work Written exam – theoretical part Project – practical part Each of the mentioned commitments must be assessed with a passing grade. Passing grade of the seminary work and project is required for taking the exam.

  • doc. dr. ANDREJ TARANENKO

  • Written examination: 40
  • Project: 40
  • Seminar paper: 20

  • : 45
  • : 15
  • : 45
  • : 165

  • Slovenian
  • Slovenian

  • MATHEMATICS - 1st
  • MATHEMATICS - 2nd