PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free Saxony Abitur Informatics Practice Questions

Saxony (Freistaat Sachsen) Abitur Informatics (Informatik) practice questions are available now; exam metadata is being verified.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately
100+ Questions
100% Free

Loading practice questions...

Same family resources

Explore More Saxony Abitur

Continue into nearby exams from the same family. Each card keeps practice questions, study guides, flashcards, videos, and articles in one place.

Saxony Abitur Ancient Greek (Griechisch)

Practice Questions

Saxony Abitur Biology (Biologie)

Practice Questions

Saxony Abitur Catholic Religion (Katholische Religion)

Practice Questions

Saxony Abitur Chemistry (Chemie)

Practice Questions

Saxony Abitur Civics, Law and Economics (Gemeinschaftskunde/Rechtserziehung/Wirtschaft)

Practice Questions

Saxony Abitur Czech (Tschechisch)

Practice Questions
2026 Statistics

Key Facts: Saxony Abitur Informatics Exam

Teil A/B/C

Sachsen LK Informatik uses three Prüfungsteile: foundational Pflichtaufgaben (A), practical Pflichtaufgaben (B), and one Wahlaufgabe from two options (C)

VwV Abiturprüfung 2026, Leistungskursfach Informatik

300 min

Gesamtarbeitszeit including Auswahlzeit; Prüfungsteil A at most 100 minutes before Hilfsmittel are released

VwV Abiturprüfung 2026, Arbeitszeiten Informatik

120 BE

LK Informatik scoring: Prüfungsteil A 40 BE; Prüfungsteile B+C together 80 BE on the 120-BE scale

VwV Abiturprüfung 2026, Bewertungsmaßstab Informatik

05.05.2026

Written Informatik date in the 2026 main session; Nachtermin 29.05.2026

schule.sachsen.de Gymnasium Terminübersicht Abiturprüfung 2026

Python / Java

Practical Hilfsmittel in B/C include Python 3 or Java documentation plus MMS and the IQB Formelsammlung

VwV Abiturprüfung 2026 Hilfsmittel; SMK Handreichung LK Informatik

0–15 Punkte

Grading scale for each Prüfungsfach after BE-to-Punkte conversion under Saxon Oberstufen rules

SOGYA / VwV Durchführung Oberstufe und Abiturprüfung

Free 100-question English MCQ study bank for Sachsen Abitur Informatik (LK). Official exam: German Teil A/B/C Klausur, 300 min (A ≤ 100 min), 120-BE scale (A 40 / B+C 80), written 05.05.2026 (Nach 29.05.2026); MMS + IQB Formelsammlung + Python/Java docs in B/C. Not an official-format simulation; no fee for regular school candidates.

Sample Saxony Abitur Informatics Practice Questions

Try these sample questions to test your Saxony Abitur Informatics exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1In computer science, an algorithm is best defined as:
A.A finite, precise sequence of unambiguous steps that solves a class of problems
B.Any set of English sentences describing a computer
C.A physical CPU instruction only
D.A database table schema
Explanation: An algorithm is a finite, unambiguous, effective procedure that transforms inputs into outputs for a defined problem class — the foundation of algorithmic problem solving in the Saxon Informatik Lehrplan.
2Which sorting algorithm repeatedly compares adjacent elements and swaps them if they are out of order?
A.Hashing
B.Bubblesort
C.Binary search
D.Depth-first search
Explanation: Bubblesort repeatedly passes through a list, swapping adjacent out-of-order pairs so that extreme values 'bubble' toward one end until the list is sorted.
3What is the typical worst-case time complexity of Bubblesort on n elements?
A.O(1)
B.O(n!)
C.O(n²)
D.O(log n)
Explanation: In the worst case Bubblesort performs nested comparisons across the list, giving quadratic O(n²) growth in n.
4Binary search on a sequence requires which precondition?
A.The sequence must contain only unique values and be unsorted
B.The sequence length must be a power of two
C.No precondition is required
D.The sequence must already be sorted in a consistent order
Explanation: Binary search repeatedly discards half the search interval by comparing with the middle element, which is correct only when the sequence is sorted.
5What is the time complexity of binary search on a sorted list of n elements?
A.O(log n)
B.O(n²)
C.O(n!)
D.O(2^n)
Explanation: Each step halves the remaining interval, so the number of comparisons grows logarithmically with n: O(log n).
6Which abstract data type follows the LIFO (Last-In, First-Out) principle?
A.Unordered bag only
B.Stack (Stapel)
C.Queue (Schlange)
D.Set with no order
Explanation: A stack removes the most recently pushed element first (LIFO), matching the Saxon Lehrplan emphasis on LIFO/FIFO principles.
7Which abstract data type follows the FIFO (First-In, First-Out) principle?
A.Binary search tree root only
B.Hash table collision chain only
C.Queue (Schlange)
D.Stack (Stapel)
Explanation: A queue enqueues at the rear and dequeues from the front, so the earliest inserted element leaves first (FIFO).
8In a singly linked list, each node typically stores:
A.Only an index into a fixed array with no references
B.Only a previous-node reference with no data
C.A complete copy of every other list node
D.A data value and a reference to the next node
Explanation: A singly linked list node holds its payload plus a pointer/reference to the successor, enabling dynamic insertion without shifting an array.
9Which traversal of a binary tree visits left subtree, then root, then right subtree?
A.In-order (Inorder)
B.Pre-order only
C.Level-order only
D.Post-order only
Explanation: In-order traversal processes left, then root, then right. For a binary search tree this yields keys in sorted order.
10Which traversal visits the root before its left and right subtrees?
A.Reverse in-order only
B.Pre-order (Preorder)
C.In-order only
D.Post-order only
Explanation: Pre-order visits the root first, then recursively the left and right subtrees — useful for copying a tree's structure.

About the Saxony Abitur Informatics Practice Questions

Verified exam format metadata for Saxony (Freistaat Sachsen) Abitur Informatics (Informatik) is pending. The practice questions above remain available while official exam length, timing, passing score, fee, and administrator details are reviewed.