PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free Sachsen-Anhalt Abitur Information Technology Practice Questions

Sachsen-Anhalt Abitur Information Technology (Informationstechnik, berufliches Gymnasium Fachrichtung Technik) 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-Anhalt Abitur

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

Saxony-Anhalt Abitur Ancient Greek (Griechisch)

Practice Questions

Saxony-Anhalt Abitur Biology (Biologie)

Practice Questions

Saxony-Anhalt Abitur Business and Economics (Betriebs- und Volkswirtschaftslehre)

Practice Questions

Saxony-Anhalt Abitur Chemistry (Chemie)

Practice Questions

Saxony-Anhalt Abitur Engineering Sciences (Ingenieurswissenschaften)

Practice Questions

Saxony-Anhalt Abitur English (Englisch)

Practice Questions
2026 Statistics

Key Facts: Sachsen-Anhalt Abitur Information Technology Exam

14.04.2026

Statewide written main date for the Fachrichtung Technik subjects Informationstechnik and Ingenieurswissenschaften

Ministerium für Bildung des Landes Sachsen-Anhalt, Pressemitteilung 27/2026 vom 10.04.2026

~300 / ~210 min

Approximate written working time: erhöhtes Anforderungsniveau roughly 300 minutes, grundlegendes Anforderungsniveau roughly 210 minutes, plus about 30 minutes Auswahlzeit

RdErl. 'Vorbereitung und Durchführung der Abiturprüfung', Land Sachsen-Anhalt (re-issued annually)

4 competency areas

Qualifikationsphase content: structured modelling, object-oriented modelling, networks, databases

Fachlehrplan Informationstechnik Berufliches Gymnasium, Stand 01.08.2023

200 / 100 points

Minimum Gesamtqualifikation: at least 200 points in Block I (max 600, §38) and at least 100 points in Block II (max 300, §39), maximum total 900

Verordnung über die gymnasiale Oberstufe (Oberstufenverordnung), Sachsen-Anhalt

~5,600 candidates

Approximate number of Abitur candidates in Sachsen-Anhalt in the 2026 session

Ministerium für Bildung des Landes Sachsen-Anhalt, Pressemitteilung 27/2026

20 min

Vorbereitungszeit for the oral examination, extended to up to 40 minutes where a Schülerexperiment is set

§31 Abs. 2 Oberstufenverordnung, Sachsen-Anhalt

Free 100-question English MCQ study bank for Sachsen-Anhalt Abitur Informationstechnik, the profile subject of the berufliches Gymnasium Fachrichtung Technik. Official exam: structured German-language Klausur across algorithms, OOP/UML, networks and databases; roughly 300 minutes eA / 210 minutes gA plus Auswahlzeit; written date 14.04.2026. Not an official format simulation; no fee for regular school candidates.

Sample Sachsen-Anhalt Abitur Information Technology Practice Questions

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

1The Sachsen-Anhalt Fachlehrplan Informationstechnik lists the basic building blocks of program flow (Grundstrukturen von Programmabläufen). Which set names the three classical control structures of structured programming?
A.Sequence (Sequenz), selection (Selektion), and iteration (Iteration)
B.Sequence (Sequenz), recursion (Rekursion), and inheritance (Vererbung)
C.Selection (Selektion), encapsulation (Kapselung), and polymorphism (Polymorphie)
D.Iteration (Iteration), aggregation (Aggregation), and instantiation (Instanziierung)
Explanation: Structured programming is built from exactly three control structures: sequence (statements executed one after another), selection (a condition chooses between alternative branches), and iteration (a block is repeated). The Fachlehrplan adds the Funktionsblock as a fourth structuring element for modularisation, but the three flow-control primitives are sequence, selection and iteration.
2What structural property distinguishes a Struktogramm (Nassi-Shneiderman diagram) from a Programmablaufplan (flowchart)?
A.A Struktogramm is built from nested rectangular blocks with no connecting arrows, so unstructured jumps cannot be drawn
B.A Struktogramm may only represent sequences, while loops must always be drawn as a Programmablaufplan
C.A Struktogramm shows the runtime memory layout of variables, while a Programmablaufplan shows control flow
D.A Struktogramm is written in a specific programming language, while a Programmablaufplan is language-independent
Explanation: A Struktogramm partitions one outer rectangle into nested sub-rectangles. Because control flow is expressed purely by nesting rather than by arrows, an arbitrary GOTO-style jump has no notation — the diagram enforces structured programming. A Programmablaufplan uses shapes joined by directed arrows, which can express unstructured jumps.
3Trace the algorithm and give the printed value: s ← 0 FOR i ← 1 TO 5 DO IF i MOD 2 = 1 THEN s ← s + i END IF END FOR OUTPUT s
A.9
B.15
C.6
D.25
Explanation: i MOD 2 = 1 is true exactly for the odd values 1, 3 and 5. The accumulator therefore receives 1 + 3 + 5 = 9. The even values 2 and 4 fail the condition and are skipped.
4Bubble sort ascending compares each adjacent pair from left to right and swaps if the left element is larger. What is the array after exactly ONE complete pass over [5, 1, 4, 2, 8]?
A.[1, 4, 2, 5, 8]
B.[1, 2, 4, 5, 8]
C.[1, 5, 4, 2, 8]
D.[5, 1, 4, 2, 8]
Explanation: Pass 1: (5,1) swap → [1,5,4,2,8]; (5,4) swap → [1,4,5,2,8]; (5,2) swap → [1,4,2,5,8]; (5,8) no swap. Result [1, 4, 2, 5, 8]. One pass guarantees only that the largest element has bubbled to the last position.
5How many key comparisons does linear (sequential) search need in the worst case on an unsorted array with n elements?
A.n
B.n / 2
C.log₂(n)
D.n²
Explanation: In the worst case the sought key is in the last position or absent entirely, so every one of the n elements must be compared: n comparisons.
6A sorted array holds 100 elements. What is the maximum number of key comparisons binary search needs to decide whether a given key is present?
A.7
B.10
C.50
D.100
Explanation: Each comparison halves the remaining search interval: 100 → 50 → 25 → 12 → 6 → 3 → 1 → 0. That is 7 halvings, matching ⌊log₂(100)⌋ + 1 = 6 + 1 = 7 comparisons in the worst case.
7In a C/Java-style language a two-dimensional array is declared as int m[4][6]. How many int elements does it hold?
A.24
B.10
C.35
D.20
Explanation: In C/Java-style declarations the numbers are element counts, so the array has 4 rows of 6 columns: 4 × 6 = 24 elements, with valid indices m[0][0] to m[3][5].
8Trace the nested loop and state the final value of count: count ← 0 FOR i ← 1 TO 4 DO FOR j ← i TO 4 DO count ← count + 1 END FOR END FOR
A.10
B.16
C.6
D.12
Explanation: The inner loop starts at j = i, so it runs 4 times for i = 1, 3 times for i = 2, 2 times for i = 3 and 1 time for i = 4. Total = 4 + 3 + 2 + 1 = 10.
9A program must repeatedly insert new elements at the FRONT of a collection of n elements. Which comparison of an array with a singly linked list is technically correct?
A.The linked list needs only a constant number of pointer assignments, while the array must shift all n existing elements one position to the right
B.Both structures need to shift all n elements, so insertion cost is identical
C.The array is faster because contiguous memory allows insertion without moving elements
D.The linked list is slower because every insertion requires re-sorting the whole list
Explanation: A singly linked list inserts at the front by creating a node, pointing its next reference at the old head and updating the head reference — a constant amount of work independent of n. An array stores elements contiguously, so making room at index 0 forces every existing element to move up one slot: n move operations.
10Which statement describes the Wasserfallmodell (waterfall model) of software development named in the Fachlehrplan?
A.Phases such as analysis, design, implementation and test run strictly one after another, each being completed and documented before the next begins
B.A rough version of the product is built immediately and then repeatedly refined together with the customer
C.Development and operation merge into a continuous loop with automated deployment several times a day
D.Each phase is executed by an independent team in parallel and the results are merged at the end
Explanation: The waterfall model is the classical sequential model: each phase produces a completed, documented result that is the input to the next phase, and the flow is meant to run only downwards. Its strength is planning and documentation discipline; its weakness is that late requirement changes are expensive.

About the Sachsen-Anhalt Abitur Information Technology Practice Questions

Verified exam format metadata for Sachsen-Anhalt Abitur Information Technology (Informationstechnik, berufliches Gymnasium Fachrichtung Technik) is pending. The practice questions above remain available while official exam length, timing, passing score, fee, and administrator details are reviewed.