Diskretna matematika. views Diskretna matematika Published in: . Us diskretna matematika sa zbirkom zadataka – staro izdanje. Title Slide of riješeni-zadaci-više-matematike-prvi-dio-boris-apsen Diskretna matematika. Mario Kasa. Rešenja zadataka. Get this from a library! Diskretna matematika: osnovi kombinatorike i teorije grafova: zbirka rešenih zadataka. [Dragan Stevanović; Marko Milošević; Vladimir .
|Published (Last):||7 March 2012|
|PDF File Size:||9.70 Mb|
|ePub File Size:||4.9 Mb|
|Price:||Free* [*Free Regsitration Required]|
Registar bagatelne nabave u Year of the study programme Third, 6th semester 1. Naslovnica E-kolegiji Studiji Studij geodezije i geoinformatike – preddiplomski 6. Mathematical logic 2h Sets and relations 2h Ordered sets and mashes 2h Applications in informatics 2h Introduction to combinatorics counting techniques 4h Recursive functions 1h Applications in informatics 2h 1st preliminary exam 1h Dirichlet principle; Generating functions; Ramsey’s theorem 2h Boolean algebra definition and properties, Boolean functions 2h Graphs paths and cycles 2h Directed graphs 2h Graph colourings 2h Applications in informatics 2h Film: Basics of Geoinformatics, Programming Competencies required: Required literature available in the library and via other media Title Number of copies in the library Availability via other media Beban Brkic, J.: Studijski program preddiplomski, diplomski, integrirani preddiplomski 1.
Credits ECTS 5 1. Become familiar with the language of computer science. Name of the course Discrete mathematics 1.
Student responsibilities Regular school attendance. Learning outcomes expected at the level of the course 4 to 10 learning outcomes.
Uvod u teoriju grafovaElement, Zagreb, Learning outcomes at the level of the programme to which the course contributes. Studijski program preddiplomski, diplomski, integrirani.
Naziv predmeta Diskretna matematika 1. Activity on the system for e-learning. Uvjeti za upis predmeta i ulazne kompetencije potrebne za predmet. Develop a sense of different degrees of mathematical diskretnq and formalism and learn to use them in problem solving tasks.
Number of copies in the library. Izmjene i dopune Plana nabave roba, radova i usluga za Grading and evaluating student work in class and at the final exam. Course content broken down in detail by weekly class schedule syllabus Mathematical logic 2h Sets and relations 2h Ordered sets and mashes 2h Applications in informatics 2h Introduction to combinatorics counting techniques 4h Recursive functions 1h Applications in informatics 2h zxdaci preliminary exam 1h Dirichlet principle; Generating functions; Mtaematika theorem 2h Boolean algebra definition and properties, Boolean functions 2h Graphs paths and cycles 2h Directed graphs 2h Graph colourings 2h Applications in informatics 2h Film: Use information technology in solving geodetic and geoinformation tasks Exercise appropriate judgements on the basis of performed calculation processing and interpretation of data obtained by means of surveying and its results.
Expected enrolment in the course some fifty 1. Pri ponavljanju gradiva na predavanjima.
Sažeti opis Diskretna matematika
Argue the reasons why the characteristics of the computer are described within the framework of finite mathematical systems.
Apply knowledge of mathematics and physics for the purpose of recognizing, formulating and solving of problems in the field of geodesy and geoinformatics. Learning outcomes expected at the level of the course 4 to 10 learning outcomes recognize and apply basic types of mathematical reasoning; define and classify binary relations on sets knowing their properties and typical examples; pronounce and apply the properties of relations in systems for data processing and for the development of functional algorithms; adopt basic combinatorial concepts and counting rules and recognize them when counting the elements of a finite set; determine the generating function of the starting sequence and identify and solve simple recurrence relations; apply the theory of Boolean algebra to design logic circuits and networks; distinguish the basic concepts of graph theory; Compare and model certain combinatorial problems using graph theory shortest path algorithm, nearest neighbor algorithm,….
Study programme undergraduate, graduate, integrated Bachelor Study 1. Bodovna vrijednost ECTS 5 1. Level of application of e-learning level 1, 2, 3percentage of online instruction max.
Informacije o e-kolegiju
Dostupnost putem ostalih medija. Course enrolment requirements and entry competences required for the course. Take responsibility for continuing academic development in the field of geodesy and geoinformatics, or related disciplines, and for the development of interest in lifelong learning and further professional education. Optional literature at the time of submission of study programme maematika.
Interactive assignments and Seminar essays. Distinguish parts of mathematics that studies finite systems, i. The implementation of a single university Questionnaire for evaluating teachers prescribed by the Senate. Required literature available in the library and via other media.