PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free Hesse Abitur CS LK Practice Questions

Hesse Landesabitur Informatik — Leistungskurs (advanced course / erhöhtes Niveau) 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 Hesse Landesabitur

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

Hesse Landesabitur Ancient Greek — advanced course (Leistungskurs)

Practice Questions

Hesse Landesabitur Ancient Greek — basic course (Grundkurs)

Practice Questions

Hesse Landesabitur Art — advanced course (Leistungskurs)

Practice Questions

Hesse Landesabitur Art — basic course (Grundkurs)

Practice Questions

Hesse Landesabitur Catholic Religious Education — advanced course (Leistungskurs)

Practice Questions

Hesse Landesabitur Catholic Religious Education — basic course (Grundkurs)

Practice Questions
2026 Statistics

Key Facts: Hesse Abitur CS LK Exam

300 min

Bearbeitungszeit for Leistungsfach (including selection time) per §25 Abs. 2 OAVO

LA26 Abiturerlass, section II

A + B + C

LK: Pflichtaufgaben A and B plus one of C1/C2; three Aufgaben cover three Kurshalbjahre

LA26 Abiturerlass, Informatik section 23.2–23.3

Java | Python

Pflichtaufgabe A language variants; Prüfling receives the classroom language

LA26 Abiturerlass, Informatik section 23.2

15.04.–08.05.2026

Written Landesabitur 2026 window; Nachprüfungen 19.05.–03.06.2026

LA26 Abiturerlass, section II

Q1.4 + Q3.5

LK-only Themenfelder beyond GK: höhere Datenstrukturen; Registermaschine

LA26 Abiturerlass, Informatik section 23.4

Free 100-question English MCQ study bank for Hesse Landesabitur Informatik Leistungskurs. Official exam: German constructed-response Klausur (EPA Informatik 2004), Pflicht A+B plus choose C1/C2, three Kurshalbjahre, 300 min incl. selection time, Notenpunkte 0–15, centrally set. LK extras: Q1.4 höhere Datenstrukturen, Q3.5 Registermaschine. Aids: Rechtschreibwörterbuch + Operatorenliste. Written window 15.04.–08.05.2026. Not an official format or language simulation; no fee for regular school candidates.

Sample Hesse Abitur CS LK Practice Questions

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

1Per the LA26 Abiturerlass, what is the Bearbeitungszeit for Informatik as a Leistungsfach?
A.300 minutes including selection time
B.255 minutes including selection time
C.240 minutes plus a separate 60-minute Auswahlzeit
D.285 minutes as for modern foreign language Leistungsfächer
Explanation: §25 Abs. 2 OAVO / LA26 section II sets 300 minutes Bearbeitungszeit for a Leistungsfach, including non-separately-identified selection time. The 255-minute figure is the Grundkurs timing.
2What is the official written Informatik exam task framework in Hesse LA26?
A.Aufgabenarten nach EPA Informatik (5 February 2004)
B.Only multiple-choice items published statewide
C.EPA Mathematik 2012 task types exclusively
D.Oral Facharbeit with no written Klausur
Explanation: LA26 §23.2 bases Informatik Aufgabenarten on EPA Informatik in der Fassung vom 5. Februar 2004. The official paper is constructed-response, not MCQ.
3In the Informatik Leistungskurs Auswahlmodus, what does the Prüfling complete?
A.Pflichtaufgaben A and B plus exactly one of C1 or C2 (three Kurshalbjahre)
B.Only Pflichtaufgabe A and one of B1/B2 (two Aufgaben total)
C.All of A, B, C1, and C2 in full
D.Any single Aufgabe chosen freely from four proposals
Explanation: LA26 §23.3: LK candidates work Pflichtaufgaben A and B, then choose one of C1/C2 covering the remaining Kurshalbjahr — three Aufgaben across three Kurshalbjahre. The two-Aufgabe A+(B1|B2) pattern is the Grundkurs mode.
4Which language variants are offered for Pflichtaufgabe A (Algorithmik/OOP) in LA26 Informatik?
A.Java and Python; the Prüfling receives the classroom language variant
B.Only Scheme and Haskell
C.Only assembler for Registermaschine
D.Any language including unrestricted internet documentation
Explanation: Pflichtaufgabe A is offered in Java and Python; the Prüfling receives the variant used in class (LA26 §23.2).
5Across its three Aufgaben, the LA26 Informatik Leistungskurs written exam covers how many Kurshalbjahre of the Qualifikationsphase?
A.Three Kurshalbjahre, one per Aufgabe (A, B, and the chosen C)
B.Exactly one Kurshalbjahr repeated three times
C.Five Kurshalbjahre, one per Prüfungsleistung
D.All four Kurshalbjahre in every Aufgabe
Explanation: LA26 §23.3 assigns each of the three LK Aufgaben (Pflicht A, Pflicht B, and the chosen C1/C2) to a distinct Kurshalbjahr, so three Kurshalbjahre are examined — a Leistungskurs structural fact beyond the GK two-Aufgabe pattern.
6The information-theoretic lower bound for any comparison-based sort of n distinct keys is:
A.Ω(n log n) comparisons
B.Ω(n) comparisons
C.Ω(n²) comparisons
D.Ω(log n) comparisons
Explanation: A comparison sort corresponds to a binary decision tree over n! orderings; its height is at least ⌈log₂(n!)⌉ = Ω(n log n) (Stirling). This lower bound is standard erhöhtes Niveau analysis.
7Heapsort's worst-case time complexity on n elements is:
A.Θ(n log n)
B.Θ(n²)
C.Θ(n)
D.Θ(2ⁿ)
Explanation: Building the heap is O(n) and each of the n extractions costs O(log n) sift-down, giving Θ(n log n) worst case — and unlike quicksort, this is guaranteed, not just expected.
8Insertion sort on a reverse-sorted array of n distinct elements performs how many comparisons (inversions)?
A.n(n−1)/2 — the maximum inversion count
B.n
C.⌈log₂ n⌉
D.exactly n−1 swaps only, regardless of comparisons
Explanation: Reverse-sorted input has the maximum number of inversions, n(n−1)/2; each inversion forces one comparison-and-shift, so insertion sort runs in Θ(n²) on this input.
9Which algorithm first arranges the data into a heap and then repeatedly extracts the maximum to the end of the array?
A.Heapsort
B.Mergesort
C.Bubblesort
D.Counting sort
Explanation: Heapsort = build-heap (O(n)) followed by n extract-max/sift-down steps, placing each max at the shrinking end — the heap-based O(n log n) sort.
10Merging two already sorted runs of lengths p and q needs at most how many key comparisons?
A.p + q − 1
B.p · q
C.p + q
D.max(p, q)
Explanation: Each comparison emits one element to the output; once one run is exhausted the rest of the other is copied without comparison. Hence at most p+q−1 comparisons — the LK merge-step bound underlying mergesort's Θ(n log n).

About the Hesse Abitur CS LK Practice Questions

Verified exam format metadata for Hesse Landesabitur Informatik — Leistungskurs (advanced course / erhöhtes Niveau) is pending. The practice questions above remain available while official exam length, timing, passing score, fee, and administrator details are reviewed.