Faculty of Science and Mathematics / COMPUTER SCIENCE / CRYPTOGRAPHY

Course:CRYPTOGRAPHY/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12082Obavezan153+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites Enrolling in this course is not conditioned by passing other courses.
Aims The aim of the course is introducing students to basics of symmetric and asymmetric cryptography.
Learning outcomes On successful completion of this course, students will be able to: 1. Understand and apply definitions and propositions of Number theory 2. Understand basic propositions and algorithms of classic cryptography 3. Understand the notions of asymmetric cryptography and public and private key 4. Understand and apply algorithms of asymmetric cryptography 5. Understand the notion of digital signature, and implement digital signatures
Lecturer / Teaching assistantprof. dr Vladimir Božović
MethodologyLectures, exercises, consultations, group projects
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lecturesIntroduction to cryptography. History of cryptography. Basic substitution algorithms. Introduction to cryptoanalysis.
I week exercisesIntroduction to cryptography. History of cryptography. Basic substitution algorithms. Introduction to cryptoanalysis.
II week lecturesDivisibility. Euclids algorithm.
II week exercises Divisibility. Euclids algorithm.
III week lecturesPrime numbers and factorization. Modular arithmetic.
III week exercisesPrime numbers and factorization. Modular arithmetic.
IV week lecturesChinese remainder theorem. Diophantine equations.
IV week exercisesChinese remainder theorem. Diophantine equations.
V week lecturesBasic algebraic structures. Group, ring, field. System of remainders as a modular ring.
V week exercisesBasic algebraic structures. Group, ring, field. System of remainders as a modular ring.
VI week lecturesArithmetic functions. Fermats and Eulers theorem.
VI week exercisesArithmetic functions. Fermats and Eulers theorem.
VII week lecturesSymmetric cryptography. Examples of symmetric crypto-systems.
VII week exercisesSymmetric cryptography. Examples of symmetric crypto-systems.
VIII week lecturesAsymmetric cryptography. Problem of discrete logarithm in a finite field. Diffie-Hellman algorithm.
VIII week exercisesAsymmetric cryptography. Discrete logarithm problem in a finite field. Diffie-Hellman algorithm.
IX week lecturesMid-term exam. ElGamal algorithm. Complexity of the discrete logarithm problem.
IX week exercisesMid-term exam. ElGamal algorithm. Complexity of the discrete logarithm problem.
X week lecturesBaby step-Giant step algorithm for computing the discrete logarithm. Chinese remainder theorem. Scheme of the Pohlig-Hellman algorithm.
X week exercisesBaby step-Giant step algorithm for computing the discrete logarithm. Chinese remainder theorem. Scheme of the Pohlig-Hellman algorithm.
XI week lecturesFactorization in cryptography. Eulers formula and roots modulo pq. Introduction to the RSA algorithm.
XI week exercisesFactorization in cryptography. Eulers formula and roots modulo pq. Introduction to the RSA algorithm.
XII week lecturesImplementation of RSA. Security questions for RSA. Influence of the RSA algorithm on the development of cryptography.
XII week exercisesImplementation of RSA. Security questions for RSA. Influence of the RSA algorithm on the development of cryptography.
XIII week lecturesPrimality tests. Pollards algorithms for factorization. Factorization using difference of squares.
XIII week exercisesPrimality tests. Pollards algorithms for factorization. Factorization using difference of squares.
XIV week lecturesAbels group of an elliptic curve. Elliptic curve over a finite field. Discrete logarithm on an elliptic curve.
XIV week exercisesAbels group of an elliptic curve. Elliptic curve over a finite field. Discrete logarithm on an elliptic curve.
XV week lecturesThe notion and implementation of digital signatures. RSA digital signature.
XV week exercisesThe notion and implementation of digital signatures. RSA digital signature.
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations Students must attend lectures, do and submit all project tasks and do the midterm and final exam.
ConsultationsAs agreed with students.
Literature1. An Introduction to Mathematical Cryptography, Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman, 2008, ISBN: 978-0-387-77993-5. 2. A Course in Number Theory and Cryptography, Neal Koblitz, 1994, ISBN: 0-387-94293-9.
Examination methodsMidterm exam - 30 points Group project - 30 points Final exam - 30 points Attendance - 10 points
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / DATA MINING

Course:DATA MINING/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12083Obavezan253+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / PARALLEL ALGORITHMS

Course:PARALLEL ALGORITHMS/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12084Obavezan253+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / THEORY OF ALGORITHM COMPLEXITY

Course:THEORY OF ALGORITHM COMPLEXITY/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12087Obavezan153+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / COMPUTABILITY THEORY

Course:COMPUTABILITY THEORY/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12088Obavezan253+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / LINEAR PROGRAMMING

Course:LINEAR PROGRAMMING/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12092Obavezan153+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / GEOGRAPHIC INFORMATION SYSTEMS

Course:GEOGRAPHIC INFORMATION SYSTEMS/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12094Obavezan153+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / DIGITAL FORENSICS

Course:DIGITAL FORENSICS/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12095Obavezan153+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / WEB OF THINGS

Course:WEB OF THINGS/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12097Obavezan153+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / MATHEMATICAL MODELING

Course:MATHEMATICAL MODELING/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12101Obavezan253+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / MODERN SOFTWARE PLATFORMS

Course:MODERN SOFTWARE PLATFORMS/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12103Obavezan253+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / BIOINFORMATICS

Course:BIOINFORMATICS/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12105Obavezan253+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE

Course:THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12108Obavezan353+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / TECHNOLOGY OF PROGRAMMING

Course:TECHNOLOGY OF PROGRAMMING/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12110Obavezan353+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / MULTIMEDIA DATA PROCESSING

Course:MULTIMEDIA DATA PROCESSING/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12112Obavezan353+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / INDUSTRIAL SOFTWARE SYSTEMS

Course:INDUSTRIAL SOFTWARE SYSTEMS/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12114Obavezan353+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / INFORMATION SYSTEM DESIGN AND DEVELOPMENT

Course:INFORMATION SYSTEM DESIGN AND DEVELOPMENT/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12116Obavezan353+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points

Faculty of Science and Mathematics / COMPUTER SCIENCE / CLOUD COMPUTING

Course:CLOUD COMPUTING/
Course IDCourse statusSemesterECTS creditsLessons (Lessons+Exercises+Laboratory)
12119Obavezan353+1+0
ProgramsCOMPUTER SCIENCE
Prerequisites
Aims
Learning outcomes
Lecturer / Teaching assistant
Methodology
Plan and program of work
Preparing weekPreparation and registration of the semester
I week lectures
I week exercises
II week lectures
II week exercises
III week lectures
III week exercises
IV week lectures
IV week exercises
V week lectures
V week exercises
VI week lectures
VI week exercises
VII week lectures
VII week exercises
VIII week lectures
VIII week exercises
IX week lectures
IX week exercises
X week lectures
X week exercises
XI week lectures
XI week exercises
XII week lectures
XII week exercises
XIII week lectures
XIII week exercises
XIV week lectures
XIV week exercises
XV week lectures
XV week exercises
Student workload
Per weekPer semester
5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes
0 sat(a) practical classes
1 excercises
2 hour(s) i 40 minuts
of independent work, including consultations
Classes and final exam:
6 hour(s) i 40 minuts x 16 =106 hour(s) i 40 minuts
Necessary preparation before the beginning of the semester (administration, registration, certification):
6 hour(s) i 40 minuts x 2 =13 hour(s) i 20 minuts
Total workload for the subject:
5 x 30=150 hour(s)
Additional work for exam preparation in the preparing exam period, including taking the remedial exam from 0 to 30 hours (remaining time from the first two items to the total load for the item)
30 hour(s) i 0 minuts
Workload structure: 106 hour(s) i 40 minuts (cources), 13 hour(s) i 20 minuts (preparation), 30 hour(s) i 0 minuts (additional work)
Student obligations
Consultations
Literature
Examination methods
Special remarks
Comment
Grade:FEDCBA
Number of pointsless than 50 pointsgreater than or equal to 50 points and less than 60 pointsgreater than or equal to 60 points and less than 70 pointsgreater than or equal to 70 points and less than 80 pointsgreater than or equal to 80 points and less than 90 pointsgreater than or equal to 90 points