Undergraduate study programme

Back   Loomen   Schedule   Hrvatski

Programming II P205

ECTS 5 | P 30 | A 0 | L 30 | K 0 | ISVU 37115 | Academic year: 2019./2020.

Course groups

Prikaži sve grupe na predmetu

Course lecturers

JOB JOSIP, Lecturer
ŠOJO ROBERT, Associate
PEKO MARINA, Associate
GRGIĆ JOSIP, Associate


Train students to apply procedural programming languages in practice through the acquisition of theoretical knowledge and problem solving.

Conditions for enrollment

Requirements for enrolment of the study programme.

Course description

Definition, declaration. Data types conversion. Scope and lifetime. Qualifiers. Complex data types - arrays, structures and unions. Data alignment and data structure packing. Pointers - pointers and arrays, pointer arithmetic. Memory management. Parameters passing by a value and an address. Text and binary files, sequential and direct access. Organising the code into multiple files. Code compilation process. The C programming language on different platforms. Portability.

Knowledge and skills acquired

Systematic approach to software development. Detailed knowledge of C programming language. Fundamentals of object-oriented programming.

Teaching methods

Lectures and laboratory exercises.

Student requirements

Defined by the Student evaluation criteria of the Faculty of Electrical Engineering, Computer Science and Information Technology Osijek and paragraph 1.9

Monitoring of students

Defined by the Student evaluation criteria of the Faculty of Electrical Engineering, Computer Science and Information Technology Osijek and paragraph 1.9

Student assessment

Assessment of laboratory exercises, revision exams.

Obligatory literature

1. 1 Šribar, J.; Motik, B. Desmistificirani C++, 3. dopunjeno izdanje 2010.

2. 2 Motik, Šribar Demistificirani C++ (2. izd.) Element, Zagreb, 2003.

Pretraži literaturu na:

Recommended additional literature

1. 1 Kernighan, Ritchie The C Programming Language Prentice-Hall, Englewood Cliffs, NJ, 1996

2. 2 Knuth The Art of Computer Programming, Vol. 1., Fundamental Algorithms Addison-Wesley, Reading, MA, 1997.

3. 3 Fischer Zbirka zadataka iz C-a ETF Osijek (Zavodska skripta), 1999.

Examination methods

Written and oral exam.

Course assessment

Conducting university questionnaires on teachers (student-teacher relationship, transparency of assessment criteria, motivation for teaching, teaching clarity, etc.). Conducting Faculty surveys on courses (upon passing the exam, student self-assessment of the adopted learning outcomes and student workload in relation to the number of ECTS credits allocated to activities and courses as a whole).

Overview of course assesment

Learning outcomes
Upon successful completion of the course, students will be able to:

1. compare and/or explain complex data types, pointers, functions, and file types using an appropriate example

2. select or design a suitable algorithm to solve problems by using different data and structural elements

3. propose an appropriate data structure and efficiently use memory in programming tasks

4. develop one’s own software solution of the given simple problem

Aktivnosti studenta: Vidi tablicu aktivnosti