All Practice Exams

Free Practice Questions for Državna Matura Informatics

Exam-style questions and explanations by OpenExamPrep.

✓ No registration✓ No credit card
100+ Questions
100% Free

Loading practice questions...

Exam Review

Key Facts: Državna Matura Informatics Exam

Administered centrally across Croatia by NCVVO (Nacionalni centar za vanjsko vrednovanje obrazovanja).

Governed by the national Pravilnik o polaganju državne mature (NN 56/2026).

Total examination duration is exactly 100 continuous minutes in a single paper-based session.

The exam comprises 50 scoreable points distributed across multiple-choice and short-answer tasks.

Minimum passing threshold is 25% (12.50 out of 50 points) to achieve the passing grade dovoljan (2).

Higher grade thresholds: dobar (25.00 pts), vrlo dobar (35.00 pts), and odličan (42.50 pts).

Standard non-programmable scientific calculator permitted; no computers or internet access allowed.

Crucial elective exam for admission to faculties of computing (FER, PMF, FOI, FESB, TVZ).

Examination results directly feed into the national central university admissions platform (Postani-student).

The Croatian Državna matura Informatics (Informatika) is a 100-minute, 50-point national elective exam testing algorithms, programming, computer architecture, networking, and relational databases; 12.50/50 points (25%) is required to pass.

Sample Državna Matura Informatics Practice Questions

Try these sample questions to review concepts for the Državna Matura Informatics exam. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1What is the output of the following Python code snippet? x = 14 y = 4 print(x // y, x % y)
A.3 2
B.3.5 2
C.3 0
D.2 3
Explanation: In Python, the integer division operator // computes the floor quotient (14 // 4 = 3), while the modulo operator % computes the remainder (14 % 4 = 2). Therefore, the output printed is '3 2'.
2What will be printed after executing the following Python statements? text = 'DrzavnaMatura' print(text[3:7])
A.zavn
B.avnam
C.avna
D.zavnam
Explanation: Python strings use 0-based indexing. In 'DrzavnaMatura': index 0 is 'D', 1 is 'r', 2 is 'z', 3 is 'a', 4 is 'v', 5 is 'n', 6 is 'a', and 7 is 'M'. Slicing [3:7] takes characters from index 3 up to but excluding index 7, producing 'avna'.
3How many times does the print function execute in the following Python loop? count = 0 for i in range(2, 11, 3): print(i)
A.4 times
B.3 times
C.5 times
D.9 times
Explanation: The range(start, stop, step) generates numbers starting at 2, incrementing by 3, while strictly less than 11. The generated values are 2, 5, and 8. The next value would be 11, which reaches the stop bound and terminates the loop. Thus, the body executes exactly 3 times.
4Consider the following Python list operations: a = [3, 7, 1] a.append(5) a.sort() print(a[1]) What is the printed value?
A.3
B.1
C.5
D.7
Explanation: Starting with a = [3, 7, 1], append(5) results in [3, 7, 1, 5]. Then sort() orders the elements ascending to [1, 3, 5, 7]. Accessing a[1] retrieves the element at 0-based index 1, which is 3.
5What is the final value of variable s after executing the following algorithm? s = 0 for k in range(1, 6): if k % 2 != 0: s += k print(s)
A.9
B.15
C.6
D.4
Explanation: range(1, 6) generates integers 1, 2, 3, 4, 5. The condition k % 2 != 0 checks whether k is odd. The odd values are 1, 3, and 5. Their sum is 1 + 3 + 5 = 9.
6In computational complexity analysis, what is the best-case time complexity of standard Bubble Sort on an array of n already sorted elements (using an early termination flag)?
A.O(n log n)
B.O(n)
C.O(n^2)
D.O(1)
Explanation: When an early-termination flag is used to detect if any swaps occurred during a pass, Bubble Sort completes a single pass of n - 1 comparisons, detects zero swaps, and halts immediately, giving a best-case time complexity of O(n).
7Which data structure follows the First-In, First-Out (FIFO) principle?
A.Stack (stog)
B.Binary search tree (binarno stablo traženja)
C.Queue (red)
D.Priority heap (gomila)
Explanation: A queue operates under the FIFO (First-In, First-Out) principle: the first element added to the back of the queue is the first element removed from the front.
8What is the return value of len(set([1, 2, 2, 3, 3, 3, 4])) in Python?
A.4
B.7
C.3
D.1
Explanation: In Python, a set automatically eliminates duplicate elements. Passing the list [1, 2, 2, 3, 3, 3, 4] into set() yields {1, 2, 3, 4}, which contains exactly 4 distinct elements. Calling len() on this set returns 4.
9Trace the following Python code snippet. What is the value of result? def mystery(n): if n <= 1: return 1 return n * mystery(n - 1) result = mystery(4)
A.10
B.16
C.12
D.24
Explanation: The function mystery calculates the factorial of n recursively: mystery(4) = 4 * mystery(3) = 4 * (3 * mystery(2)) = 4 * 3 * (2 * mystery(1)) = 4 * 3 * 2 * 1 = 24.
10What is the output of the following Python program? x = [10, 20, 30, 40, 50] total = 0 for i in range(len(x)): if i % 2 == 0: total += x[i] print(total)
A.60
B.150
C.50
D.90
Explanation: The loop iterates through index positions i = 0, 1, 2, 3, 4. The condition i % 2 == 0 selects even indices: i = 0, 2, and 4. The corresponding elements are x[0] = 10, x[2] = 30, and x[4] = 50. Their sum is 10 + 30 + 50 = 90.

About the Državna Matura Informatics Exam

The Državna matura in Informatics (Informatika) is the standardized national elective school-leaving examination administered across Croatia by the National Centre for External Evaluation of Education (NCVVO). It serves as a vital elective examination for secondary school graduates (gimnazija and vocational school seniors) intending to enroll in university programs in computer science, software engineering, electrical engineering, information technology, and applied mathematics—including top faculties such as FER (Faculty of Electrical Engineering and Computing in Zagreb), PMF (Faculty of Science), FOI (Faculty of Organization and Informatics in Varaždin), FESB (Split), and TVZ (Zagreb). The examination comprises 50 scoreable points administered over a single 100-minute testing session. Content is structured into four core blueprint domains: Computational Thinking and Programming (40%), Computer Architecture and Hardware (25%), Computer Networks and Internet (20%), and Information Systems and Databases (15%). Testing is paper-based without actual computers; candidates evaluate code snippets and pseudocode by hand and may use an approved non-programmable scientific calculator.

Exam sponsor: NCVVO. The requirements and fees below concern the certification or admission exam, separate from our free practice resources.

Questions

50 questions

Time Limit

100 minutes

Passing Score

12.50 out of 50 points (25%)

Exam / Certification Fees

Free for regular seniors; fee per exam applies for re-sits/external candidates.

Exam sponsor website

Fees, eligibility, and exam policies can change. Confirm them with the exam sponsor before applying or paying.

Our practice resources: topics covered

We aim to reflect publicly available exam outlines and topic information in our study resources. Coverage, format, and difficulty may differ from the actual exam, and we cannot guarantee that every detail is accurate or current. Confirm exam requirements, fees, and policies with the official exam sponsor.

54%

Računalno razmišljanje i programiranje (Computational Thinking & Programming)

Problem analysis and decomposition, algorithm design, simple data types and expressions, branching and iteration, functions and recursion, one- and two-dimensional arrays, string operations, and sorting/searching. Exam tasks are set in Python or C/C++, the two programming languages named in the NCVVO Ispitni katalog.

36%

Informacije i digitalna tehnologija (Information & Digital Technology)

Computer system components and their functions, hierarchical file organisation and file formats, file compression, binary and hexadecimal representation of different data types, Boolean expressions and logic circuits, and the organisation and querying of structured data including relational databases and SQL.

10%

Digitalna pismenost i komunikacija i e-Društvo (Digital Literacy, Communication & e-Society)

Locating and evaluating online sources, computer networks and internet services, safe and responsible online communication, information security and cryptography basics, data protection and privacy (GDPR), intellectual property, and the social impact of digital technology.

Preparing for the Državna Matura Informatics Exam

What You Need to Know

  • Passing score: 12.50 out of 50 points (25%)
  • Exam length: 50 questions
  • Time limit: 100 minutes
  • Exam / certification fees: Free for regular seniors; fee per exam applies for re-sits/external candidates. Official sources

Using Our Practice Resources

  • Work through all 100 available questions
  • Review every answer and explanation
  • Track weak areas and revisit them
  • Use our AI tutor for tough concepts

Državna Matura Informatics: Suggested Study Strategy

1Master manual code tracing: practice constructing neat trace tables showing variable states after each iteration of nested loops and conditional branches.
2Memorize powers of 2 up to 2^16 (65536) and practice mental base conversions between binary, octal, decimal, and hexadecimal representation.
3Practice Boolean algebra simplification laws thoroughly, including De Morgan's laws, absorption laws, and distributive laws for logic circuit analysis.
4Review IPv4 subnetting and CIDR notation calculations: be proficient at determining network addresses, broadcast addresses, and the number of usable hosts from a given subnet mask.
5Drill standard SQL query syntax and execution order: understand how WHERE filters individual rows before GROUP BY aggregates them, and how HAVING filters aggregate groups.
6Work through past official NCVVO exam papers under timed 100-minute conditions to develop the quick mental agility needed for paper-based code evaluation.
7Understand two's complement arithmetic for 8-bit and 16-bit signed integers, including the range of representable numbers and sign-extension rules.

Frequently Asked Questions

What is the structure and duration of the Državna matura Informatics exam?

The Državna matura Informatics exam is an elective examination consisting of 50 scoreable points administered in a single paper-based session lasting 100 minutes without breaks. The paper includes multiple-choice questions (closed items with four choices) and short constructed-response questions requiring numerical answers, boolean outputs, or traced program outputs.

What is the minimum passing score on the Informatics exam?

The minimum passing threshold (prag prolaznosti for ocjena dovoljan 2) established by NCVVO is 25%, corresponding to 12.50 out of 50 points. Typical historical thresholds for higher grades are: dobar (3) at 50% (25.00 points), vrlo dobar (4) at 70% (35.00 points), and odličan (5) at 85% (42.50 points).

Are computers used during the Državna matura Informatics examination?

No. The examination is entirely paper-based. Candidates do not write or execute code on a computer; instead, all programming tasks involve reading, tracing, and dry-running code snippets or pseudocode by hand using trace tables and pen and paper.

Which programming languages and notations are tested in the programming section?

The programming domain focuses on Python and standard algorithmic pseudocode (with C++ also recognized in curriculum standards). Tasks test language-agnostic algorithmic logic, including loop counters, indexing, string slicing, recursive calls, branch conditions, and data structure manipulation.

What calculators or reference materials are permitted in the exam room?

Candidates are permitted to use an approved standard non-programmable scientific calculator without graphic displays or symbolic algebra (CAS) capabilities. No formula sheets or textbook reference aids are permitted for Informatics; candidates must know fundamental formulas, binary powers, and Boolean algebra laws.

Which higher education institutions require or award points for Državna matura Informatics?

The Informatics exam is an elective subject (izborni predmet) heavily weighted by computer science, software engineering, and electrical engineering faculties across Croatia, such as FER Zagreb, PMF Zagreb (Matematika i računarstvo), FOI Varaždin, FESB Split, FERIT Osijek, and TVZ Zagreb. For many STEM study programs, taking Informatics provides significant bonus admission points.

How are incorrect answers scored on the multiple-choice questions?

There is no negative marking on the Croatian Državna matura. An incorrect response or an omitted question yields 0 points. Therefore, candidates should always mark an answer for every single question before the 100-minute time expires.