Faculty of Science and Mathematics / COMPUTING AND INFORMATION TECHNOLOGY / COMPUTERS AND PROGRAMMING

Course:

COMPUTERS AND PROGRAMMING/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
495	Obavezan	1	7	3+3+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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
7 credits x 40/30=9 hours and 20 minuts 3 sat(a) theoretical classes 0 sat(a) practical classes 3 excercises 3 hour(s) i 20 minuts of independent work, including consultations	Classes and final exam: 9 hour(s) i 20 minuts x 16 =149 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 9 hour(s) i 20 minuts x 2 =18 hour(s) i 40 minuts Total workload for the subject: 7 x 30=210 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) 42 hour(s) i 0 minuts Workload structure: 149 hour(s) i 20 minuts (cources), 18 hour(s) i 40 minuts (preparation), 42 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 / COMPUTING AND INFORMATION TECHNOLOGY / OPERATING SYSTEMS

Course:

OPERATING SYSTEMS/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
506	Obavezan	2	6	3+3+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 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 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 / COMPUTING AND INFORMATION TECHNOLOGY / PROGRAMMING LANGUAGES

Course:

PROGRAMMING LANGUAGES/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
511	Obavezan	6	6	3+3+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
Prerequisites
Aims	Programming languages: The aim is becoming familiarized with the concepts of advanced software modelling tools, object-oriented modelling and UML language.
Learning outcomes	Capability to model software products from higher level of abstraction. Capability to produce, understand UML diagrams and translate them into code. Capability to programme in Java and C++ languages.
Lecturer / Teaching assistant	Igor Jovančević
Methodology	Lectures and practical work in a computer lab. Studying and independent work on practical projects. Consultations.

Plan and program of work
Preparing week	Preparation and registration of the semester
I week lectures	Basic concepts of object-oriented modelling
I week exercises	Lab work
II week lectures	Overview of UML, basic concepts, building blocks
II week exercises	Lab work
III week lectures	Use case diagrams
III week exercises	Lab work
IV week lectures	Class diagrams. Classes, interfaces. Object diagrams.
IV week exercises	Lab work
V week lectures	Interaction diagrams
V week exercises	Lab work
VI week lectures	Statechart diagrams and activity diagrams. Activities and actions
VI week exercises	Lab work
VII week lectures	Vacation week
VII week exercises
VIII week lectures	States: Transitions. Events. State diagrams.
VIII week exercises	Lab work
IX week lectures	Component diagrams
IX week exercises	Preparation for midterm exam
X week lectures	Midterm exam
X week exercises
XI week lectures	Implementation strategies: Associations, State diagrams
XI week exercises	Lab work
XII week lectures	Constraints: Object Constraint Language (OCL)
XII week exercises	Lab work
XIII week lectures	Reverse engineering. Collaboration diagrams
XIII week exercises	Lab work
XIV week lectures	Object-oriented principles
XIV week exercises	Lab work
XV week lectures	Design patterns
XV week exercises	Preparation for final exam

Student workload	15 weeks x 6h (lectures+lab) = 90 hours 15 weeks x 2h (homework, studying) = 30 hours 30h (additional work) Total: 150 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 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	Midterm and final exam. Homework. Lab work
Consultations
Literature	Practical Object-Oriented Design Using UML, 2nd Edition by Mark Priestley, 2003 UML Distilled : A Brief Guide to the Standard Object Modeling Language, Martin Fowler, 1999
Examination methods	Midterm (40 points), final exam(40 points), homework (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 / COMPUTING AND INFORMATION TECHNOLOGY / PERIPHERALS AND INTERFACES

Course:

PERIPHERALS AND INTERFACES/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
513	Obavezan	5	5	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
Prerequisites	No prerequisites required. Basic knowledge of C / C language is assumed.
Aims	The aim of this course is that students acquire the knowledge and techniques with which be able, with the help of computers, to (automatically) collect information from the outside world and to manage processes outside the computer. In addition to the theoretical part, significant attention is paid to practical work.
Learning outcomes	On successful completion of this course students should be able to: 1.
Lecturer / Teaching assistant	Prof. Dr. Neđeljko Lekić
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. Micro controllers. Development boards (Arduino Uno).
I week exercises	Introduction to the development environment.
II week lectures	Output ports. Seven-segment displays.
II week exercises	Examples and practical assignments.
III week lectures	Input ports.
III week exercises	Examples and practical assignments.
IV week lectures	Analog inputs and outputs.
IV week exercises	Examples and practical assignments.
V week lectures	Stepper motors.
V week exercises	Examples and practical assignments.
VI week lectures	Optical interfaces.
VI week exercises	Examples and practical assignments.
VII week lectures	Knowledge test.
VII week exercises	Knowledge test.
VIII week lectures	Servo motors.
VIII week exercises	Examples and practical assignments.
IX week lectures	Remote controls. LCD displays.
IX week exercises	Examples and practical assignments.
X week lectures	Sensors.
X week exercises	Examples and practical assignments.
XI week lectures	Communication interfaces: parallel, serial; SPI, TWI (I2C), UART, ZigBee, ...
XI week exercises	Examples and practical assignments.
XII week lectures	Wi-Fi, Ethernet, connecting to the internet.
XII week exercises	Examples and practical assignments.
XIII week lectures	Modems: AT commands, gsm, gprs, LoRa.
XIII week exercises	Examples and practical assignments.
XIV week lectures	Interfaces in industry. Visualization of industrial processes.
XIV week exercises	Examples and practical assignments.
XV week lectures	Correction of the knowledge test.
XV week exercises	Consultations.

Student workload	5 credits x 30 hours = 150 hours
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	Lessons attendance is mandatory for students, as well as doing exercises and knowledge test.
Consultations
Literature	Basic and auxiliary literature in electronic form on the course website. Z.Mijanović and others, »Računarski interfejsi i periferije«, University of Montenegro
Examination methods	Exercise: 26 points. Knowledge test: 24 points. Final exam: 50 points. Student gets the passing grade by collecting at least 50 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 / COMPUTING AND INFORMATION TECHNOLOGY / ENGLISH LANGUAGE I

Course:

ENGLISH LANGUAGE I/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1093	Obavezan	1	2	2+1+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 / COMPUTING AND INFORMATION TECHNOLOGY / ENGLISH LANGUAGE II

Course:

ENGLISH LANGUAGE II/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1094	Obavezan	2	2	2+1+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 / COMPUTING AND INFORMATION TECHNOLOGY / DATABASE SYSTEMS II

Course:

DATABASE SYSTEMS II/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1116	Obavezan	4	5	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 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	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 / COMPUTING AND INFORMATION TECHNOLOGY / MATHEMATICS I

Course:

MATHEMATICS I/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1310	Obavezan	1	7	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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
7 credits x 40/30=9 hours and 20 minuts 2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 5 hour(s) i 20 minuts of independent work, including consultations	Classes and final exam: 9 hour(s) i 20 minuts x 16 =149 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 9 hour(s) i 20 minuts x 2 =18 hour(s) i 40 minuts Total workload for the subject: 7 x 30=210 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) 42 hour(s) i 0 minuts Workload structure: 149 hour(s) i 20 minuts (cources), 18 hour(s) i 40 minuts (preparation), 42 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 / COMPUTING AND INFORMATION TECHNOLOGY / MATHEMATICS II

Course:

MATHEMATICS II/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1311	Obavezan	2	6	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
Prerequisites	Prerequisities do not exist.
Aims	Introduction of the basic mathematical notions and their applications in computer science.
Learning outcomes	After successful completion of this course, the student will be able to: 1.Calculate limit of a sequence by application of the fundamental theorems of theory of sequences. 2.Investigate continuity of function in a point. 3.Define the notion of derivative and find an equation of the tangent line and normal line to a graph of function at the point. 4.Apply the notion of derivative in investigation of functions. 5.Calculate integrals of certain types and quote the application of the definite integral. 6.Apply the classical definition of probability and the law(formula) of total probability.
Lecturer / Teaching assistant	PhD Sanja Jancic Rasovic, lectures M.Sc Lazar Obradovic, exercises
Methodology	Lectures, exercises,consultations .

Plan and program of work
Preparing week	Preparation and registration of the semester
I week lectures	Real numbers. Number sequences.Limit of a sequence.
I week exercises	Real numbers. Number sequences.Limit of a sequence
II week lectures	Properties of limits. The number e.
II week exercises	Properties of limits. The number e.
III week lectures	Real valued functions. Limit of a function.
III week exercises	Real valued functions. Limit of a function..
IV week lectures	Continuity of function .Properties of continuous functios.
IV week exercises	Continuity of function .Properties of continuous functios.
V week lectures	Differentiability of functions. Fundamental theorems of differential calculus.
V week exercises	Differentiability of functions. Fundamental theorems of differential calculus.
VI week lectures	Higher order derivatives. Taylor' Formula.
VI week exercises	Higher order derivatives. Taylor's Formula.
VII week lectures	Interim exam.
VII week exercises	Interim exam.
VIII week lectures	Application of derivative in investigation of functions.
VIII week exercises	Application of derivative in investigation of functions.
IX week lectures	Indefinite integral. Integration methods.
IX week exercises	Indefinite integral. Integration methods.
X week lectures	The definite integral. Newton-Leibniz formula.
X week exercises	The definite integral. Newton-Leibniz formula.
XI week lectures	Application of the definite integral.
XI week exercises	Application of the definite integral.
XII week lectures	Simple event. Classical definition of probability. Conditional probability.
XII week exercises	Simple event. Classical definition of probability. Conditional probability.
XIII week lectures	Random variables. Mathematical expectation and dispersion.
XIII week exercises	Random variables. Mathematical expectation and dispersion.
XIV week lectures	Correctional exam for interin exam.
XIV week exercises	Correctional exam for interim exam.
XV week lectures	Mathematical expectation and dispersion of continuous random variable.
XV week exercises	Mathematical expectation and dispersion of continuos random variable.

Student workload	A week 7x40./30=9 hours and 20 minutes 2 hours of lectures 2 hours of exercise 5 hours and 20 minutes of student work, including consultations During the semester Teachig and the final exam: 16x(9h and 20min)=85h and 20 min Necessery preparation (before semester administration, enrollment and verification): 2x9handf 20min=18 h and 40min. Total hours for the course::7x30 =210 hours Additional work : 0 to 42 hours Structure:: 149h 20min(lecture+final exam)+18h40min(preparation)+42h (additional work)
Per week	Per semester
6 credits x 40/30=8 hours and 0 minuts 2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 4 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 have to attend lectures and exercises, take interim exam and final exam.
Consultations	After the lectures.
Literature	Recommended literature: M.Jacimovic, P.Stanisic, Matematika, Podgorica 2001. Milicic, Uscumlic, Zbirka zadataka iz Matematike I, Beograd 1997.
Examination methods	-Interim exam 50 points -Final exam 50 points Grade A B C D E 91-100 81-90 71-80 61-70 51-60
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 / COMPUTING AND INFORMATION TECHNOLOGY / MATHEMATICS III

Course:

MATHEMATICS III/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1312	Obavezan	3	4	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
Prerequisites	None
Aims
Learning outcomes
Lecturer / Teaching assistant	Nevena Mijajlović
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 / COMPUTING AND INFORMATION TECHNOLOGY / MATHEMATICS IV

Course:

MATHEMATICS IV/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1313	Obavezan	4	6	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 4 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 / COMPUTING AND INFORMATION TECHNOLOGY / MATHEMATICS V

Course:

MATHEMATICS V/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1314	Obavezan	5	6	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 4 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 / COMPUTING AND INFORMATION TECHNOLOGY / PRINCIPLES OF PROGRAMMING

Course:

PRINCIPLES OF PROGRAMMING/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1335	Obavezan	2	6	3+3+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 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
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 / COMPUTING AND INFORMATION TECHNOLOGY / PROGRAMMING I

Course:

PROGRAMMING I/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1336	Obavezan	3	6	3+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 / COMPUTING AND INFORMATION TECHNOLOGY / PROGRAMMING II

Course:

PROGRAMMING II/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1337	Obavezan	4	6	3+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 / COMPUTING AND INFORMATION TECHNOLOGY / THEORY OF ALGORITHM COMPLEXITY

Course:

THEORY OF ALGORITHM COMPLEXITY/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1338	Obavezan	5	4	3+1+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 3 sat(a) theoretical classes 0 sat(a) practical classes 1 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 / COMPUTING AND INFORMATION TECHNOLOGY / INTRODUCTION TO COMPUTER SCIENCE

Course:

INTRODUCTION TO COMPUTER SCIENCE/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1339	Obavezan	1	7	3+3+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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
7 credits x 40/30=9 hours and 20 minuts 3 sat(a) theoretical classes 0 sat(a) practical classes 3 excercises 3 hour(s) i 20 minuts of independent work, including consultations	Classes and final exam: 9 hour(s) i 20 minuts x 16 =149 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 9 hour(s) i 20 minuts x 2 =18 hour(s) i 40 minuts Total workload for the subject: 7 x 30=210 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) 42 hour(s) i 0 minuts Workload structure: 149 hour(s) i 20 minuts (cources), 18 hour(s) i 40 minuts (preparation), 42 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 / COMPUTING AND INFORMATION TECHNOLOGY / DATA STRUCTURES

Course:

DATA STRUCTURES/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1340	Obavezan	2	6	3+3+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 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
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 / COMPUTING AND INFORMATION TECHNOLOGY / COMPUTER NETWORKS AND COMMUNICATIONS

Course:

COMPUTER NETWORKS AND COMMUNICATIONS/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1347	Obavezan	4	5	3+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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	First practical test.
VII week lectures	First theoretical test.
VII week exercises	Practical exercises in the computer classroom.
VIII week lectures	Network layer of the OSI model. Commutation and commutation methods. Internetworking.
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.
IX week exercises	Examples and practical assignments.
X week lectures	Data link layer correction protocols. Addressing of Ethernet networks at the data link layer. Ethernet protocol.
X week exercises	Examples and practical assignments.
XI 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.
XI week exercises	Examples and practical assignments.
XII week lectures	Local area networks and communication through the mediums with multiple access.
XII week exercises	Examples and practical assignments.
XIII week lectures	Switches and switching.
XIII week exercises	Second practical test.
XIV week lectures	Second theoretical test.
XIV week exercises	Examples and practical assignments.
XV week lectures	Consultations.
XV week exercises	Examples and practical assignments.

Student workload	6x30 = 180 hours in semester
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	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 (5 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 / COMPUTING AND INFORMATION TECHNOLOGY / COMPILERS

Course:

COMPILERS/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1348	Obavezan	5	6	3+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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	Midterm.
VIII week lectures	Semantic 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
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	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 (Pr
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 / COMPUTING AND INFORMATION TECHNOLOGY / VISUALIZATION AND COMPUTER GRAPHICS

Course:

VISUALIZATION AND COMPUTER GRAPHICS/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1349	Obavezan	6	3	2+1+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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
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
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 / COMPUTING AND INFORMATION TECHNOLOGY / ADVANCED PROGRAMMING TECHNIQUES

Course:

ADVANCED PROGRAMMING TECHNIQUES/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1352	Obavezan	5	4	2+0+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 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
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 / COMPUTING AND INFORMATION TECHNOLOGY / MATEMATICAL MODELLING

Course:

MATEMATICAL MODELLING/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1354	Obavezan	6	4	2+1+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
Prerequisites	Passed courses of Analysis, Analytic geometry and Linear algebra from first two years of the study program
Aims	In this course students are introduced to basic mathematical models from the areas of physics, biology, economy
Learning outcomes	On successful completion of this course, students will be able to: 1. Understand and analyze the concept and adequacy of a mathematical model 2. Apply techniques of mathematical modelling for modelling processes in various areas (economy, physics, biology, ...) 3. Have knowledge of the basics of game theory, and of the notion of an equilibrium of a game 4. Model processes using differential and partial differential equations, as well as probability theory
Lecturer / Teaching assistant	prof. dr Vladimir Jaćimović
Methodology	Lectures, exercises, seminar papers, consultations

Plan and program of work
Preparing week	Preparation and registration of the semester
I week lectures	The concept and adequacy of a mathematical model. Three phases of development and analysis of a mathematical model.
I week exercises	The concept and adequacy of a mathematical model. Three phases of development and analysis of a mathematical model.
II week lectures	Examples of mathematical models in various areas.
II week exercises	Examples of mathematical models in various areas.
III week lectures	Mathematical models in demographics and economy.
III week exercises	Mathematical models in demographics and economy.
IV week lectures	Mathematical models in economy.
IV week exercises	Mathematical models in economy.
V week lectures	Elements of game theory.
V week exercises	Elements of game theory.
VI week lectures	First midterm exam.
VI week exercises	First midterm exam.
VII week lectures	Lectures - recapitulation
VII week exercises	Lectures - recapitulation
VIII week lectures	Newtonian mechanics. Differential equation as a mathematical model.
VIII week exercises	Newtonian mechanics. Differential equation as a mathematical model.
IX week lectures	Ordinary differential equations. Pendulum and other simple examples.
IX week exercises	Ordinary differential equations. Pendulum and other simple examples.
X week lectures	Partial differential equations. Models of diffusion and vibration of string.
X week exercises	Partial differential equations. Models of diffusion and vibration of string.
XI week lectures	Probabilistic models: model of bankruptcy
XI week exercises	Probabilistic models: model of bankruptcy
XII week lectures	Second midterm exam
XII week exercises	Second midterm exam
XIII week lectures	Probabilistic models: Poisson processes and mass service
XIII week exercises	Probabilistic models: Poisson processes and mass service
XIV week lectures	Probabilistic models: Brownian motion
XIV week exercises	Probabilistic models: Brownian motion
XV week lectures	Statistical models of diffusion and irreversible processes. The problem of time in a mathematical model.
XV week exercises	Statistical models of diffusion and irreversible processes. The problem of time in a mathematical model.

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 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 must attend lectures, do seminar papers, midterm exams and the final exam.
Consultations	As agreed with students.
Literature	A. I. Falin: Aktuarska matematika u zadacima, Moskva 2003. 3. Rukopis predavanja
Examination methods	10 points - Attendance; 10 points - Seminar paper; 25 points - first midterm exam; 25 points - second midterm exam; 30 points - final exam. For a passing grade students must collect at least 50 points.
Special remarks	Lectures can be organized in English or Russian. Students attending the course are required to have computer knowledge.
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 / COMPUTING AND INFORMATION TECHNOLOGY / OBJECT ORIENTED PROGRAMMING

Course:

OBJECT ORIENTED PROGRAMMING/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1358	Obavezan	3	5	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 / COMPUTING AND INFORMATION TECHNOLOGY / DISTRIBUTED COMPUTER SYSTEMS

Course:

DISTRIBUTED COMPUTER SYSTEMS/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1359	Obavezan	3	6	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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. Analyze the advantages and disadvantages of specific parallel computing system architecture. 5. Understand the rules and algorithms for competitive program execution, precisely the competitive process. 6. 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.
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	7 credits x 30 hours = 210 hours
Per week	Per semester
6 credits x 40/30=8 hours and 0 minuts 2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 4 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, 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 6 points. Two tests are evaluated with a total of 64 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 / COMPUTING AND INFORMATION TECHNOLOGY / SOFTVER ENGINEERING

Course:

SOFTVER ENGINEERING/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1362	Obavezan	6	6	3+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 / COMPUTING AND INFORMATION TECHNOLOGY / COMPUTER SYSTEMS ARCHITECTURE

Course:

COMPUTER SYSTEMS ARCHITECTURE/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1796	Obavezan	5	5	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 / COMPUTING AND INFORMATION TECHNOLOGY / INTERNET TECHNOLOGIES

Course:

INTERNET TECHNOLOGIES/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
1797	Obavezan	4	6	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 two 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. XML and PHP.
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
6 credits x 40/30=8 hours and 0 minuts 2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 4 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	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
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 / COMPUTING AND INFORMATION TECHNOLOGY / DATABASE SYSTEMS I

Course:

DATABASE SYSTEMS I/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
2673	Obavezan	3	7	3+3+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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
7 credits x 40/30=9 hours and 20 minuts 3 sat(a) theoretical classes 0 sat(a) practical classes 3 excercises 3 hour(s) i 20 minuts of independent work, including consultations	Classes and final exam: 9 hour(s) i 20 minuts x 16 =149 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 9 hour(s) i 20 minuts x 2 =18 hour(s) i 40 minuts Total workload for the subject: 7 x 30=210 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) 42 hour(s) i 0 minuts Workload structure: 149 hour(s) i 20 minuts (cources), 18 hour(s) i 40 minuts (preparation), 42 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 / COMPUTING AND INFORMATION TECHNOLOGY / CRYPTOGRAPHY

Course:

CRYPTOGRAPHY/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
3444	Obavezan	6	4	2+0+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
Prerequisites	Enrolling in this course is not conditioned by passing other courses.
Aims	The aim of the course is introducing students to basics of symmetric and asymmetric cryptography.
Learning outcomes	On successful completion of this course, students will be able to: 1. Understand and apply definitions and propositions of Number theory 2. Understand basic propositions and algorithms of classic cryptography 3. Understand the notions of asymmetric cryptography and public and private key 4. Understand and apply algorithms of asymmetric cryptography 5. Understand the notion of digital signature, and implement digital signatures
Lecturer / Teaching assistant	prof. dr Vladimir Božović
Methodology	Lectures, exercises, consultations, group projects

Plan and program of work
Preparing week	Preparation and registration of the semester
I week lectures	Introduction to cryptography. History of cryptography. Basic substitution algorithms. Introduction to cryptoanalysis.
I week exercises	Introduction to cryptography. History of cryptography. Basic substitution algorithms. Introduction to cryptoanalysis.
II week lectures	Divisibility. Euclids algorithm.
II week exercises	Divisibility. Euclids algorithm.
III week lectures	Prime numbers and factorization. Modular arithmetic.
III week exercises	Prime numbers and factorization. Modular arithmetic.
IV week lectures	Chinese remainder theorem. Diophantine equations.
IV week exercises	Chinese remainder theorem. Diophantine equations.
V week lectures	Basic algebraic structures. Group, ring, field. System of remainders as a modular ring.
V week exercises	Basic algebraic structures. Group, ring, field. System of remainders as a modular ring.
VI week lectures	Arithmetic functions. Fermats and Eulers theorem.
VI week exercises	Arithmetic functions. Fermats and Eulers theorem.
VII week lectures	Symmetric cryptography. Examples of symmetric crypto-systems.
VII week exercises	Symmetric cryptography. Examples of symmetric crypto-systems.
VIII week lectures	Asymmetric cryptography. Problem of discrete logarithm in a finite field. Diffie-Hellman algorithm.
VIII week exercises	Asymmetric cryptography. Problem of discrete logarithm in a finite field. Diffie-Hellman algorithm.
IX week lectures	Mid-term exam. ElGamal algorithm. Complexity of the discrete logarithm problem.
IX week exercises	Mid-term exam. ElGamal algorithm. Complexity of the discrete logarithm problem.
X week lectures	Baby step-Giant step algorithm for computing the discrete logarithm. Chinese remainder theorem. Scheme of the Pohlig-Hellman algorithm.
X week exercises	Baby step-Giant step algorithm for computing the discrete logarithm. Chinese remainder theorem. Scheme of the Pohlig-Hellman algorithm.
XI week lectures	Factorization in cryptography. Eulers formula and roots modulo pq. Introduction to the RSA algorithm.
XI week exercises	Factorization in cryptography. Eulers formula and roots modulo pq. Introduction to the RSA algorithm.
XII week lectures	Implementation of RSA. Security questions for RSA. Influence of the RSA algorithm on the development of cryptography.
XII week exercises	Implementation of RSA. Security questions for RSA. Influence of the RSA algorithm on the development of cryptography.
XIII week lectures	Primality tests. Pollards algorithms for factorization. Factorization using difference of squares.
XIII week exercises	Primality tests. Pollards algorithms for factorization. Factorization using difference of squares.
XIV week lectures	Abels group of an elliptic curve. Elliptic curve over a finite field. Discrete logarithm on an elliptic curve.
XIV week exercises	Abels group of an elliptic curve. Elliptic curve over a finite field. Discrete logarithm on an elliptic curve.
XV week lectures	The notion and implementation of digital signatures. RSA digital signature.
XV week exercises	The notion and implementation of digital signatures. RSA digital signature.

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 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	Students must attend lectures, do and submit all project tasks and do the midterm and final exam.
Consultations	As agreed with students.
Literature	1. An Introduction to Mathematical Cryptography, Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman, 2008, ISBN: 978-0-387-77993-5. 2. A Course in Number Theory and Cryptography, Neal Koblitz, 1994, ISBN: 0-387-94293-9.
Examination methods	Midterm exam - 30 points Group project - 30 points Final exam - 30 points Attendance - 10 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 / COMPUTING AND INFORMATION TECHNOLOGY / ENGLISH LANGUAGE III

Course:

ENGLISH LANGUAGE III/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
4014	Obavezan	3	2	2+1+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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
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 / COMPUTING AND INFORMATION TECHNOLOGY / ENGLISH LANGUAGE IV

Course:

ENGLISH LANGUAGE IV/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
4015	Obavezan	4	2	2+1+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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
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 / COMPUTING AND INFORMATION TECHNOLOGY / MOBIL AND WIRELESS COMUNICATIONS

Course:

MOBIL AND WIRELESS COMUNICATIONS/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
6941	Obavezan	6	5	3+0+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 0 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 / COMPUTING AND INFORMATION TECHNOLOGY / PHYSICAL AND ELETRONIC FUNDAMENTALS OF COMPUTERS

Course:

PHYSICAL AND ELETRONIC FUNDAMENTALS OF COMPUTERS/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
8605	Obavezan	1	7	2+2+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
Prerequisites	there are no 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
7 credits x 40/30=9 hours and 20 minuts 2 sat(a) theoretical classes 0 sat(a) practical classes 2 excercises 5 hour(s) i 20 minuts of independent work, including consultations	Classes and final exam: 9 hour(s) i 20 minuts x 16 =149 hour(s) i 20 minuts Necessary preparation before the beginning of the semester (administration, registration, certification): 9 hour(s) i 20 minuts x 2 =18 hour(s) i 40 minuts Total workload for the subject: 7 x 30=210 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) 42 hour(s) i 0 minuts Workload structure: 149 hour(s) i 20 minuts (cources), 18 hour(s) i 40 minuts (preparation), 42 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 / COMPUTING AND INFORMATION TECHNOLOGY / PROGRAMMING LANGUAGE C

Course:

PROGRAMMING LANGUAGE C/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
10120	Obavezan	2	4	2+0+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 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
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 / COMPUTING AND INFORMATION TECHNOLOGY / INTERACTIVE DESIGN AND VISUALIZATION

Course:

INTERACTIVE DESIGN AND VISUALIZATION/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
10162	Obavezan	6	5	3+0+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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 0 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 / COMPUTING AND INFORMATION TECHNOLOGY / VISUALIZATION AND COMPUTER GRAPHICS

Course:

VISUALIZATION AND COMPUTER GRAPHICS/

Course ID	Course status	Semester	ECTS credits	Lessons (Lessons+Exercises+Laboratory)
10175	Obavezan	6	5	2+1+0

Programs	COMPUTING AND INFORMATION TECHNOLOGY
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