DISKRETNA MATEMATIKA ZADACI PDF

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 .

Author: Nikoshura Felabar
Country: South Sudan
Language: English (Spanish)
Genre: Politics
Published (Last): 16 November 2004
Pages: 38
PDF File Size: 6.22 Mb
ePub File Size: 16.89 Mb
ISBN: 330-6-98851-680-2
Downloads: 23061
Price: Free* [*Free Regsitration Required]
Uploader: Meztilkree

Name of the course Discrete mathematics 1. Understand mathematical methods and physical laws applied in geodesy and geoinformatics. Studijski program preddiplomski, diplomski, integrirani. Optional literature at the time of submission of study programme proposal.

Informacije o e-kolegiju

Course enrolment requirements and entry competences required for the course Passed exams: Study programme undergraduate, graduate, integrated. Dostupnost putem ostalih medija. 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 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: Grading and evaluating student work in class and at the final exam.

Basics of Geoinformatics, Programming Competencies required: Bodovna vrijednost ECTS 5 1. Uvjeti za upis predmeta i ulazne kompetencije potrebne za predmet. Nadmetanja Registar sklopljenih ugovora Registar bagatelne nabave u Learning outcomes at the level of the programme to which the course contributes.

Activity on the system for e-learning. Availability via other media. Level of application of e-learning level 1, 2, 3percentage of online instruction max. Required literature available in the library and via other media.

  DIGNO DE CONFIANZA LDS PDF

In revising during lectures.

Become familiar with the language of computer science. Develop a sense of different degrees of mathematical rigor and formalism and learn to use them in problem solving tasks.

Naziv predmeta Diskretna matematika 1. Learning outcomes at the level of the programme to which the course contributes Understand mathematical methods and physical laws applied in geodesy and geoinformatics.

Status predmeta izborni 1. Naslovnica E-kolegiji Studiji Studij geodezije i geoinformatike – preddiplomski 6.

Matematikx implementation of a single university Questionnaire for evaluating teachers prescribed by the Senate. Student responsibilities Regular school attendance. Apply knowledge of mathematics and physics for the purpose of recognizing, formulating and solving of problems in the field of geodesy and geoinformatics.

Sažeti opis Diskretna matematika

Required literature available in the library and via other media Title Number of copies in the library Availability via other media Beban Brkic, J.: Distinguish parts of mathematics that studies finite systems, i. Registar bagatelne nabave u 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.

Pri ponavljanju gradiva na predavanjima. Study programme undergraduate, graduate, integrated Bachelor Study 1. Izmjene i dopune Plana nabave roba, radova i usluga za Uvod u teoriju grafovaElement, Zagreb, Quality assurance methods that ensure the acquisition of exit competences Class attendance.

Solving tasks during exercises. Status of the course elective 1. Learning outcomes expected at the level of the course 4 to 10 learning outcomes.

Studijski program preddiplomski, diplomski, integrirani preddiplomski 1. Mathematical logic 2h Sets and relations 2h Ordered sets and mashes 2h Applications in mtaematika 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: Argue the reasons why the characteristics of the computer are described within the framework of finite mathematical systems.

  AMARAVATI KATHALU PDF

Course djskretna broken down in detail by weekly class schedule syllabus. 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.

Dopunska literatura diskrretna trenutku prijave prijedloga studijskoga programa. Expected enrolment in the course some fifty 1. Interactive assignments and Seminar essays. Number of copies in the library. Year of the study programme Third, 6th semester 1.

Course enrolment requirements and entry competences required for the course. 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 djskretna 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,….

Credits ECTS 5 1. Quality assurance methods that ensure the acquisition of exit competences.