Faculty of Science and Mathematics / COMPUTER SCIENCE / LINEAR ALGEBRA
| Course: | LINEAR ALGEBRA/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 494 | Obavezan | 2 | 5 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 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: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / COMPUTERS AND PROGRAMMING
| Course: | COMPUTERS AND PROGRAMMING/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 495 | Obavezan | 1 | 6 | 3+3+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | none |
| Aims | Through this course students learn basic concepts of computing, number systems, ways of representing different types of data in computer, and Boolean functions. In addition, in the exercises students master the basics of a higher programming language Pascal. |
| Learning outcomes | After passing this exam, student will be able: 1. to understand and recognize the basic concepts of computer science; 2. to know theoretical basis of number systems and translating of numbers from one system to anotherč 3. to understand the ways of representation of basic data types in computer; 4. to understand theoretical basis and to use Boolean functions; 5. to algorithmically solve simple problems; 6. to implement programs using basic constructions of Pascal programming language |
| Lecturer / Teaching assistant | prof. dr Predrag Stanišić, Rajko Ćalasan |
| Methodology | Lectures, exercises in computer classroom / laboratory . Learning and practical exercises. Consultations . |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction . Informatics, information systems, data processing , algorithm. |
| I week exercises | Introduction to Pascal |
| II week lectures | Intuitive and formal concept of algorithm. |
| II week exercises | Basic data types in Pascal and operations on them. First homework assignment. |
| III week lectures | Hardware and software . The development of computers. |
| III week exercises | Operators and control structures in Pascal. |
| IV week lectures | Number systems. Operations in the binary system. |
| IV week exercises | Operators and control structures in Pascal. |
| V week lectures | Conversion from one number system to another . |
| V week exercises | Operators and control structures in Pascal. Second homework. |
| VI week lectures | Representation of integers in computer . |
| VI week exercises | Functions , parameters , variable area in Pascal. |
| VII week lectures | Representation of the rational numbers, character data, coding. |
| VII week exercises | Built-in functions in Pascal. Third homework. |
| VIII week lectures | COLLOQUIUM |
| VIII week exercises | COLLOQUIUM |
| IX week lectures | The concept of Boolean functions . Elementary functions . |
| IX week exercises | Arrays, strings in Pascal. |
| X week lectures | Formula . The realization of the function formulas . |
| X week exercises | Arrays, strings in Pascal. |
| XI week lectures | Equivalence of formulae |
| XI week exercises | Arrays, strings in Pascal. |
| XII week lectures | Duality principle |
| XII week exercises | Input / Output in Pascal. Fourth homework |
| XIII week lectures | Perfect disjunctive normal form . |
| XIII week exercises | Characteristics of commercial Pascal compilers. |
| XIV week lectures | Completeness and closure. Examples of closed classes. |
| XIV week exercises | Recursion in Pascal. Fifth homework |
| XV week lectures | Completeness theorem |
| XV week exercises | Recursion in Pascal. |
| Student workload | Student workload in hours per week 7 credits x 40/30 = 9 hours and 20 minutes Lecture : 3 hours Exercises : 3 hours Other teaching activities : 0 Individual work of students : 3 hours and 20 minutes . per semester Teaching and the final exam : ( 9 hours and 20 minutes ) x 16 = 149 hours and 20 minutes Necessary preparation ( before semester before semester ) : 2 x ( 9 hours and 20 minutes ) = 18 hours and 40 minutes total work hours for course : 7x30 = 210 hours Additional hours : from 0 to 42 hours structure: 149 hours and 20 minutes ( lectures) + 18 hours and 40 minutes ( preparation) + 42 hours (additional work ) |
| Per week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 3 excercises 2 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | Students are required to attend lessons, fulfill home exercises, and work colloquium. |
| Consultations | Cabinet |
| Literature | Milan Martinović, Predrag Stanišić: Računari i principi programiranja, PMF Podgorica. G. Schneider, S. Bruell - "Advanced Programming and Problem Solving with Pascal", John Wiley & Sons. |
| Examination methods | - 5 home exercises 10 points total ( 2 points for each) , - First test of 40 points - Final exam 50 points . |
| Special remarks | Lectures are conducted for groups of about 40-60 students, exercises in groups of about 20 students . Lectures may be taught in English and Russian. |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / DIFFERENTIAL EQUATIONS
| Course: | DIFFERENTIAL EQUATIONS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 497 | Obavezan | 4 | 4 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 1 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ALGEBRA
| Course: | ALGEBRA/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 500 | Obavezan | 2 | 5 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | None |
| Aims | This course is aimed to introduce students with basic notions in algebra and its applications in mathematical and technical sciences |
| Learning outcomes | On successful completion of this course, students will be able to: - define basic algebraic structures ( groupoids, semigroups, monoids, groups, rings, fields) - describe the algebra of sets, relations, mappings, natural numbers - describe semigroups with the proof of the Representation theorem (regular, idempotent, inverse) in detail - describe lattices (distributive, modular, with complements) - examine the structure of groups in detail and define subgroups, normal subgroups, quotient groups, cyclic groups, symmetric group with the proof of the Cayley theorem , direct product of groups and prove the Fundamental theorem on homomorphisms of groups - examine the structure of rings in detail and define subrings, ideals, quotient rings, direct product of rings and prove the Fundamental theorem on homomorphisms of rings - describe the ring of polynomials and polynomial functions and prove the basic theorems about the factorization of polynomials with applications |
| Lecturer / Teaching assistant | Prof.dr Biljana Zeković - lecturer, Dragana Borović - teaching assistant |
| Methodology | Lectures, exercises, consultations, homework assignments |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. Basic mathematical notions (sets, relations, functions) |
| I week exercises | Introduction. Basic mathematical notions (sets, relations, functions) |
| II week lectures | Basic algebraic structures. |
| II week exercises | Basic algebraic structures. |
| III week lectures | Algebra of natural numbers, relations, sets. |
| III week exercises | Algebra of natural numbers, relations, sets. |
| IV week lectures | Lattices (First homework assignment) |
| IV week exercises | Lattices (First homework assignment) |
| V week lectures | Semigroups |
| V week exercises | Semigroups |
| VI week lectures | Groups. Subgroups |
| VI week exercises | Groups. Subgroups |
| VII week lectures | Cyclical group. Normal subgroups |
| VII week exercises | Cyclical group. Normal subgroups |
| VIII week lectures | Morphisms of groups. Fundamental theorem of group homomorphisms |
| VIII week exercises | Morphisms of groups. Fundamental theorem of group homomorphisms |
| IX week lectures | Direct products of groups. I written exam |
| IX week exercises | Direct products of groups. I written exam |
| X week lectures | Symmetrical group. (Second homework assignment) |
| X week exercises | Symmetrical group. (Second homework assignment) |
| XI week lectures | Rings. Ideals. Factor- rings. |
| XI week exercises | Rings. Ideals. Factor- rings. |
| XII week lectures | Morphisms of rings. Fundamental theorem of ring homomorphisms |
| XII week exercises | Morphisms of rings. Fundamental theorem of ring homomorphisms |
| XIII week lectures | Direct products of rings. II written exam |
| XIII week exercises | Direct products of rings. II written exam |
| XIV week lectures | Polynomial rings |
| XIV week exercises | Polynomial rings |
| XV week lectures | Polynomial factorization (Third homework assignment) |
| XV week exercises | Polynomial factorization (Third homework assignment) |
| Student workload | 2 hours of lectures, 2 hours of exercises, 2 hours 40 minutes of individual work |
| Per week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 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 | Attendance, doing homework assignments, taking two written and the final exam |
| Consultations | 1 hour weekly (lectures), 1 hour weekly (exercises) |
| Literature | Uvod u Algebru, V. Dašić; Zbirka rešenih zadataka iz Algebre, B. Zeković, V. A. Artamonov |
| Examination methods | I written exam - 21 point; II written exam - 21 point; Attendance - 2 points; Doing homework assignments - 6 points. In total - 50 points. Final exam - 50 points. Everything is in written form, with oral examination in case of any unclarity or doubt |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / NUMERICAL ANALYSIS
| Course: | NUMERICAL ANALYSIS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 502 | Obavezan | 5 | 4 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 1 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / PROBABILITY THEORY AND STATISTICS
| Course: | PROBABILITY THEORY AND STATISTICS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 504 | Obavezan | 4 | 5 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | Not conditioned. |
| Aims | Adopt the basic concepts of probability and trained for solving probablity tasks. |
| Learning outcomes | After passing this exam student will be able to: 1. Give the examples of the random experiments. 2. Explain the probability by law of large numbers. 3. Resolves simple tasks associated with models of programming and physics. 4. Understand problem being solved within the framework of statistics. 5. Apply basic statistical methods in solving simple tasks. |
| Lecturer / Teaching assistant | Siniša Stamatović i Goran Popivoda |
| Methodology | Lectures, consultations and homework. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction to the subject. Random experiment.. Random events and operations with them. |
| I week exercises | |
| II week lectures | The concept of probability. Properties. The classical definition of probability. Examples. |
| II week exercises | |
| III week lectures | Conditional probability. Random variables. |
| III week exercises | |
| IV week lectures | Random variables: discrete and absolutely continuous type. Distribution function of a random variable. |
| IV week exercises | |
| V week lectures | Random vectors. Expectation. |
| V week exercises | |
| VI week lectures | The dispersion, correlation, Chebisov inequality. The laws of large numbers. |
| VI week exercises | |
| VII week lectures | |
| VII week exercises | |
| VIII week lectures | First colloquium. |
| VIII week exercises | |
| IX week lectures | Central limit theorem. Gaussian variables. |
| IX week exercises | |
| X week lectures | Statistics, population, patterns. |
| X week exercises | |
| XI week lectures | Estimation of unknown parameter. |
| XI week exercises | |
| XII week lectures | Confidence intervals. |
| XII week exercises | |
| XIII week lectures | Test of hypothesis. |
| XIII week exercises | |
| XIV week lectures | Regression analysis. Nonparametric tests. |
| XIV week exercises | |
| XV week lectures | Second colloquium. |
| XV week exercises |
| Student workload | |
| Per week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 1 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 | Attendance at lectures and exercises, passing colloquium and final exam. |
| Consultations | |
| Literature | S. Stamatović: Vjerovatnoća. Statistika, PMF, 2000. B. Stamatović, S. Stamatović: Zbirka zadataka iz kombinatorike, vjerovatnoće i statistike, PMF, 2005. |
| Examination methods | Two colloquiums, maximum points are 30, each. Final exam, maximum points are 40. Mark E: from 50 to 59 points, mark D: from 60 to 69 points, mark C: from 70 to 79 points, mark B: from 80 to 89 points, mark A: from 90 to 100 points. |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / PROGRAMMING LANGUAGES
| Course: | PROGRAMMING LANGUAGES/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 511 | Obavezan | 5 | 5 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 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: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / DATABASE SYSTEMS
| Course: | DATABASE SYSTEMS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 512 | Obavezan | 5 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | INTRODUCTION TO COMPUTER SCIENCE, COMPUTERS AND PROGRAMMING, OPERATING SYSTEMS |
| Aims | Through this course students learn the basic concepts of databases, their internal structure, methods of implementation, the principles and criteria of the design. In addition, students are introduced to some of the major modern DBMS, with special emphasis on query language SQL, administration and database programming. |
| Learning outcomes | Once the student passes the exam, will be able to: 1. understand the basic concepts and theoretical basis of databases; 2. design databases using the ER model and translate them into relational model; 3. know theoretical basis and to use manipulative formalisms of relational language, query languagees; 4. implement databases in modern database management systems; 5. understand in advanced level and to write queries in SQL query language. |
| Lecturer / Teaching assistant | prof.dr. Predrag Stanišić, doc.dr Aleksandar Popović |
| Methodology | Lectures, exercises in computer classroom/laboratory. Learning and practical exercises. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. Database. Database management system. Disadvantages of the classical approach based on file system. |
| I week exercises | Introduction. Working with Microsoft.Net development tools. |
| II week lectures | Levels of data abstraction. The instance and schema. Data models. Query language. DDL, DML, DGPS, DCL, ... Users of the system. Main tasks and components of a DBMS. General structure of DBMS. |
| II week exercises | Introduction to the principles of OOP. The first homework assignment. |
| III week lectures | E / R model. Basic concepts. Entity, a collection of entities, attributes, relationships, types of connections. The diagrams. |
| III week exercises | Syntax of vb.net |
| IV week lectures | E / R model. Strong and weak Entities. Extended E / R model. Specialization, generalization, aggregation. |
| IV week exercises | Basic visual controls: textbox, button, label, checkbox, optionbox, DropDownList, Picturebox, mainmanu ... |
| V week lectures | E / R model. Examples. |
| V week exercises | E / R model. Examples. Second homework. |
| VI week lectures | The relational model. Structural part of the relational model. Domain, attribute, relation. Integrity part of the model. Primary and foreign key, general constraints. |
| VI week exercises | Introduction to commercial and non-commercial database management systems: Oracle, SQL Server, Access, etc. Advantages, disadvantages, differences. |
| VII week lectures | Translation of E / R model into relational. SQL DDL. |
| VII week exercises | SQL DDL Third homework |
| VIII week lectures | COLLOQUIUM |
| VIII week exercises | COLLOQUIUM |
| IX week lectures | Relational manipulative formalisms. The relational algebra. |
| IX week exercises | Relational manipulative formalisms. The relational algebra. Fourth homework |
| X week lectures | Extended relational algebra. Examples. |
| X week exercises | Examples. |
| XI week lectures | Relational calculus of tuples and domains. Equivalence of relational manipulative formalisms. |
| XI week exercises | Relational calculus of tuples and domains. Equivalence of relational manipulative formalisms. |
| XII week lectures | SQL DML. Requests of a relation. |
| XII week exercises | SQL |
| XIII week lectures | SQL DML. Grouping and soak up over several issues, mergers. |
| XIII week exercises | SQL |
| XIV week lectures | SQL DML. Subqueries. Fifth homework |
| XIV week exercises | SQL |
| XV week lectures | Project presentation |
| XV week exercises | COLLOQUIUM |
| Student workload | Work Hours: 8 credits x 40/30 = 10 hours and 40 minutes Work hours structure: 3 hours for teaching 3 hour for exercises 4 hours and 40 minutes for individual work, including consultations and Teaching final exam: 10 hours and 40 minutes x 16 = 170 hours and 40 minutes Preparation before the beginning of the semester (before semester): 2 x (10 hours and 40 minutes) = 21 hours and 20 minutes Total work hours for course 8x30 = 240 hours of additional work for exams preparing correction of final exam, including the exam taking 0-48 hours (the remaining time of the first two items to the total work hours for the subject of 240 hours) structure: 170 hours and 40 minutes (lectures) + 21 hours and 20 minutes (preparation) +48 hours (additional work) |
| Per week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | Students are required to attend classes, as well as doing home exercises, and work colloquium. |
| Consultations | Cabinet |
| Literature | Silberchatz, Korth: Database Systems Concepts, McGraw-Hill C.J. Date An Introduction to Database Systems, Addison-Wesley |
| Examination methods | 5 home exercises 10 points total (2 points for each), - Each test 25 points - The project 20 points. - Final exam 20 points. The passing grade is obtained with at least 50 points. |
| Special remarks | Lectures are taught for group of about 40-60 students, exercises in groups of about 20 students. Lectures may be taught in English and Russian |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / PERIPHERALS AND INTERFACES
| Course: | PERIPHERALS AND INTERFACES/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 513 | Obavezan | 4 | 4 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequisites required. |
| Aims | Practical introduction with hardware and software structure of PCs. Gaining the basics of assembly language for microprocessors of Intel family x86. |
| Learning outcomes | On successful completion of this course students should be able to: 1. Understand the principles of operation of electronic components and computer system as a whole. 2. Describe the basic hardware and software components and architecture of modern computers. 3. Plan optimal computer configuration with respect to the specific application. 4. Gain the basics of assembly language for microprocessors of Intel family x86. 5. Create simple programs in assembly language. 6. Apply acquired knowledge to solving repair problems, as well as the problems of use of personal computers. |
| Lecturer / Teaching assistant | Prof. Dr. Stevan Šćepanović - teacher, MSc. Ivana Vukotić - assistant |
| Methodology | Lectures, exercises in computer classroom / lab. Learning and individual work on practical assignments. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. Basic concepts of computer peripherals and interfaces. I-P-O model of a computer system. Architecture of PCs compatible with IBM. The evolution, development and application of PCs. |
| I week exercises | Examples of programs written in assembly language. The life cycle of an assembly program. Compilation and execution of programs written in assembly language. Syntax of assembly language. |
| II week lectures | The basic components of PCs and their functions. Methods for connecting peripheral devices to the computer core. Functional principles of the PC. |
| II week exercises | Examples and practical assignments. |
| III week lectures | Communication between computer and its peripheral devices. Interrupts, processing of interrupts and vectors of interrupts. Software control of peripheral devices. BIOS and operating system functions. Functional characteristics of microprocessors. Architec |
| III week exercises | Examples and practical assignments. |
| IV week lectures | Characteristics of an assembly program. Programming model of Intel 32-bit architecture microprocessor. The basics of the assembly language. |
| IV week exercises | Examples and practical assignments. |
| V week lectures | Addressing of operands in the assembly language. Operators in assembly language. Data types and data exchange command. |
| V week exercises | Examples and practical assignments. |
| VI week lectures | Evolution of Intel microprocessor family. Characteristics of the Pentium microprocessors. |
| VI week exercises | Examples of programs written in assembly language. |
| VII week lectures | First theoretical test. |
| VII week exercises | Examples and practical assignments. |
| VIII week lectures | The Pentium 4 microprocessors. Intel Core i3, i5, i7. |
| VIII week exercises | First practical test. |
| IX week lectures | AMD Athlon processors. The choice between Intel and AMD microprocessors. Intel Core M microprocessors. ARM technology. |
| IX week exercises | Examples of programs written in assembly language. |
| X week lectures | The operating systems of PCs (Windows, Unix, Linux, Android). |
| X week exercises | Examples of programs written in assembly language. |
| XI week lectures | Installation and maintenance of PCs. Operational memory of PCs. |
| XI week exercises | Examples of programs written in assembly language. |
| XII week lectures | Bus and disk subsystems of PCs. File systems: FAT, FAT32, HPFS, NTFS and UNIX file system. Video subsystems. Input/output ports. Printers and scanners. Additional peripherals and equipment. |
| XII week exercises | Examples of programs written in assembly language. |
| XIII week lectures | Second theoretical test. |
| XIII week exercises | Examples of programs written in assembly language. |
| XIV week lectures | Second practical test. |
| XIV week exercises | Consultations. Examples and practical assignments. |
| XV week lectures | Correction of or one of the tests. |
| XV week exercises | Consultations. |
| Student workload | 4 credits x 30 hours = 120 hours |
| Per week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises 2 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | Lessons attendance is mandatory for students, as well as doing home exercises, all tests and laboratory exercises. |
| Consultations | Every week. |
| Literature | 1. cott Mueller, - Upgrading and Repairing PCs, 17th Edition, Que Publishing, 2006. 1.Hans-Peter Messmer, - PC hardware, Copirighted Material, Adison-Wesley, (also translated in Serbian, Kompjuter Biblioteka, Čačak, 2002.) 3.Kip R. Irvine, - “Assembly La |
| Examination methods | Two homework assignments are evaluated with a total of 2 points. Two theoretical tests are evaluated with a total of 28 points. Two practical tests are evaluated with a total of 40 points. Final exam 30 points. Student gets the passing grade by collecting |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / COMPUTER NETWORKS
| Course: | COMPUTER NETWORKS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1301 | Obavezan | 4 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequisites |
| Aims | The course has a goal to make students able to use English for specific purposes in the area of computer science. |
| Learning outcomes | After students pass the exam they will be able to: - distinguish, understand and use complex computing terminology in from programming, Internet and more complex algorithms, - explain more complex computer procedures in English, - understand basic messages of popular and expert texts from the area of computing in English, - have oral and written communication in English at upper intermediate level, - orally present chosen topic in English. |
| Lecturer / Teaching assistant | Savo Kostić |
| Methodology | Lectures and practice. Presentations in English on a topic studied. Studying for mid term and final exams. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | "Networks", reading comprehension, listening, discussion Grammar - relative clauses with a participle |
| I week exercises | |
| II week lectures | "The Internet", reading comprehension, listening, discussion Grammar - warnings |
| II week exercises | |
| III week lectures | "The World Wide Web", reading comprehension, listening, discussion Grammar - time clauses |
| III week exercises | |
| IV week lectures | Websites"", reading comprehension, listening, discussion Grammar - giving advice |
| IV week exercises | |
| V week lectures | "Webpage creator", reading comprehension, listening, discussion Grammar - definitions and collocations |
| V week exercises | |
| VI week lectures | "Communication systems", reading comprehension, listening, discussion Grammar – prediction |
| VI week exercises | |
| VII week lectures | Mid-term test |
| VII week exercises | |
| VIII week lectures | "Computing support", reading comprehension, listening, discussion Grammar - diagnoses and advice |
| VIII week exercises | |
| IX week lectures | "Data Security 1", reading comprehension, listening, discussion Grammar - cause and effect |
| IX week exercises | |
| X week lectures | "Data Security 2", reading comprehension, listening, discussion Grammar - cause and effect – revision |
| X week exercises | |
| XI week lectures | "The ex-hacker", reading comprehension, listening, discussion Grammar - phrasal verbs |
| XI week exercises | |
| XII week lectures | "Recent Developments in IT", reading comprehension, listening, discussion Grammar - modal verbs for ability |
| XII week exercises | |
| XIII week lectures | "The ex-hacker", reading comprehension, listening, discussion Grammar - phrasal verbs |
| XIII week exercises | |
| XIV week lectures | "The future of IT", reading comprehension, listening, discussion Grammar - predictions |
| XIV week exercises | |
| XV week lectures | Preparation for the final exam |
| XV week exercises |
| Student workload | 2 classes, 45 minutes each |
| Per week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | Students need to regularly attend classes, make a presentation and take a mid term and a final exam. |
| Consultations | once a week for 2 hours |
| Literature | Infotech - English for computer users, Santiago Ramacha Esteras |
| Examination methods | Presentation - 25 points, Mid-term exam - 25 points, Final exam - 50 points |
| Special remarks | Classroom language is English |
| Comment | / |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / PRINCIPLES OF PROGRAMMING
| Course: | PRINCIPLES OF PROGRAMMING/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1335 | Obavezan | 2 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / INTRODUCTION TO COMPUTER SCIENCE
| Course: | INTRODUCTION TO COMPUTER SCIENCE/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1339 | Obavezan | 1 | 6 | 2+3+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | None |
| Aims | Introducing basic algorithms and programming concepts using Java programming language: variables, types, loops, conditional statements, methods, classes. Learn how computer represents integer and real numbers, characters, pictures, audio, and video. |
| Learning outcomes | At the end of the course, the participant is expected to be able to: 1. Analyze problems and develop computer algorithms to solve novel problems [Familiarity] 2. Describe the internal representation of numeric and non-numeric data [Familiarity] 3. Write, document, test and debug Java programs, making use of variables, expressions, selection and looping statements. [Usage] 4. Identify and correct syntax and logic errors in programs [Familiarity] 5. Organize program code into modules using methods following the software engineering principles of modularity and abstraction. [Usage] 6. Assemble data and methods into classes at an introductory level following the software engineering principles of encapsulation and data hiding. [Usage] 7. Effectively use Internet services and word processing software, spreadsheet software, and presentation software [Usage] |
| Lecturer / Teaching assistant | Goran Šuković, Dušica Slović |
| Methodology | This is a seven-credit course with six 45-minute sessions per week (three lecture sessions and three lab session). All lecture hours are face-to-face and involve a mixture of traditional lectures, interactive programming sessions, and “hands-on” learning activities |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction to course. Integrated development environment. |
| I week exercises | Intro to labs. Number systems. Integer representation. |
| II week lectures | Java programs. Variables, types, constants, assignment. |
| II week exercises | Data representation: IEEE 754 floating point. |
| III week lectures | Arithmetic and logical expressions. |
| III week exercises | Data representation: pictures, audio, video. |
| IV week lectures | Conditional statements. |
| IV week exercises | Operating system. Folders and files. Copying and moving files. Linking documents. External devices. Multimedia. |
| V week lectures | Loops. |
| V week exercises | Test. Computer security. Antivirus and antispyware. Firewall. Printer settings. Network settings. Sharing printers and files. Command prompt. |
| VI week lectures | Methods. |
| VI week exercises | Intro to text processing. Creating and formatting text documents. |
| VII week lectures | Midterm. |
| VII week exercises | Advanced text formatting. Tables, formulas, drawings, special characters. |
| VIII week lectures | Simple algorithms. |
| VIII week exercises | Templates, mail merge. Linking text documents. |
| IX week lectures | Number theory algorithms. |
| IX week exercises | Test. |
| X week lectures | Arrays. |
| X week exercises | Spreadsheets – creating and basic formatting. |
| XI week lectures | Arrays – sorting and searching. |
| XI week exercises | Spreadsheets – advanced formulas and graphs. Pivot tables. Goal seek. Macros.. |
| XII week lectures | Two-dimensional arrays |
| XII week exercises | Presentation software. Creating and formatting presentation. |
| XIII week lectures | Introduction to object-oriented programming. Classes, fields, methods. |
| XIII week exercises | Adding animation and sound effects. HTML basics. |
| XIV week lectures | Object-oriented programming. Data encapsulation. |
| XIV week exercises | Test. |
| XV week lectures | |
| XV week exercises |
| Student workload | 5x40/30 = 6 sati 20 min Weekly: Lectures: 2 hours 15 min, Labs: 2 hours 15 min Other: 0, Individual work: 1 hours 50 min. |
| Per week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 3 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | Room 128, |
| Literature | J.G. Brookshear - Computer Science: An Overview, Addison Wesley, 2011. M. Martinović, P. Stanišić - Principi programiranja, Univerzitet Crne Gore, 2004. Herbert Schildt - Java JDK 7: kompletan priručnik (Mikro knjiga, 2012) Lecture slides. (PDF, PPT) |
| Examination methods | 3 test, 5 points each (15 points) - Essay and presentation. 5 points each (10 points) - midterm 35 points - Final 40 points. |
| Special remarks | The lecturer is able to offer course in English and Russian. |
| Comment | www.pmf.ac.me, uvod@rc.pmf.ac.me |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / DATA STRUCTURES
| Course: | DATA STRUCTURES/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1340 | Obavezan | 2 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ANALYTIC GEOMETRY
| Course: | ANALYTIC GEOMETRY/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1341 | Obavezan | 1 | 5 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | Attending and taking this course is not conditioned by other courses. |
| Aims | The aim of this course is to introduce students to elements of vector algebra and the method of coordinates for investigation of geometrical objects and for solving of geometrical problems. |
| Learning outcomes | On successful completion of the course, students will be able to: 1. Describe Cartesian, polar and sphere coordinate system and explain how basic geometric objects: point, line, plane, circle, ellipse, parabola and hyperbola can be presented in these coordinate systems. 2. Explain how the equations of a geometric object can be used establish their relation and position in plane and space. 3. Study the properties of geometric objects by using the equations they are described with. 4. Using the method of coordinates, solve some geometric tasks. 5. Using the equation of the second order of two and three variables, classify curves and surfaces of the second order. |
| Lecturer / Teaching assistant | Prof. dr Milojica Jaćimović – lecturer, Mr. Dušica Slović, assistant |
| Methodology | Lectures and exercises with active participation of students, individual homework assignments, group and individual consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Cartesian coordinate systems in plane and in space. Polar and spherical coordinate systems. |
| I week exercises | Cartesian coordinate systems in plane and in space. Polar and spherical coordinate systems. |
| II week lectures | Vectors in coordinate system. Linear operations. Scalar, vector and mixed products. |
| II week exercises | Vectors in coordinate system. Linear operations. Scalar, vector and mixed products. |
| III week lectures | Curves and surfaces and their equations. Examples. |
| III week exercises | Curves and surfaces and their equations. Examples. |
| IV week lectures | Line in the plane, plane in the space, line in the space, different equations of the line and the plane. |
| IV week exercises | Line in the plane, plane in the space, line in the space, different equations of the line and the plane. |
| V week lectures | Relations of lines and planes in space. Examples. Distance from a point to a plane and line. |
| V week exercises | Relations of lines and planes in space. Examples. Distance from a point to a plane and line. |
| VI week lectures | Plane in the n-dimensional Eucledian space. Dimension of the plane. Parallel planes. |
| VI week exercises | Plane in the n-dimensional Eucledian space. Dimension of the plane. Parallel planes. |
| VII week lectures | Study break. |
| VII week exercises | Study break. |
| VIII week lectures | Line and hyperplane. Distance from a point to the hyperplane. Plane as a intersection of hyperplanes. I written exam |
| VIII week exercises | Line and hyperplane. Distance from a point to the hyperplane. Plane as a intersection of hyperplanes. I written exam |
| IX week lectures | Convex set in a n-dimensional space. Segment, ray, half-space. Linear programming. Conic section. Classification. Canonical equations. |
| IX week exercises | Convex set in a n-dimensional space. Segment, ray, half-space. Linear programming. Conic section. Classification. Canonical equations. |
| X week lectures | Properties of the ellipse, hyperbola, parabola. |
| X week exercises | Properties of the ellipse, hyperbola, parabola. |
| XI week lectures | Isometric transformations of the Euclidean space. The group of isometric transformations. |
| XI week exercises | Isometric transformations of the Euclidean space. The group of isometric transformations. |
| XII week lectures | Quadric surfaces. Reduction to canonical form. Theorem of inertia. II written exam |
| XII week exercises | Quadric surfaces. Reduction to canonical form. Theorem of inertia. II written exam |
| XIII week lectures | Second-order curves. Invariants. Properties, classification. |
| XIII week exercises | Second-order curves. Invariants. Properties, classification. |
| XIV week lectures | Second-order surfaces. Canonical form. |
| XIV week exercises | Second-order surfaces. Canonical form. |
| XV week lectures | Invariants and second order surfaces. |
| XV week exercises | Invariants and second order surfaces. |
| Student workload | 2 hours of lectures 2 hours of exercises 1 hour 20 minutes of individual activity, including consultations |
| Per week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 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 are required to attend classes. |
| Consultations | As agreed with the professor or teaching assistant. |
| Literature | N. Elezović, Linearna algebra, Element, Zagreb, 2001; P.S. Modenov: Analiticka geometrija, Moskovski univerzitet; M. Jaćimović, I. Krnić: Linearna algebra – teoreme i zadaci, skripta, Podgorica |
| Examination methods | Two written exams,( up to 30 points each), and the final exam (up to 40 points). Grading: 51-60 points- E; 61-70 points- D; 71-80 points- C; 81-90 points- B; 91-100 points- A. |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ARTIFICIAL INTELLIGENCE
| Course: | ARTIFICIAL INTELLIGENCE/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1342 | Obavezan | 5 | 5 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | None. |
| Aims | An overview of AI, including search, knowledge representation, probabilistic reasoning and decision making under uncertainty, and machine learning. Illustrate the ways in which AI techniques can be used to solve real-world problems. |
| Learning outcomes | At the end of the course, the participant is expected to be able to: 1. Describe the role og propositional logic and first order logic in logic programming [Usage] 2. Implements simple Prolog and Lisp programs and explain how complex programs work [Usage] 3. Formulate an efficient problem space for a problem expressed in natural language and formulate a problem as a search problem [Usage] 4. Compare and contrast the basic techniques for representing uncertainty and inference algorithms [Assessment] 5. Identify the similarities and differences among various machine learning algorithms [Usage] 6. Integrate the artificial intelligence techniques in the software [Usage] |
| Lecturer / Teaching assistant | Goran Šuković, Savo Tomović |
| Methodology | The course is face-to-face, five 45-minutes sessions per week (3 lecture sessions and 2 lab session). The primary format is lecture but there are many active learning and problem solving activities integrated into the lecture sessions |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. History. Uninformed search. |
| I week exercises | Intro to Lisp programming. |
| II week lectures | Informed Search. |
| II week exercises | Lisp functions and macros. |
| III week lectures | Local search. |
| III week exercises | Data structures in LISP. |
| IV week lectures | Adversarial search. |
| IV week exercises | Data structures in LISP. |
| V week lectures | Constraint Satisfaction Problems |
| V week exercises | Knowledge representation. Intro to FOL. |
| VI week lectures | Constraint Satisfaction Problems |
| VI week exercises | Resolution. Inference. Unification. Forward and Backward chaining. |
| VII week lectures | Midterm (pen and pencil part) |
| VII week exercises | Midterm (programming part) |
| VIII week lectures | Uncertainty. |
| VIII week exercises | Prolog intro. |
| IX week lectures | Reasoning under uncertainty. |
| IX week exercises | Search algorithms in Prolog. |
| X week lectures | Bayes nets. |
| X week exercises | Advanced algorithms and data structures in Prolog. |
| XI week lectures | Introduction to Machine Learning. Overfiiting. |
| XI week exercises | Probability. Bayes rule. |
| XII week lectures | Decision trees, K-NN, Naive Bayes. |
| XII week exercises | Bayes net examples. Exact and approximate inference. |
| XIII week lectures | Neural Networks. |
| XIII week exercises | WEKA. |
| XIV week lectures | Support Vector Machines. Boosting. |
| XIV week exercises | WEKA. |
| XV week lectures | |
| XV week exercises |
| Student workload | Weekly: 5x40/30 = 6 hours 20 minutes Lectures: 2 hours 15 minutes Labs: 1 hour 30 minutes Other: 0 Individual work: 2 hours 35 minutes |
| Per week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 1 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 | Room 128 |
| Literature | Russel, Norvig – Artificial Intelligence Modern Approach (3rd edition), Prentice Hall, 2010. Lecture slides (PDF and PPT) |
| Examination methods | - Essay 5% - Homeworks (6 homeworks, 4-6% each) = 25% - Midterm 35% - Final 35% |
| Special remarks | The lecturer is able to offer course in English and Russian. |
| Comment | www.pmf.ac.me, ai@rc.pmf.ac.me |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / COMPUTER NETWORKS AND COMMUNICATIONS
| Course: | COMPUTER NETWORKS AND COMMUNICATIONS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1347 | Obavezan | 3 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequisites |
| Aims | The basics of hardware and software structure and basic characteristic of computer networks and their practical implementation. |
| Learning outcomes | On successful completion of this course students should be able to: 1. Explain the impact of network communications on the modern world, and the Internet - basic platform for communication. 2. Describe basic functions, protocols, technologies and architecture used in modern computer networks. 3. Gain the skills necessary for the implementation and use of computer networks and specific Internet services. 4. Individually designs, installs and administers smaller computer networks. 5. Capable of resolving failures as well as optimizing computer networks. |
| Lecturer / Teaching assistant | Dr. Stevan Šćepanović - Lectures, M. Sc. Ivana Todorovic - Exercises |
| Methodology | Lectures and seminars with the active participation of students, individual homeworks, group and individual consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. Basic concepts of computer networks and data transfer. Chronology of the origin and development of computer networks. Communications as an important segment of our lives. |
| I week exercises | Examples and practical assignments. |
| II week lectures | Network services. Classification of computer networks. Global and local networks. Principles of development of the modern computer networks. |
| II week exercises | Examples and practical assignments. |
| III week lectures | Network architecture layers. ISO OSI and TCP / IP model. Application layer, functions and protocols. |
| III week exercises | Examples and practical assignments. |
| IV week lectures | Transport layer. Principles of reliable data transfer and data flow control. |
| IV week exercises | Examples and practical assignments. |
| V week lectures | Network layer of the OSI model. Commutation and commutation methods. Internetworking. |
| V week exercises | Examples and practical assignments. |
| VI week lectures | Routers, basic components and architecture. |
| VI week exercises | Examples and practical assignments. |
| VII week lectures | First test. |
| VII week exercises | Examples and practical assignments. |
| VIII week lectures | The algorithms and routing protocols. IP addressing. |
| VIII week exercises | Examples and practical assignments. |
| IX week lectures | Data link layer. Methods, tools and codes for data flow control, as well as data transfer reliability. Data link layer correction protocols. Addressing of Ethernet networks at the data link layer. |
| IX week exercises | Examples and practical assignments. |
| X week lectures | Physical layer. The means and methods for data transfer. The concept and characteristics of the communication channel. Topology of computer networks. Data transfer medium. |
| X week exercises | Examples and practical assignments. |
| XI week lectures | Communication (network) equipment. The principles and means of development of the global computer networks. |
| XI week exercises | Examples and practical assignments. |
| XII week lectures | Local area networks and communication through the mediums with multiple access. Switches and switching. |
| XII week exercises | Examples and practical assignments. |
| XIII week lectures | Planning and network cabling, administration and network management. |
| XIII week exercises | Examples and practical assignments. |
| XIV week lectures | Second test. |
| XIV week exercises | Examples and practical assignments. |
| XV week lectures | Correction of first or second test. |
| XV week exercises | Consultations. |
| Student workload | 6x30 = 180 hours in semester |
| Per week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | Lessons attendance is mandatory for students, as well as doing home exercises, both tests and laboratory exercises. |
| Consultations | Mondays after lectures. |
| Literature | 1. Alberto Leon-Garcia, Indra Widjaja, “Communication Networks: Fundamental Concepts and Key Architectures”, McGraw-Hill Companies, Inc., New York, San Francisco, St. Louis, Lisabon, London, Madrid, 2004. 2. F. Halsall, - “Data Communications, Computer |
| Examination methods | Written exams (3 times in semester), problem solving - homeworks, estimation of individual activity on lectures and seminars. |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / COMPILERS
| Course: | COMPILERS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1348 | Obavezan | 6 | 5 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | None. |
| Aims | This course covers the design and implementation of translator-oriented systems software, focusing specifically on compilers, with some time spent on related topics such as interpreters and linkers. |
| Learning outcomes | At the end of the course, the participant is expected to be able to: 1. Describe the design of a compiler/interpereter including its phases and components [Familiarity] 2. Use regular expressions and context-free grammars to specify the syntax of languages [Usage] 3. Identify the similarities and differences among various parsing techniques, grammar transformation techniques and type checking methods [Familiarity] 4. Distinguish between methods for scope and binding resolution and parameter passing [Familiarity] 5. Explain how programming language implementations typically organize memory [Familiarity] 6. Design and implement interpreter/compiler for simple language using declarative tools to generate parsers and scanners. [Usage] |
| Lecturer / Teaching assistant | Goran Šuković, Savo Tomović. |
| Methodology | The course lasts 14 weeks and consists of two 45-minutes session per week of face-to-face lectures together with a two 45-minute recitation class. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. Compilers and interpreters. |
| I week exercises | MIPS intro. |
| II week lectures | Grammars and languages. |
| II week exercises | MIPS: function call, recursion. |
| III week lectures | Lexical Analysis |
| III week exercises | Regular Expressions. DFA. NFA. |
| IV week lectures | Syntax Analysis – "top-down" parsers. |
| IV week exercises | RE to NFA conversion. NFA to DFA conversion. DFA optimization. |
| V week lectures | Syntax Analysis – "Bottom-up" parsers. LR(0), SLR(1). |
| V week exercises | Intro to Flex/Lex. |
| VI week lectures | Syntax Analysis – LR(1), LALR. |
| VI week exercises | Flex examples. |
| VII week lectures | Midterm. |
| VII week exercises | Bison/Yacc. |
| VIII week lectures | Semantical Analysis |
| VIII week exercises | Bison/Yacc examples. |
| IX week lectures | Type checking. |
| IX week exercises | Symbol table. |
| X week lectures | Runtime environment, |
| X week exercises | Type checking using Bison/YACC. |
| XI week lectures | TAC |
| XI week exercises | TAC examples. |
| XII week lectures | Code generation |
| XII week exercises | Code generation examples. |
| XIII week lectures | Code generation (cont.) |
| XIII week exercises | Code generation with Bison/YACC |
| XIV week lectures | Intro to dataflow analysis. Loop optimization. |
| XIV week exercises | Optimization – examples. |
| XV week lectures | |
| XV week exercises |
| Student workload | Weekly: 5x40/30 = 6 hours 40 minutes, Lectures: 1 hour 30 minutes, Labs: 1 hour 30 minutes, Other: 0, Individual works: 3 hours 40 minutes. |
| Per week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 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 | Room 128. |
| Literature | Torczon, Cooper – Engineering a Compiler, 2nd Edition (Morgan Kaufmann, 2011) Appel – Modern Compiler Implementation in Java (2nd edition), Cambridge University Press, 2002. Aho, Sethi, Ullman – Compilers: Principles, Techniques and Tools, 2nd Edition |
| Examination methods | - 6 Homewoks (3-5% each, programming and pen-and-pencil) = 20% - Midterm 40% - Final exam 40% |
| Special remarks | The lecturer is able to offer course in English and Russian. |
| Comment | www.pmf.ac.me, prevodioci@rc.pmf.ac.me |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / VISUALIZATION AND COMPUTER GRAPHICS
| Course: | VISUALIZATION AND COMPUTER GRAPHICS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1349 | Obavezan | 4 | 4 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequisites |
| Aims | The course has a goal to make students able to use English for specific purposes in the area of computer science. |
| Learning outcomes | After students pass the exam, they will be able to: - understand the messages of expert discourse of the topic they often come across (computer viruses, communication protocols, programming languages, the concept of the Intenet), as well as the basic messages of more complex texts, - orally express topics on computer related topics in a relatively fluent way, using complex structures, exchange information and participate in conversations in English, - use grammar constructions at upper intermediate level, - write a short composition from known thematic areas, - make a presentation in English. |
| Lecturer / Teaching assistant | Savo Kostić |
| Methodology | Lectures and practice. Presentations in English on a topic studied. Studying for mid term and final exams. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | "Computer users", reading comprehension, listening, discussion Grammar - revision of past tenses |
| I week exercises | |
| II week lectures | "Computer architecture", reading comprehension, listening, discussion Grammar - spatial prepositions |
| II week exercises | |
| III week lectures | "Computer applications", reading comprehension, listening, discussion Grammar - present tense passive |
| III week exercises | |
| IV week lectures | "Peripherals", reading comprehension, listening, discussion Grammar - comparison and contrast |
| IV week exercises | |
| V week lectures | "Interview - former student", listening, discussion Grammar - past tenses questions |
| V week exercises | |
| VI week lectures | "Operating systems", reading comprehension, listening, discussion Grammar - "-ing" forms as nouns and after prepositions |
| VI week exercises | |
| VII week lectures | Mid-term exam |
| VII week exercises | |
| VIII week lectures | "Graphical user interface", reading comprehension, listening, discussion Grammar - object constructions |
| VIII week exercises | |
| IX week lectures | "Application programs", reading comprehension, listening, discussion Grammar - complex instructions |
| IX week exercises | |
| X week lectures | "Multimedia", reading comprehension, listening, discussion Grammar - "-ing clauses", cause and effect |
| X week exercises | |
| XI week lectures | "Interview - computing support", reading comprehension, listening, discussion Grammar - if sentences |
| XI week exercises | |
| XII week lectures | "Interview - revision", reading comprehension, listening, discussion Grammar - conditional sentences – revision |
| XII week exercises | |
| XIII week lectures | "Software engineering", reading comprehension, listening, discussion Grammar - if X then Y |
| XIII week exercises | |
| XIV week lectures | "Software engineering", revision Grammar - advantages and disadvantages |
| XIV week exercises | |
| XV week lectures | Preparation for the final exam |
| XV week exercises |
| Student workload | 2 classes, 45 minutes each |
| Per week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises 2 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | Students need to regularly attend classes, make a presentation and take a mid term and a final exam. |
| Consultations | once a week for 2 hours |
| Literature | Infotech - English for computer users, Santiago Ramacha Esteras |
| Examination methods | Presentation - 25 points, Mid-term exam - 25 points, Final exam - 50 points |
| Special remarks | Classroom language is English |
| Comment | / |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ADVANCED DATABASE SYSTEMS
| Course: | ADVANCED DATABASE SYSTEMS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1351 | Obavezan | 6 | 5 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | Introduction to Computer Science, Programming, Operating systems, Database Systems |
| Aims | Through this course students learn advanced concepts of databases, their internal structure, methods of implementation, principles and criteria of their design. In addition, students in exercises learn programming related to databases. |
| Learning outcomes | After passing this exam, student will be able to: 1. understand the advanced concepts of database systems and their internal structure; 2. know theoretical basis of logical database design; 3 3. understand ways of realization, the principles and criteria of the design of the database management and use them in programming; 4. understand the process of execution and query optimization; 5. use at advanced level of main modern systems for database management; 6. design and develop applications using modern programming tools and the SQL language |
| Lecturer / Teaching assistant | prof. dr. Predrag Stanisic, doc. Dr. Aleksandar Popovic |
| Methodology | Lectures, exercises in computer classroom / laboratory. Learning and practical exercises. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Administration of database systems. Safety systems. Users. Your rights. Cast. Backup data archiving. Replication. |
| I week exercises | Administration database systems. Safety systems. Users. Your rights. Cast. Backup data archiving. Replication. |
| II week lectures | The design of a relational database. Design errors and anomalies. Decomposition. Normal forms. |
| II week exercises | The design of a relational database. Design errors and anomalies. Decomposition. Normal forms. |
| III week lectures | Normalization using functional dependencies. 1NF. 2NF. 3NF. BCNF |
| III week exercises | Normalization using functional dependencies. 1NF. 2NF. 3NF. BCNF |
| IV week lectures | Normalization using multivalued dependencies. 4NF. Normalization using depending on the combination. 5NF. Domain-key normal form. |
| IV week exercises | Normalization using multivalued dependencies. 4NF. Normalization using depending on the combination. 5NF. Domain-key normal form. |
| V week lectures | Query processing. Query optimization. Phases. The information in the catalog necessary for the evaluation of the plan. Assessment criteria. Execution of queries. |
| V week exercises | Query processing. Query optimization. Phases. The information in the catalog necessary for the evaluation of the plan. Assessment criteria. Execution of queries. |
| VI week lectures | Choice of execution plan. Assessment and execution of selection. Assessment and execution of joins. Other operations. Evaluation of expression. |
| VI week exercises | Choice of execution plan. Assessment and execution of selection. Assessment and execution of joins. Other operations. Evaluation of expression. |
| VII week lectures | Colloquium |
| VII week exercises | Colloquium |
| VIII week lectures | Transaction. ACID properties of transactions. Seriability. |
| VIII week exercises | Transaction. ACID properties of transactions. Seriability. |
| IX week lectures | Testing of seriability. Transactions in SQL. |
| IX week exercises | Testing of seriability. Transactions in SQL. |
| X week lectures | Control of concurrency. Lock protocols . Timestamp protocols . Protocols based on validation. Granularity. Muliversion schemes. Deadlocks. |
| X week exercises | Control of concurrency. Lock protocols . Timestamp protocols . Protocols based on validation. Granularity. Muliversion schemes. Deadlocks. |
| XI week lectures | Recovering from failure. Types of failures. Recovery and Atomicity. Recovery schemes using journal (log). Shadow paging. Recovering from concurrent transactions. Buffer management. Faults with loss of stable memory. Advanced recovery techniques. |
| XI week exercises | Recovering from failure. Types of failures. Recovery and Atomicity. Recovery schemes using journal (log). Shadow paging. Recovering from concurrent transactions. Buffer management. Faults with loss of stable memory. Advanced recovery techniques. |
| XII week lectures | Parallel databases. Parallelism in databases. Parallelism between queries. Parallelism within queries. Parallelism within operation. Parallelism between operations. Design of parallel systems |
| XII week exercises | Parallel databases. Parallelism in databases. Parallelism between queries. Parallelism within queries. Parallelism within operation. Parallelism between operations. Design of parallel systems |
| XIII week lectures | Distributed databases. Distributed systems. Network transparency. Fragmentation of data. Catalog management. Distributed query processing |
| XIII week exercises | Distributed databases. Distributed systems. Network transparency. Fragmentation of data. Catalog management. Distributed query processing |
| XIV week lectures | New applications. Systems for decision support. Data analysis. Data mining. Data warehousing. |
| XIV week exercises | New applications. Systems for decision support. Data analysis. Data mining. Data warehousing. |
| XV week lectures | Spatial and geographic databases. Multimedia database. Databases on the Internet. Databases in biology. The genome project. Digital libraries. |
| XV week exercises | Project presentation |
| Student workload | 6 credits x 40/30 = 8 hours Working hours structure: 3 hours for teaching 3 hour for exercises 2 hours for individual work, including consultations per semester Teaching and the final exam: 8 x 16 = 128 hours Necessary preparation (before semester Administration semester): 2 x (8 hours) = 16 hours Total work hours for the course: 6x30 = 180 hours of additional work for exams preparing correction of final exam, including the exam taking from 0 to 36 hours (the remaining time of the first two items to the total work hours for the course, 180 hours) structure: 128 hours (lectures) + 16 hours (preparation) + 36 hours (additional work) |
| Per week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 1 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 | Obligations of the students in the course, students are required to attend classes, as well as doing home exercises, and working test. |
| Consultations | Cabinet |
| Literature | Silberchatz, Korth: Database Systems Concepts, McGraw-Hill CJ Date An Introduction to Database Systems, Addison-Wesley |
| Examination methods | 5 home exercises 10 points total (2 points for each homework assignment), - tests 20 points - Project 20 points - Final exam 50 points. Minimum 51 points. |
| Special remarks | Lectures are conducted for a group of about 40-60 students, exercises in groups of about 20 students. |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ADVANCED PROGRAMMING TECHNIQUES
| Course: | ADVANCED PROGRAMMING TECHNIQUES/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1352 | Obavezan | 6 | 5 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 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: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / OBJECT ORIENTED PROGRAMMING
| Course: | OBJECT ORIENTED PROGRAMMING/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1358 | Obavezan | 3 | 3 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | Through this course students learn basic and advanced concepts of object-oriented programming, and practical programming in the C++ language |
| Learning outcomes | Once a student passes the exam, will be able to: i) write computer programs in the C++ language; ii) use the Class concept for software implementation; iii)use inheritance and abstract classes in order to connect different software modules; iv) reuse program code by means of the object-oriented programming concepts; v) create generic classes and operator functions in the C++ language. |
| Lecturer / Teaching assistant | Doc. dr Aleksandar Popović, Mr Igor Ivanović |
| Methodology | Lectures, exercises in computer classroom/laboratory. Learning and practical exercises. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction, Basic notions in the object-oriented programming paradigm |
| I week exercises | Introduction, Basic notions in the object-oriented programming paradigm |
| II week lectures | Basics of the C++ language, Overview of concepts inherited from the C language |
| II week exercises | Basics of the C++ language, Overview of concepts inherited from the C language |
| III week lectures | Introduction to classes and objects, Interface and implementation of a class |
| III week exercises | Introduction to classes and objects, Interface and implementation of a class |
| IV week lectures | Objects and methods.References. Pointer named this |
| IV week exercises | Objects and methods.References. Pointer named this |
| V week lectures | Constructors and destructors |
| V week exercises | Constructors and destructors |
| VI week lectures | Inline methods, Const methods, Objects as function arguments |
| VI week exercises | Inline methods, Const methods, Objects as function arguments |
| VII week lectures | Static attributes of a class, Static methods, Friendship relation between classes |
| VII week exercises | Static attributes of a class, Static methods, Friendship relation between classes |
| VIII week lectures | Inheritance |
| VIII week exercises | Inheritance |
| IX week lectures | COLLOQUIUM I |
| IX week exercises | COLLOQUIUM I |
| X week lectures | Polymorphism |
| X week exercises | Polymorphism |
| XI week lectures | Multiple Inheritance. Abstract classes |
| XI week exercises | Multiple Inheritance. Abstract classes |
| XII week lectures | Operator overloading, Operator functions |
| XII week exercises | Operator overloading, Operator functions |
| XIII week lectures | Exception handling |
| XIII week exercises | Exception handling |
| XIV week lectures | Generic classes and methods |
| XIV week exercises | Generic classes and methods |
| XV week lectures | COLLOQUIUM II |
| XV week exercises | COLLOQUIUM II |
| Student workload | Teaching and final exam: 5 hours and 20 minutes x 16 = 85 hours and 20 minutes Preparation before the beginning of the semester 2 x (5 hours and 20 minutes) = 10 hours i 40 minutes Total work hours for the course 4x30 = 120 hours Additional work for preparation of the exam in remedial exam period, including final exam from 0 to 24 sati (the remaining time of the first two items to the total work hours for the subject of 120 hours) Structure: 85 hours and 20 minutes(lectures) + 10 hours and 40 minutes (preparation) +24 hours (additional work) |
| Per week | Per semester |
| 3 credits x 40/30=4 hours and 0 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises 1 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
4 hour(s) i 0 minuts x 16 =64 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 4 hour(s) i 0 minuts x 2 =8 hour(s) i 0 minuts Total workload for the subject: 3 x 30=90 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) 18 hour(s) i 0 minuts Workload structure: 64 hour(s) i 0 minuts (cources), 8 hour(s) i 0 minuts (preparation), 18 hour(s) i 0 minuts (additional work) |
| Student obligations | Students are required to attend classes, as well as to do home exercises, and colloquia |
| Consultations | |
| Literature | D. Milićev, Objektno-orijentisano programiranje na jeziku C++, Mikroknjiga, Beograd |
| Examination methods | 2 colloquia 70 points total (35 points for each), Final exam 30 points. The passing grade is obtained with at least 45 points |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / DISTRIBUTED COMPUTER SYSTEMS
| Course: | DISTRIBUTED COMPUTER SYSTEMS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1359 | Obavezan | 6 | 4 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequisites required. |
| Aims | Through this course, students gain basic knowledge about: the hardware and software structure of distributed and parallel computer systems, the basics of parallel programming and algorithms for execution of competitive programs. |
| Learning outcomes | On successful completion of this course students should be able to: 1. Understand the concept and importance of distributed computer systems. 2. Understand advanced architectures of parallel (multiprocessor) computer systems. 3. Define the concept of high performance computer system. 4. Use methods for performance evaluation of parallel and distributed computer systems. 5. Analyze the advantages and disadvantages of specific parallel computing system architecture. 6. Know basic parallel programming methods, their advantages and disadvantages. 7. Understand the rules and algorithms for competitive program execution, precisely the competitive process. 8. Are familiar with the distributed computer systems development trends. |
| Lecturer / Teaching assistant | Prof. Dr. Stevan Šćepanović - teacher, MSc. Ivana Vukotić - assistant |
| Methodology | Lectures, exercises in computer classroom / lab. Learning and individual work on practical assignments. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. Basic concepts. Properties of high-performance computers. |
| I week exercises | Examples and practical assignments. |
| II week lectures | Classification and history of parallel and distributed systems. Software concept of distributed systems. |
| II week exercises | Examples and practical assignments. |
| III week lectures | Performances of parallel and distributed computer systems. Basic principles of distributed system design. Further development of super computers. |
| III week exercises | Examples and practical assignments. |
| IV week lectures | The basics of parallel programming. Task and data parallelism. |
| IV week exercises | Examples and practical assignments. Homework. |
| V week lectures | Client / server technology. Three-layered P-A-D model of data processing. |
| V week exercises | Examples and practical assignments. |
| VI week lectures | Cloud Computing. |
| VI week exercises | Examples and practical assignments. |
| VII week lectures | First test. |
| VII week exercises | Examples and practical assignments. |
| VIII week lectures | Processes and threads. Communication and synchronization of concurrent processes. Time synchronization in distributed systems. |
| VIII week exercises | Examples and practical assignments. |
| IX week lectures | Algorithms for mutual exclusion of critical intervals. |
| IX week exercises | Examples and practical assignments. |
| X week lectures | Defining the state of a distributed system. Coordination of distributed processes. |
| X week exercises | Examples and practical assignments. |
| XI week lectures | Distributed shared memory. |
| XI week exercises | Examples and practical assignments. |
| XII week lectures | Distributed file system. |
| XII week exercises | Examples and practical assignments. Homework. |
| XIII week lectures | File duplication (multiplication). |
| XIII week exercises | Examples and practical assignments. |
| XIV week lectures | Second test. |
| XIV week exercises | Consultations. Examples and practical assignments. |
| XV week lectures | Correction of first or second test. |
| XV week exercises | Consultations. |
| Student workload | 4 credits x 30 hours = 120 hours |
| Per week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises 2 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | Lessons attendance is mandatory for students, as well as doing home exercises, all tests and laboratory exercises. |
| Consultations | Every week. |
| Literature | 1. А. S. Tanenbaum, M. van Steen - “Distributed Systems – Principles and paradigms”, Prentice-Hall, Inc., New Jersey, 2002. 2. А. S. Tanenbaum, - “Distributed Operating Systems”, Prentice-Hall, Inc., New Jersey, 1995. 3. G. Coulouris, J. Dollimore, T. Kin |
| Examination methods | Homework assignments are evaluated with a total of 4 points. Two tests are evaluated with a total of 66 points. Final exam 30 points. Student gets the passing grade by collecting 50 points at least. |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / INTRODUCTION TO INFORMATION SYSTEMS
| Course: | INTRODUCTION TO INFORMATION SYSTEMS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1651 | Obavezan | 5 | 4 | 2+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | Once a student passes the exam, will be able to: i) create conceptual design of an information system, and monitor its' implementation, i.e., monitor all tasks within design, resources used in the project, as well as budget management, using a tool named MS Project; ii) use basic functionalities of a CASE tool named Oracle Designer; iii) describe business process of an organization using Data Flow, Functional Hierarchy and Process Modeler diagrams; iv) create ER diagrams. |
| Learning outcomes | Through this course students learn basic concepts from the field of information systems design and development. |
| Lecturer / Teaching assistant | Doc. dr Aleksandar Popović, Kosta Pavlović |
| Methodology | Lectures, exercises in computer classroom/laboratory. Learning and practical exercises. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | The system notion, system management, Organizational and sociological aspects of real-world systems. |
| I week exercises | The system notion, system management, Organizational and sociological aspects of real-world systems. |
| II week lectures | Notion, structure and tasks of an information system (IS), Software engineering. |
| II week exercises | Notion, structure and tasks of an information system (IS), Software engineering. |
| III week lectures | Methodologies for the software development, Methodologies for the management of the IS development. |
| III week exercises | Methodologies for the software development, Methodologies for the management of the IS development. |
| IV week lectures | Dataflow diagrams in the system analysis and design. |
| IV week exercises | Dataflow diagrams in the system analysis and design. |
| V week lectures | IS development process, Structural decomposition of the information system development process. |
| V week exercises | IS development process, Structural decomposition of the information system development process. |
| VI week lectures | Strategy phase in the development lifecycle. Conceptual design of an information system |
| VI week exercises | Strategy phase in the development lifecycle. Conceptual design of an information system |
| VII week lectures | COLLOQUIUM I |
| VII week exercises | COLLOQUIUM I |
| VIII week lectures | Analysis phase in the development lifecycle, Creating a project assignment |
| VIII week exercises | Analysis phase in the development lifecycle, Creating a project assignment |
| IX week lectures | Requirements engineering |
| IX week exercises | Requirements engineering |
| X week lectures | Design phase in the lifecycle of software development |
| X week exercises | Design phase in the lifecycle of software development |
| XI week lectures | Implementation and maintenance phases in the in the lifecycle of software development |
| XI week exercises | Implementation and maintenance phases in the in the lifecycle of software development |
| XII week lectures | Usage of domain-specific languages in the desing of ISs |
| XII week exercises | Usage of domain-specific languages in the desing of ISs |
| XIII week lectures | Domain-specific modeling |
| XIII week exercises | Domain-specific modeling |
| XIV week lectures | Program code generators |
| XIV week exercises | Program code generators |
| XV week lectures | COLLOQUIUM II |
| XV week exercises | COLLOQUIUM II |
| Student workload | 5 credits 30 = 150 hours(total works for the course). Structure: Preparation before the beginning of the semester: 13 hours and 20 minutes. During semester, teaching and the final exam: 6 hours and 40 minutes x 16 = 106 hours 40 minutes. Additional work for preparation of the exam in remedial exam period, including final exam from 0 to 30 hours |
| Per week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 1 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | Students are required to attend classes, as well as to do home exercises, and colloquia. |
| Consultations | |
| Literature | Hawryszkiewycz I, Introduction to System Analysis and Design, 5/E, Pearson Education, 2000. Bocij P, Chaffey D, Greasley A, Hickie S, Business Information Systems: Technology, Development and Management for the E-business, 3/E, Pearson Education, 2005. |
| Examination methods | Test I – 15 points, Test II – 15 points, Project assignment. – 20 points, colloquia 30 points, Final exam – 20 points |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / COMPUTER SYSTEMS ARCHITECTURE
| Course: | COMPUTER SYSTEMS ARCHITECTURE/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1796 | Obavezan | 5 | 2 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 2 credits x 40/30=2 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises -1 hour(s) i 40 minuts of independent work, including consultations |
Classes and final exam:
2 hour(s) i 40 minuts x 16 =42 hour(s) i 40 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 2 hour(s) i 40 minuts x 2 =5 hour(s) i 20 minuts Total workload for the subject: 2 x 30=60 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) 12 hour(s) i 0 minuts Workload structure: 42 hour(s) i 40 minuts (cources), 5 hour(s) i 20 minuts (preparation), 12 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / INTERNET TECHNOLOGIES
| Course: | INTERNET TECHNOLOGIES/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 1797 | Obavezan | 6 | 4 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | None. |
| Aims | Overview of current web languages and technologies. Ability to compare and contrast web programming with general purpose programming |
| Learning outcomes | At the end of the course, the participant is expected to be able to: 1. Describe the constraints that the web puts on developers. [Familiarity] 2. Discuss how web standards impact software development and review an existing web application against a current web standard [Assessment] 3. Distinguish between content and formatting and use appropriate elements for organizing content and formatting. [Usage] 4. Design and implement client-side data validation [Usage] 5. Use various Application Programming Interfaces (APIs) [Usage] 6. Design and implement a simple web application. [Usage] |
| Lecturer / Teaching assistant | Goran Šuković, Igor Ivanović. |
| Methodology | Two face to face 45-minutes lecture sessions and one lab session per week. There are many active learning and problem solving activities integrated into the lecture and lab sessions. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. |
| I week exercises | Tools and platforms. |
| II week lectures | Intro to HTML5. Lists, tables, images. |
| II week exercises | Basic HTML examples. |
| III week lectures | HTML5. Input elements. Semantic web. |
| III week exercises | HTML tables. Images. Multimedia. |
| IV week lectures | Test. CSS overview. |
| IV week exercises | CSS examples. |
| V week lectures | CSS layout. |
| V week exercises | CSS examples. |
| VI week lectures | Advanced CSS. |
| VI week exercises | Advanced CSS examples. |
| VII week lectures | Test. Intro to JQuery |
| VII week exercises | PHP intro. PHP control statements |
| VIII week lectures | JQuery (cont.) - event handling. |
| VIII week exercises | PHP functions. |
| IX week lectures | JQuery (cont.) |
| IX week exercises | PHP – strings and arrays |
| X week lectures | Test. XML. |
| X week exercises | PHP – regular expressions |
| XI week lectures | XML, XMLSchema, XSLT |
| XI week exercises | PHP – file and database access. |
| XII week lectures | HTML5 Canvas |
| XII week exercises | PHP – sessions, cookies, shopping cart. |
| XIII week lectures | Ajax, JSON, Singla page applications. |
| XIII week exercises | CSS frameworks |
| XIV week lectures | Test. Web security. |
| XIV week exercises | XSLT-a. XML and PHP: SimpleXML i DOM. |
| XV week lectures | |
| XV week exercises |
| Student workload | Weekly: 4x40/30 = 5 hours 20 min, lectures: 1 hour 30 min, Labs: 45 min, Other: 0. Individual work: 2 hours 55 min. |
| Per week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises 2 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | Room 128 |
| Literature | Brian P. Hogan - "HTML5 and CSS3, 2nd edition", Pragmatic bookshelf, 2013. Jonathan Chaffer, Karl Swedberg - "Learning jQuery, Fourth Edition", Packt, 2013. Luke Welling, Laura Thompson - "Programming PHP, 3rd Edition", O'Reilly, 2013. Lecture slides a |
| Examination methods | - 4 in-class test, 5 points each - 5 homeworks, 6 points each - Final project 50 points |
| Special remarks | The lecturer is able to offer course in English and Russian. |
| Comment | www.pmf.ac.me, internet@rc.pmf.ac.me |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / SECURITY OF COMPUTING SYSTEMS
| Course: | SECURITY OF COMPUTING SYSTEMS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 2300 | Obavezan | 5 | 4 | 2+0+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequisites required. |
| Aims | Students ate introduced with computer system security threats as well as means, forms and methods of computer system protection. The study of algorithms used for information encryption. Introduction with the practical application of cryptography in the field of computer systems protection, email protection, web and transactions, as well as modern network level protection. |
| Learning outcomes | On successful completion of this course students should be able to: 1.Define the concept of secure computer system. 2.Describe the potential threats and risks of jeopardizing the security of computer systems. 3.Describe the concepts of authentication and authorization as well as protocols used for their implementation. 4.Master contents which include encryption and decryption of data, encryption algorithms and protection procedures. 5. Describe methodology used for protection of e-mail, Web, electronic signatures and electronic certificates. 6.Design and implements necessary protection for the specific computer system. |
| Lecturer / Teaching assistant | Prof. Dr. Stevan Šćepanović - teacher |
| Methodology | Lectures, exercises in computer classroom / lab. Learning and individual work on practical assignments. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. Basic computer system security concepts. |
| I week exercises | |
| II week lectures | Security threats in computer systems and principles of secure computer system development. |
| II week exercises | |
| III week lectures | System degradation using viruses and other harmful programs. Preventive computer protection from viruses. Antivirus programs. |
| III week exercises | |
| IV week lectures | The necessary protection of computer systems, policies and protection mechanisms. Basic concepts of cryptography and cryptanalysis. Cryptosystem classification. |
| IV week exercises | |
| V week lectures | Symmetric or classical encryption technique. Absolutely secure code. Confusion and diffusion and the basic principles of encryption. Block ciphers. Substitution and transposition techniques. |
| V week exercises | |
| VI week lectures | Feistel cipher. DES data encryption standard. Triple encryption. Decryption of DES code. Other symmetric ciphers. |
| VI week exercises | |
| VII week lectures | First test. |
| VII week exercises | |
| VIII week lectures | AES - Advanced Encryption Standard. Rijndael cipher. Reliability of symmetric ciphers. Location and placement of functions and encryption devices. |
| VIII week exercises | |
| IX week lectures | Public-Key algorithms. RSA algorithm. Verification protocols and design principles for authentication protocols. The authentication based on the shared key. |
| IX week exercises | |
| X week lectures | Installation of the shared key and Diffie-Hellman key exchange protocol. Validation using key distribution center and Needham-Schroeder authentication protocol. Originality establishment using Kerberos protocol. |
| X week exercises | |
| XI week lectures | Secret key electronic signature and Public-Key electronic signature. Hash functions. Message Digest generation using the SHA-1. Electronic beliefs. Access control and authentication as a protection mechanism. |
| XI week exercises | |
| XII week lectures | E-mail protection (PGP operations and protective multi-purpose Internet Mail Extension - S / MIME). Web protection (SSL and TLS Internet standard). Protection of electronic transactions. |
| XII week exercises | |
| XIII week lectures | Protection at the network level and IP protection. Transport and tunnel security mode, AH and ESP. Virtual private networks and tunneling. The protective barrier (firewall). |
| XIII week exercises | |
| XIV week lectures | Second test. |
| XIV week exercises | |
| XV week lectures | Correction of first or second test. |
| XV week exercises |
| Student workload | 4 credits x 30 hours = 120 hours |
| Per week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 0 excercises 3 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | Lessons attendance is mandatory for students, as well as doing home exercises, all tests and laboratory exercises. |
| Consultations | Every week. |
| Literature | 1. M. Strib, Č. Perkins - “Firewalls zaštita od hakera", Kompjuter biblioteka, “Svetlost”, Čačak, 2003. 2. S. McClure, J. Scambray, G. Kurtz - “Sigurnost na mreži”, Kompjuter biblioteka, “Svetlost”, Čačak, 2001. 3. W. Stallings, - “Cryptography and Networ |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ANALYSIS 3
| Course: | ANALYSIS 3/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 3969 | Obavezan | 3 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / PROGRAMMING 2
| Course: | PROGRAMMING 2/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 3976 | Obavezan | 4 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ANALYSIS 1
| Course: | ANALYSIS 1/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 3977 | Obavezan | 1 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | None. |
| Aims | The aim of the course is for students to adopt and master the basics of mathematical analysis: limit theory, elements of differential and integral calculus and the theory of series. |
| Learning outcomes | On successful completion of the course, students will be able to: 1. Define the basic notions of mathematical analysis 1: the set of real numbers, limit of a sequence and function, differentiability of a function, derivative and indefinite integral on an interval. 2. State the basic properties of the set of real numbers. 3. Derive basic propositions in limit theory and differential calculus, determine when a sequence or function has a limit, or when the function is continuous or differentiable. 4. Examine and associate properties of functions of a real variable using differential calculus. 5. Apply the acquired knowledge to solving different tasks related to the stated content of mathematical analysis. 6. Apply the acquired knowledge to solving real tasks and problems. |
| Lecturer / Teaching assistant | Prof. dr Žarko Pavićević –lecturer, Lazar Obradović – teaching assistant |
| Methodology | Lectures, exercises, homework assignments, consultations, written exams. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introducing students to basic topics studied in this course. |
| I week exercises | Introducing students to basic topics studied in this course. |
| II week lectures | The set of real numbers – axiomatic construction. |
| II week exercises | The set of real numbers – axiomatic construction. |
| III week lectures | Completeness principles of the set of real numbers. |
| III week exercises | Completeness principles of the set of real numbers. |
| IV week lectures | Theory of convergent sequences. |
| IV week exercises | Theory of convergent sequences. |
| V week lectures | Bolzano’s and Cauchy’s theorem for sequences. Banach fixed-point theorem. |
| V week exercises | Bolzano’s and Cauchy’s theorem for sequences. Banach fixed-point theorem. |
| VI week lectures | Topology on the set of real numbers. |
| VI week exercises | Topology on the set of real numbers. |
| VII week lectures | Study break |
| VII week exercises | Study break |
| VIII week lectures | Limit of a function. Continuity of a function at a point. |
| VIII week exercises | Limit of a function. Continuity of a function at a point. |
| IX week lectures | Basis of a set. Convergence and continuity of a function with regard to the basis of the set. |
| IX week exercises | Basis of a set. Convergence and continuity of a function with regard to the basis of the set. |
| X week lectures | Global properties of functions which are continuous on a closed interval. First written exam |
| X week exercises | Global properties of functions which are continuous on a closed interval. First written exam |
| XI week lectures | Uniform continuity of functions |
| XI week exercises | Uniform continuity of functions |
| XII week lectures | Differentiability of a function at a point. Derivative. Higher order derivatives. |
| XII week exercises | Differentiability of a function at a point. Derivative. Higher order derivatives. |
| XIII week lectures | Mean value theorem of differential calculus. Bernouli – L’Hopital’s rule. Taylor formulas. |
| XIII week exercises | Mean value theorem of differential calculus. Bernouli – L’Hopital’s rule. Taylor formulas. |
| XIV week lectures | Monotonicity and extrema of differentiable functions. Convexity of functions. Inflection points. |
| XIV week exercises | Monotonicity and extrema of differentiable functions. Convexity of functions. Inflection points. |
| XV week lectures | Examining properties and drawing the graph of a function. Second written exam |
| XV week exercises | Examining properties and drawing the graph of a function. Second written exam |
| Student workload | 10 credits x 30 hours = 300 hours |
| Per week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | Students are required to attend classes, do the homework assignments and take all exams. |
| Consultations | 1 hour a week (lectures) + 1 hour a week (exercises) |
| Literature | V. I. Gavrilov,,Ž. Pavićević, Matematička analiza I, I.M. Lavrentjev, R. Šćepanović, Zbirka zadataka iz mat. analize I |
| Examination methods | 4 homework assignments, 2 points each (8 points in total). 2 points for attendance. 2 written exams, 20 points each (40 points in total). Final exam, 50 points. Students who collect at least 51 points pass the course. |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ANALYSIS 2
| Course: | ANALYSIS 2/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 3978 | Obavezan | 2 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | None. |
| Aims | The aim of the course is for students to adopt and master the basics of mathematical analysis: limit theory, elements of differential and integral calculus and the theory of series. |
| Learning outcomes | On successful completion of the course, students will be able to: 1. Define the basic notions of mathematical analysis 2: Riemann integral on a closed interval, area of a curvilinear trapezoid, curve and curve length, volume and area of a solid of revolution, improper integral, convergent series. 2. Derive basic propositions related to the Riemann and improper integral and convergent series. 3. Calculate the Riemann integral as a limit of the sequence of integral sums. 4. Examine and associate the properties of differentiability and integrability of functions of a real variable. 5. Apply some integral formulas. 6. Apply the acquired knowledge to solving different tasks related to the stated content of mathematical analysis. 7. Apply the acquired knowledge to solving real tasks and problems. |
| Lecturer / Teaching assistant | Prof. dr Žarko Pavićević –lecturer |
| Methodology | Lectures, exercises, homework assignments, consultations, written exams. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introducing students to basics topics covered in this semester. |
| I week exercises | Introducing students to basics topics covered in this semester. |
| II week lectures | Indefinite integral. Antiderivative on an open interval. |
| II week exercises | Indefinite integral. Antiderivative on an open interval. |
| III week lectures | Antiderivative on an interval. |
| III week exercises | Antiderivative on an interval. |
| IV week lectures | Definition of the Riemann integral. Properties. |
| IV week exercises | Definition of the Riemann integral. Properties. |
| V week lectures | Criteria for the integrability of functions. |
| V week exercises | Criteria for the integrability of functions. |
| VI week lectures | Properties of the definite integral and integrable functions. Integral and derivative. |
| VI week exercises | Properties of the definite integral and integrable functions. Integral and derivative. |
| VII week lectures | Review. |
| VII week exercises | Review. |
| VIII week lectures | Some integral functions. |
| VIII week exercises | Some integral functions. |
| IX week lectures | First midterm exam. |
| IX week exercises | First midterm exam. |
| X week lectures | Functions of bounded variation. |
| X week exercises | Functions of bounded variation. |
| XI week lectures | Applications of the definite integral. Improper integral. |
| XI week exercises | Applications of the definite integral. Improper integral. |
| XII week lectures | Series. Convergence of series. |
| XII week exercises | Series. Convergence of series. |
| XIII week lectures | Criteria for the convergence of series with positive terms. |
| XIII week exercises | Criteria for the convergence of series with positive terms. |
| XIV week lectures | Functional sequences and series. Uniform convergence. |
| XIV week exercises | Functional sequences and series. Uniform convergence. |
| XV week lectures | Power series. Second midterm exam |
| XV week exercises | Power series. Second midterm exam |
| Student workload | |
| Per week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | Students are required to attend classes, do the homework assignments and take both midterm exams. |
| Consultations | As agreed with students. |
| Literature | V. I. Gavrilov, Ž. Pavićević, Matematička analiza I; B.P. Demidovič: Zbirka zadataka iz matematičke analize. |
| Examination methods | 4 homework assignments, 2 points each (8 points in total). 2 points for attendance. 2 written exams, 20 points each (40 points in total). Final exam, 50 points. Students who accumulate at least 50 points pass the course. |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / INTRODUCTION TO MATHEMATICAL LOGIC
| Course: | INTRODUCTION TO MATHEMATICAL LOGIC/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 3979 | Obavezan | 1 | 5 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises 3 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: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / PROGRAMMING 1
| Course: | PROGRAMMING 1/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 3983 | Obavezan | 3 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ENGLISH LANGUAGE 1
| Course: | ENGLISH LANGUAGE 1/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 5545 | Obavezan | 1 | 2 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | There are no prerequisites linked to other subjects. Knowledge of general English at least at the B1.2 level is desirable. |
| Aims | Mastery of grammatical and linguistic structures at the B2.1 level (upper-intermediate level) and active use of the language in everyday situations. |
| Learning outcomes | After completing this course, students will be able to: 1) Master language skills (reading, listening, speaking, writing) at the B2.1 level; 2) Use English grammar at the B2.1 level; 3) Prepare and deliver a presentation in English on covered/familiar thematic areas; 4) Express themselves orally in general English without major difficulties; 5) Integrate their foreign language knowledge and understanding of cultures in countries where it is spoken as a native language. |
| Lecturer / Teaching assistant | Igor Ivanović i Savo Kostić |
| Methodology | Introduction to appropriate language content, with maximum student participation in various types of written and oral exercises (individually, in pairs, in groups, projects, discussions). |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Home and away, the tense system/A life of learning: Listening/Speaking/Reading/Writing (Student’s book) |
| I week exercises | Home and away, the tense system (Workbook) |
| II week lectures | Compound words, Saroo’s story/ Verb tenses, verb patterns (Student’s book) |
| II week exercises | Compound words, Saroo’s story (Workbook) |
| III week lectures | Been there, got the T-shirt, Present Perfect simple and Continuous/ Time for a change: LSRW activities (Student’s book) |
| III week exercises | Been there, got the T-shirt, Present Perfect Simple and Continuous (Workbook) |
| IV week lectures | Hot verbs – make and do, our plastic planet/ Present, past habits/be used to, get used to; Word formation-suffixes (Student’s book) |
| IV week exercises | Hot verbs – make and do, our plastic planet (Workbook) |
| V week lectures | News and views, narrative tenses, spoken English/ It’s against the law: LSRW activities (Student’s book) |
| V week exercises | News and views, narrative tenses, spoken English (Workbook) |
| VI week lectures | Books and films, book at bedtime/ second conditional; third conditional; verbs and prepositions (Student’s book) |
| VI week exercises | Books and films, book at bedtime (Workbook) |
| VII week lectures | The First Mid-term Test |
| VII week exercises | The First Mid-term Test |
| VIII week lectures | The naked truth/Telling stories: LSRW activities (Student’s book) |
| VIII week exercises | The naked truth (Workbook) |
| IX week lectures | Questions and negatives, saying the opposite/ past verb forms; defining, non-defining, reducedrelative clauses (Student’s book) |
| IX week exercises | Questions and negatives, saying the opposite (Workbook) |
| X week lectures | Looking ahead, future forms/ Nature’s best: LSRW activities (Student’s book) |
| X week exercises | Looking ahead, future forms (Workbook) |
| XI week lectures | Hot verbs - take put, inspirational teenagers/ ways of comparing; future verb forms, adjectives for giving opinions (Student’s book) |
| XI week exercises | Hot verbs - take put, inspirational teenagers/ ways of comparing; future verb forms, adjectives for giving opinions (Workbook) |
| XII week lectures | Hitting the big time, expression of quantity/ Breaking codes: LSRW activities (Student’s book) |
| XII week exercises | Hitting the big time, expression of quantity (Workbook) |
| XIII week lectures | Words with variable stress, two famous brands/ modal verbs; uses of verb+ing; phrases with take (Student’s book) |
| XIII week exercises | Words with variable stress, two famous brands (Workbook) |
| XIV week lectures | General overview and preparation for the final exam |
| XIV week exercises | General overview and preparation for the final exam |
| XV week lectures | The Second Mid-term Test |
| XV week exercises | The Second Mid-term Test |
| Student workload | |
| Per week | Per semester |
| 2 credits x 40/30=2 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises -1 hour(s) i 40 minuts of independent work, including consultations |
Classes and final exam:
2 hour(s) i 40 minuts x 16 =42 hour(s) i 40 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 2 hour(s) i 40 minuts x 2 =5 hour(s) i 20 minuts Total workload for the subject: 2 x 30=60 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) 12 hour(s) i 0 minuts Workload structure: 42 hour(s) i 40 minuts (cources), 5 hour(s) i 20 minuts (preparation), 12 hour(s) i 0 minuts (additional work) |
| Student obligations | Attendance of classes, completion of midterms and final exam, participation in activities (homework, presentations, oral projects, discussions, etc.). |
| Consultations | In agreement with the instructors. |
| Literature | John and Liz Soars: Headway Upper-Intermediate, Fourth Edition, (Units 1 – 6), OUP |
| Examination methods | 1. Midterm - 50 points 2. Midterm - 50 points. A passing grade is achieved if a total of at least 50 points is collected. |
| Special remarks | None |
| Comment | None |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ENGLISH LANGUAGE 2
| Course: | ENGLISH LANGUAGE 2/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 5546 | Obavezan | 2 | 2 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequistes |
| Aims | The course has a goal to make students able to use English for specific purposes in the area of information technology at a higher level. |
| Learning outcomes | After students pass the exam, they will be able to: -distinguish, understand and use more complex information technology terminology in English in the areas of topology, networks, user interface, protocols. -read basic algorithms in English -understand basic messages of popular and expert texts from information technology and computer science in English -carry out oral and written communication in English at intermediate level, -orally present a chosen topic in English -write a summary of a text or recording in English |
| Lecturer / Teaching assistant | Savo Kostić |
| Methodology | Lectures and practice. Presentations in English on a topic studied. Studying for mid term and final exams. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | "Flash memory", reading comprehension, discussion, listening Grammar - word formation |
| I week exercises | |
| II week lectures | "Memory in a flash", reading comprehension, discussion, listening Grammar - language of describing |
| II week exercises | |
| III week lectures | "The operating system", reading comprehension, discussion, listening Grammar - countable and uncountable nouns |
| III week exercises | |
| IV week lectures | "GUI operating system", reading comprehension, discussion, listening Grammar - articles |
| IV week exercises | |
| V week lectures | "Word processing", reading comprehension, discussion, listening Grammar - asking for and providing information |
| V week exercises | |
| VI week lectures | "Spreadsheets and databases", reading comprehension, discussion, listening Grammar - plural of nouns |
| VI week exercises | |
| VII week lectures | Mid-term test |
| VII week exercises | |
| VIII week lectures | "The Internet and email", reading comprehension, discussion, listening Grammar - questions |
| VIII week exercises | |
| IX week lectures | "The Web", reading comprehension, discussion, listening Grammar - collocations, prefixes "e" and "cyber-" |
| IX week exercises | |
| X week lectures | "Chat and conferencing", reading comprehension, discussion, listening Grammar - abbreviations |
| X week exercises | |
| XI week lectures | "Internet security", reading comprehension, discussion, listening Grammar - The Past Simple Tense |
| XI week exercises | |
| XII week lectures | "The Internet and email", reading comprehension, discussion, listening Grammar - questions |
| XII week exercises | |
| XIII week lectures | "Graphic and design", reading comprehension, discussion, listening Grammar - "ing" form |
| XIII week exercises | |
| XIV week lectures | "Computer graphic", discussion Grammar - revision of all tenses |
| XIV week exercises | |
| XV week lectures | Preparation for the final exam |
| XV week exercises |
| Student workload | 2 classes, 45 minutes each |
| Per week | Per semester |
| 2 credits x 40/30=2 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises -1 hour(s) i 40 minuts of independent work, including consultations |
Classes and final exam:
2 hour(s) i 40 minuts x 16 =42 hour(s) i 40 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 2 hour(s) i 40 minuts x 2 =5 hour(s) i 20 minuts Total workload for the subject: 2 x 30=60 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) 12 hour(s) i 0 minuts Workload structure: 42 hour(s) i 40 minuts (cources), 5 hour(s) i 20 minuts (preparation), 12 hour(s) i 0 minuts (additional work) |
| Student obligations | Students need to regularly attend classes, make a presentation and take a mid term and a final exam. |
| Consultations | once a week for 2 hours |
| Literature | Infotech - English for computer users, Santiago Ramacha Esteras |
| Examination methods | Presentation - 25 points, Mid-term exam - 25 points, Final exam - 50 points |
| Special remarks | Classroom language is English |
| Comment | / |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ENGLISH LANGUAGE 3
| Course: | ENGLISH LANGUAGE 3/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 5547 | Obavezan | 3 | 4 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequisites |
| Aims | The course has a goal to make students able to use English for specific purposes in the area of computer science. |
| Learning outcomes | After students pass the exam, they will be able to: - understand the messages of expert discourse of the topic they often come across (computer viruses, communication protocols, programming languages, the concept of the Intenet), as well as the basic messages of more complex texts, - orally express topics on computer related topics in a relatively fluent way, using complex structures, exchange information and participate in conversations in English, - use grammar constructions at upper intermediate level, - write a short composition from known thematic areas, - make a presentation in English. |
| Lecturer / Teaching assistant | Savo Kostić |
| Methodology | Lectures and practice. Presentations in English on a topic studied. Studying for mid term and final exams. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | "Computer users", reading comprehension, listening, discussion Grammar - revision of past tenses |
| I week exercises | |
| II week lectures | "Computer architecture", reading comprehension, listening, discussion Grammar - spatial prepositions |
| II week exercises | |
| III week lectures | "Computer applications", reading comprehension, listening, discussion Grammar - present tense passive |
| III week exercises | |
| IV week lectures | "Peripherals", reading comprehension, listening, discussion Grammar - comparison and contrast |
| IV week exercises | |
| V week lectures | "Interview - former student", listening, discussion Grammar - past tenses questions |
| V week exercises | |
| VI week lectures | "Operating systems", reading comprehension, listening, discussion Grammar - "-ing" forms as nouns and after prepositions |
| VI week exercises | |
| VII week lectures | Mid-term exam |
| VII week exercises | |
| VIII week lectures | "Graphical user interface", reading comprehension, listening, discussion Grammar - object constructions |
| VIII week exercises | |
| IX week lectures | "Application programs", reading comprehension, listening, discussion Grammar - complex instructions |
| IX week exercises | |
| X week lectures | "Multimedia", reading comprehension, listening, discussion Grammar - "-ing clauses", cause and effect |
| X week exercises | |
| XI week lectures | "Interview - computing support", reading comprehension, listening, discussion Grammar - if sentences |
| XI week exercises | |
| XII week lectures | "Interview - revision", reading comprehension, listening, discussion Grammar - conditional sentences - revision |
| XII week exercises | |
| XIII week lectures | "Software engineering", reading comprehension, listening, discussion Grammar - if X then Y |
| XIII week exercises | |
| XIV week lectures | "Software engineering", revision Grammar - advantages and disadvantages |
| XIV week exercises | |
| XV week lectures | Preparation for the final exam |
| XV week exercises |
| Student workload | 2 classes, 45 minutes each |
| Per week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises 2 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | Students need to regularly attend classes, make a presentation and take a mid term and a final exam. |
| Consultations | once a week for 2 hours |
| Literature | Infotech - English for computer users, Santiago Ramacha Esteras |
| Examination methods | Presentation - 25 points, Mid-term exam - 25 points, Final exam - 50 points |
| Special remarks | Classroom language is English |
| Comment | / |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / ENGLISH LANGUAGE 4
| Course: | ENGLISH LANGUAGE 4/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 5548 | Obavezan | 4 | 4 | 2+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | No prerequisites |
| Aims | The course has a goal to make students able to use English for specific purposes in the area of computer science. |
| Learning outcomes | After students pass the exam they will be able to: - distinguish, understand and use complex computing terminology in from programming, Internet and more complex algorithms, - explain more complex computer procedures in English, - understand basic messages of popular and expert texts from the area of computing in English, - have oral and written communication in English at upper intermediate level, - orally present chosen topic in English. |
| Lecturer / Teaching assistant | Savo Kostić |
| Methodology | Lectures and practice. Presentations in English on a topic studied. Studying for mid term and final exams. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | "Networks", reading comprehension, listening, discussion Grammar - relative clauses with a participle |
| I week exercises | |
| II week lectures | "The Internet", reading comprehension, listening, discussion Grammar - warnings |
| II week exercises | |
| III week lectures | "The World Wide Web", reading comprehension, listening, discussion Grammar - time clauses |
| III week exercises | |
| IV week lectures | Websites"", reading comprehension, listening, discussion Grammar - giving advice |
| IV week exercises | |
| V week lectures | "Webpage creator", reading comprehension, listening, discussion Grammar - definitions and collocations |
| V week exercises | |
| VI week lectures | "Communication systems", reading comprehension, listening, discussion Grammar – prediction |
| VI week exercises | |
| VII week lectures | Mid-term test |
| VII week exercises | |
| VIII week lectures | "Computing support", reading comprehension, listening, discussion Grammar - diagnoses and advice |
| VIII week exercises | |
| IX week lectures | "Data Security 1", reading comprehension, listening, discussion Grammar - cause and effect |
| IX week exercises | |
| X week lectures | "Data Security 2", reading comprehension, listening, discussion Grammar - cause and effect – revision |
| X week exercises | |
| XI week lectures | "The ex-hacker", reading comprehension, listening, discussion Grammar - phrasal verbs |
| XI week exercises | |
| XII week lectures | "Recent Developments in IT", reading comprehension, listening, discussion Grammar - modal verbs for ability |
| XII week exercises | |
| XIII week lectures | "The ex-hacker", reading comprehension, listening, discussion Grammar - phrasal verbs |
| XIII week exercises | |
| XIV week lectures | "The future of IT", reading comprehension, listening, discussion Grammar - predictions |
| XIV week exercises | |
| XV week lectures | Preparation for the final exam |
| XV week exercises |
| Student workload | 2 classes, 45 minutes each |
| Per week | Per semester |
| 4 credits x 40/30=5 hours and 20 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 1 excercises 2 hour(s) i 20 minuts of independent work, including consultations |
Classes and final exam:
5 hour(s) i 20 minuts x 16 =85 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 5 hour(s) i 20 minuts x 2 =10 hour(s) i 40 minuts Total workload for the subject: 4 x 30=120 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) 24 hour(s) i 0 minuts Workload structure: 85 hour(s) i 20 minuts (cources), 10 hour(s) i 40 minuts (preparation), 24 hour(s) i 0 minuts (additional work) |
| Student obligations | Students need to regularly attend classes, make a presentation and take a mid term and a final exam. |
| Consultations | once a week for 2 hours |
| Literature | Infotech - English for computer users, Santiago Ramacha Esteras |
| Examination methods | Presentation - 25 points, Mid-term exam - 25 points, Final exam - 50 points |
| Special remarks | Classroom language is English |
| Comment | / |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / DISCRETE MATHEMATICS 2
| Course: | DISCRETE MATHEMATICS 2/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 6592 | Obavezan | 4 | 5 | 3+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per 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: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / DISCRETE MATHEMATICS 1
| Course: | DISCRETE MATHEMATICS 1/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 6593 | Obavezan | 3 | 5 | 3+1+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per 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: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / INFORMATION SYSTEMS DESIGN
| Course: | INFORMATION SYSTEMS DESIGN/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 6938 | Obavezan | 6 | 2 | 2+0+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 2 credits x 40/30=2 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 0 excercises 0 hour(s) i 40 minuts of independent work, including consultations |
Classes and final exam:
2 hour(s) i 40 minuts x 16 =42 hour(s) i 40 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 2 hour(s) i 40 minuts x 2 =5 hour(s) i 20 minuts Total workload for the subject: 2 x 30=60 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) 12 hour(s) i 0 minuts Workload structure: 42 hour(s) i 40 minuts (cources), 5 hour(s) i 20 minuts (preparation), 12 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / OPERATING SYSTEMS
| Course: | OPERATING SYSTEMS/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 9243 | Obavezan | 3 | 6 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | none |
| Aims | Through this course, students are introduced to the basic concepts of operating systems, their internal structure, methods of implementation, the principles and criteria of the design. In addition, the exercises students are introduced to the major modern operating systems, programming using system calls, as well as to the basics of shell programming. |
| Learning outcomes | After passing this exam , will be able to: 1. understand basic concepts of operating systems and their internal structure; 2. understand ways of realization, principles and criteria for design of operating systems and to use them in the programming; 3. use and understand the major modern operating systems; 4. design and develop programs using system calls; 5. develop programs using shell programming . |
| Lecturer / Teaching assistant | prof.dr Predrag Stanišić, doc.dr Savo Tomović |
| Methodology | Lectures, exercises in computer classroom / laboratory. Learning and practical exercises. Consultations. |
| Plan and program of work | |
| Preparing week | Preparation and registration of the semester |
| I week lectures | Introduction. The notion of operating system. OS as extended machine and resource manager. |
| I week exercises | Introduction to operating systems, MS-DOS. MS-DOS commands |
| II week lectures | History of operating systems. Types of operating systems. |
| II week exercises | Batch processing. Batch programs. First homework assignment. |
| III week lectures | Hardware overview. Processors, memory, I / O devices, bus. |
| III week exercises | Modern OS. Windows, Linux (features, multitasking, multiuser, structure, kernel, file system, ...). I test (theory, MS-DOS commands and batch programs). |
| IV week lectures | Basic concepts of the operating system. System calls. The structure of the OS. |
| IV week exercises | Basic commands of Linux. |
| V week lectures | Processes and threads. Modeling, activation, termination, state of the process, hierarchy, implementation. |
| V week exercises | Advanced commands of Linux. Other homework. |
| VI week lectures | Interprocess communication. Classical IPC problems. |
| VI week exercises | Advanced commands in Linux. II test (theory, shell programming and Linux commands). |
| VII week lectures | Colloquium |
| VII week exercises | Colloquium |
| VIII week lectures | Process scheduling. Thread scheduling. |
| VIII week exercises | Shell Programming. Bash shell, structure and run a shell script from the command line. Third homework |
| IX week lectures | Deadlocks. |
| IX week exercises | Control structures in shell programming (do, for, while, until). |
| X week lectures | Memory management. |
| X week exercises | Trap signal, export variable, writing and reading from file. |
| XI week lectures | Input/output management. |
| XI week exercises | C programs, compiling an running from command line (gcc). System calls for memory and I/O management. Fourth homework |
| XII week lectures | File systems. |
| XII week exercises | System calls for working with files. |
| XIII week lectures | Security. |
| XIII week exercises | System calls (fork, exec, pipe). Fifth homework |
| XIV week lectures | Multimedia OS. |
| XIV week exercises | III test C programs with system calls |
| XV week lectures | Multiprocessor and distributed OS. |
| XV week exercises | C programs with system calls |
| Student workload | weekly 7 credits x 40/30 = 8 hours Lectures: 3 hours Exercises: 3 hours Other teaching activities: 0 Individual work of students: 2 hours. semester Teaching and the final exam: 8 hours x 16 = 128 hours Preparation before the beginning of the semester (administration, enrollment, etc) 2 x (8 hours) = 16 hours Total hours for the course 6x30 = 180 hours Additional work for exams preparing correction of final exam, including the exam taking 0-36 hours (the remaining time of the first two items to the total work hours for the course, 180 hours) Structure: 128 hours (lectures) + 16 hours (preparation) 36 hours (additional work) |
| Per week | Per semester |
| 6 credits x 40/30=8 hours and 0 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 3 hour(s) i 0 minuts of independent work, including consultations |
Classes and final exam:
8 hour(s) i 0 minuts x 16 =128 hour(s) i 0 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 8 hour(s) i 0 minuts x 2 =16 hour(s) i 0 minuts Total workload for the subject: 6 x 30=180 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) 36 hour(s) i 0 minuts Workload structure: 128 hour(s) i 0 minuts (cources), 16 hour(s) i 0 minuts (preparation), 36 hour(s) i 0 minuts (additional work) |
| Student obligations | Students are required to attend lessons, fulfill tasks and home exercises, and attend colloquium. |
| Consultations | Cabinet |
| Literature | Tanenbaum: Modern Operating Systems, Prentice Hall International Silberchatz, Galvin: opearting Systems Concepts, Willey |
| Examination methods | The forms of knowledge testing and grading: - 5 home exercises carry 5 points total (1 point each), - 3 tests of 10 points - First test of 30 points - Final exam 35 points. |
| Special remarks | Lectures are conducted for a group of about 40-60 students, exercises in groups of about 20 students. Lectures may be taught in English and Russian. |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / SOFTVER ENGINEERING
| Course: | SOFTVER ENGINEERING/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 10153 | Obavezan | 6 | 5 | 3+2+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 5 credits x 40/30=6 hours and 40 minuts
3 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 1 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: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
Faculty of Science and Mathematics / COMPUTER SCIENCE / INTERACTIVE DESIGN AND VISUALIZATION
| Course: | INTERACTIVE DESIGN AND VISUALIZATION/ |
| Course ID | Course status | Semester | ECTS credits | Lessons (Lessons+Exercises+Laboratory) |
| 10162 | Obavezan | 6 | 2 | 2+0+0 |
| Programs | COMPUTER SCIENCE |
| Prerequisites | |
| Aims | |
| Learning outcomes | |
| Lecturer / Teaching assistant | |
| Methodology |
| Plan and program of work | |
| Preparing week | Preparation 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 week | Per semester |
| 2 credits x 40/30=2 hours and 40 minuts
2 sat(a) theoretical classes 0 sat(a) practical classes 0 excercises 0 hour(s) i 40 minuts of independent work, including consultations |
Classes and final exam:
2 hour(s) i 40 minuts x 16 =42 hour(s) i 40 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 2 hour(s) i 40 minuts x 2 =5 hour(s) i 20 minuts Total workload for the subject: 2 x 30=60 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) 12 hour(s) i 0 minuts Workload structure: 42 hour(s) i 40 minuts (cources), 5 hour(s) i 20 minuts (preparation), 12 hour(s) i 0 minuts (additional work) |
| Student obligations | |
| Consultations | |
| Literature | |
| Examination methods | |
| Special remarks | |
| Comment |
| Grade: | F | E | D | C | B | A |
| Number of points | less than 50 points | greater than or equal to 50 points and less than 60 points | greater than or equal to 60 points and less than 70 points | greater than or equal to 70 points and less than 80 points | greater than or equal to 80 points and less than 90 points | greater than or equal to 90 points |
