PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free Hesse Abitur CS GK Practice Questions

Hesse Landesabitur Informatik — Grundkurs (basic course / grundlegendes 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 GK Exam

255 min

Bearbeitungszeit for the Grundkursfach, including selection time (§25 Abs. 2 OAVO)

LA26 Abiturerlass, section II

2 Aufgaben

Grundkurs: Pflichtaufgabe A plus one chosen B1/B2 — two Kurshalbjahre

LA26 Abiturerlass, Informatik section 23.3

Java / Python

Pflichtaufgabe A language variant matches the Unterricht language

LA26 Abiturerlass, Informatik section 23.2

EPA 5.2.2004

Aufgabenart after EPA Informatik in the version of 5 February 2004

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

9 Themenfelder

Binding LA26 Informatik GK Schwerpunkte (Q1.1–Q1.3, Q2.1/Q2.2/Q2.5, Q3.1–Q3.3)

LA26 Abiturerlass, Informatik section 23.4

Free 100-question English MCQ study bank for Hesse Landesabitur Informatik Grundkurs. Official exam: German constructed-response EPA Informatik — Pflichtaufgabe A (Algorithmik/OOP, Java or Python as taught) + choose B1/B2 (Datenbanken or theoretische Informatik), two tasks / two Kurshalbjahre, 255 min incl. selection, Notenpunkte 0–15. Written window 15.04.–08.05.2026. Not an official format simulation; no fee for regular school candidates.

Sample Hesse Abitur CS GK Practice Questions

Try these sample questions to test your Hesse Abitur CS GK 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 Grundkurs?
A.255 minutes including selection time
B.285 minutes including selection time
C.300 minutes including selection time
D.240 minutes including selection time
Explanation: §25 Abs. 2 OAVO sets Grundkurs written exams at 255 minutes; Leistungskurs is typically 300 minutes (LA26 Erlass section II).
2What is the official written Informatik exam task type in Hesse LA26?
A.EPA Informatik (5 Feb 2004) constructed-response Klausur
B.Multiple-choice only with 100 items
C.Oral programming interview without written work
D.Sprachmittlung plus Leseverstehen
Explanation: LA26 section 23.2 names Aufgabenart nach EPA Informatik in der Fassung vom 5. Februar 2004 — a constructed-response paper.
3In the Informatik Grundkurs Auswahlmodus, what does the candidate complete?
A.Pflichtaufgabe A plus one chosen Aufgabe from B1/B2
B.Three Pflichtaufgaben A, B, and C
C.Only Pflichtaufgabe A with no Wahlaufgabe
D.Four short MCQ sections
Explanation: LA26 §23.3: GK gets Pflichtaufgabe A plus B1 and B2 to choose from; two tasks covering two Kurshalbjahre.
4Which language variants are offered for Pflichtaufgabe A (Algorithmik/OOP)?
A.Java and Python, matching the Unterricht language
B.Only Java for all candidates
C.Only Python for all candidates
D.C++ and JavaScript only
Explanation: LA26 §23.2: Aufgabe A is offered in Java and Python; the candidate receives the variant used in class.
5Which aids are permitted in the written Informatik LA26 exam?
A.German spelling dictionary and the operator list
B.Graphing calculator and smartphone IDE
C.Any online documentation
D.Latin–German dictionary only
Explanation: LA26 §23.5: ein Wörterbuch der deutschen Rechtschreibung and die Liste der fachspezifischen Operatoren.
6What is the worst-case time complexity of binary search on a sorted array of n elements?
A.O(log n)
B.O(n)
C.O(n log n)
D.O(1)
Explanation: Binary search halves the search space each step, so worst-case comparisons grow as ⌈log₂(n+1)⌉, i.e. O(log n).
7In the worst case, how many comparisons does linear search need to find a key in an unsorted array of 20 distinct elements?
A.20
B.10
C.⌈log₂ 20⌉
D.1
Explanation: If the key is last or absent (depending on convention for present keys), linear search may examine all 20 elements — worst case 20 comparisons for a present last element.
8Selection sort on n elements always performs how many swaps of whole elements (classic formulation that swaps once per outer pass)?
A.n − 1 swaps in the outer loop
B.n² swaps
C.⌈log₂ n⌉ swaps
D.Exactly n/2 swaps always
Explanation: Classic selection sort finds the minimum for positions 0..n−2 and swaps once per outer iteration → n−1 swaps.
9Insertion sort’s best-case time complexity on an already sorted array is:
A.O(n)
B.O(n²)
C.O(log n)
D.O(n log n)
Explanation: On sorted input each new element needs only one comparison (or a constant check) before inserting in place → linear best case.
10Bubble sort (adjacent swaps until no swap occurs) on [3, 1, 2] performs how many adjacent swaps until sorted?
A.2
B.0
C.3
D.6
Explanation: Pass 1: swap 3↔1 → [1,3,2]; swap 3↔2 → [1,2,3]. Two adjacent swaps; next pass finds no swaps.

About the Hesse Abitur CS GK Practice Questions

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