Is the official Bavarian Informatik eA Abitur a multiple-choice test?

No. The written eA exam consists of constructed-response tasks with subtasks (modelling, implementation, traces, complexity reasoning). This bank is an English-language MCQ study adaptation only and cannot replace those formats.

How long is the eA Informatik exam and how is it structured?

Per the ISB Hinweise (Stand November 2025): 300 minutes including task-selection time (gA is 255 minutes); 4 tasks are offered, 3 must be completed, each worth 40 Bewertungseinheiten (120 BE total). In 2026, Informatik eA sat on 13.05.2026 ('alle weiteren Abiturprüfungsfächer – erhöhtes Anforderungsniveau', KM Bayern).

How does Informatik eA differ from gA?

eA is the Leistungsfach (typically 5 weekly hours) with deeper/broader Lernbereiche: general trees, OS/scheduling, Schaltungslogik earlier, IoT (eA-only), Algorithmen/Komplexität/Berechenbarkeit with P/NP and Turing machines, expanded AI. Exam scoring is 40 BE per task and 300 minutes vs. 30 BE and 255 minutes at gA.

Which programming language is used?

The permitted object-oriented language(s) are announced on the cover sheet; the ISB model solutions use Java and Python. Code is written with pen and paper—no computer—and simple syntax errors are assessed leniently.

Which aids (Hilfsmittel) are allowed?

The ministry-approved document of mathematical formulas, an approved mathematical-scientific formula collection, a regulation-compliant scientific calculator, and a German spelling dictionary. No internet-capable devices.

Is Informatik part of the IQB common task pool?

No. In Bavaria the IQB pool tasks apply to other named subjects. Informatik tasks are Bavaria-specific; the ISB publishes Illustrierende Prüfungsaufgaben for both gA and eA.

How does the subject count toward passing the Abitur?

Task points become Notenpunkte via the eA Bewertungsraster (max. 120 BE). Overall, coursework (Block I) counts up to 600 and the exam block (Block II) up to 300 of 900 points; the Allgemeine Hochschulreife requires at least 300 points total (KM Bayern).

All Practice Exams

100+ Free BY Abitur Informatik eA Practice Questions

Bavaria Abitur Informatik (erhöhtes Anforderungsniveau / Leistungsfach) 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 Bavaria Abitur

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

2026 Statistics

Key Facts: BY Abitur Informatik eA Exam

300 minutes

eA Informatik working time including task-selection time (gA: 255 minutes)

ISB Hinweise zur schriftlichen Abiturprüfung Informatik (Stand November 2025)

4 offered / 3 completed

Task choice in the written eA exam; 40 Bewertungseinheiten per task (120 BE total)

ISB Hinweise zur schriftlichen Abiturprüfung Informatik (Stand November 2025)

13.05.2026

2026 exam date for 'alle weiteren Abiturprüfungsfächer – erhöhtes Anforderungsniveau', including Informatik eA

KM Bayern, Abiturprüfung 2026 Terminplan

5 weekly hours

Typical Stundenumfang of Informatik Leistungsfach (eA) in Jgst. 12/13

ISB IlluPA Informatik Übersichtsblatt; LehrplanPLUS Leistungsfach

Java / Python

Object-oriented languages used in the ISB model solutions (cover sheet names the permitted language(s)); code is written on paper

ISB Hinweise zur schriftlichen Abiturprüfung Informatik

AFB II

Emphasis of the written exam; AFB I weighted more strongly than AFB III

ISB Hinweise zur schriftlichen Abiturprüfung Informatik

300 / 900

Minimum Gesamtqualifikation for the Allgemeine Hochschulreife (coursework up to 600, exam block up to 300)

KM Bayern, Abiturprüfung 2026

100

Original English MCQ study items in this bank (not official format)

OpenExamPrep

BY Abitur Informatik eA is a constructed-response written Leistungsfach exam (4 tasks offered, 3 completed, 40 BE each, 300 min incl. selection time; 2026 date: 13.05.2026)—not MCQ. Topics per LehrplanPLUS eA: Listen/Bäume, OS/Nebenläufigkeit, Schaltungslogik, IoT, Automaten, Algorithmen/Komplexität/P–NP/Turing, KI. This free English MCQ bank is a study adaptation only.

Sample BY Abitur Informatik eA Practice Questions

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

1In object-oriented modelling for the Bavarian Abitur, what does polymorphism mean?

A.Objects of different subclasses can be used wherever a superclass type is expected, and each object executes its own overridden method version

B.Every attribute of a class must be declared public

C.A class may contain only static methods

D.Two classes are merged into one by copying all attributes

Explanation: Polymorphism lets a superclass reference refer to subclass objects; calls bind to the object's actual class. ISB tasks use this when abstract node types hold different concrete tree elements.

2A UML association between PRODUKTIONSLINIE and SENSOR is annotated 1 … *. What does this mean?

A.Each sensor inherits from Produktionslinie

B.Each Produktionslinie may link to many Sensor objects; each Sensor belongs to exactly one Produktionslinie

C.Exactly one Sensor may exist in the entire program

D.Sensor and Produktionslinie are the same class

Explanation: Cardinalities state how many opposite-class objects one object may reference—classic 1:* modelling in IlluPA plant scenarios.

3Why may constructors, getters and setters be omitted from Bavarian Abitur class diagrams?

A.They are assumed as Standardmethoden, so diagrams focus on domain attributes, specific methods and relationships

B.They are forbidden in eA implementations

C.The Java compiler rejects diagrams that show them

D.Examiners mark their presence as a syntax error

Explanation: ISB conventions treat give/set/constructors as assumed; diagrams highlight modelling decisions that matter for the task.

4In a singly linked list, where does each node store the reference to the next element?

A.In a shared global array of indices

B.In its own next/nachfolger field pointing to the following element (or null/Abschluss)

C.Only in the list object's hash table

D.In the previous node's value attribute

Explanation: Each Knoten holds data plus a successor reference; recursive list methods walk until Abschluss.

5What is the base case of a recursive method that counts nodes in a singly linked list?

A.When the current element is the empty list / Abschluss, return 0

B.When the list has more than 1000 nodes, return −1

C.When two threads access the list, throw an exception

D.When the node value equals the search key, swap it with the root

Explanation: List recursion terminates at empty; the recursive case is 1 + count(successor).

6In an ordered binary search tree, where are keys smaller than the current node's key stored?

A.Always in the right subtree

B.In the left subtree

C.Only in leaf nodes at maximum depth

D.In a separate queue attached to the node

Explanation: BST invariant: smaller left, larger right—basis for search and sorted inorder output.

7What does Big-O notation O(f(n)) express about an algorithm?

A.The exact runtime in milliseconds on a specific laptop

B.An asymptotic upper bound on how elementary steps grow with input size n (up to constants)

C.That the algorithm always uses exactly f(n) bytes of RAM

D.That the problem is undecidable

Explanation: O-notation compares growth classes—central to eA Algorithmen, Komplexität und Berechenbarkeit.

8Binary search on a sorted array of n elements has which typical time complexity?

A.O(n²)

B.O(2ⁿ)

C.O(log n)

D.O(n!)

Explanation: Each step halves the search interval → logarithmic comparisons.

9How many distinct values can be represented with k bits?

A.k

B.2k

C.2ᵏ

D.k²

Explanation: k bits → 2ᵏ combinations (e.g. 8 bits → 256).

10A deterministic finite automaton (DEA) accepts an input word when…

A.The run ends in an accepting state after reading the whole word

B.Any state along the run was visited twice

C.The automaton uses nondeterministic ε-transitions

D.The tape of a Turing machine is empty

Explanation: Start → unique transitions for each symbol → finish in an accepting state.

About the BY Abitur Informatik eA Practice Questions

Verified exam format metadata for Bavaria Abitur Informatik (erhöhtes Anforderungsniveau / Leistungsfach) is pending. The practice questions above remain available while official exam length, timing, passing score, fee, and administrator details are reviewed.

100+ Free BY Abitur Informatik eA Practice Questions

Explore More Bavaria Abitur

Bavaria Abitur Art — advanced requirement level (eA)

Bavaria Abitur Astrophysics — basic requirement level (gA)

Bavaria Abitur Catholic Religious Education — advanced requirement level (eA)

Bavaria Abitur Catholic Religious Education — basic requirement level (gA)

Bavaria Abitur Economics and Law — advanced requirement level (eA)

Bavaria Abitur Economics and Law — basic requirement level (gA)

Key Facts: BY Abitur Informatik eA Exam

Sample BY Abitur Informatik eA Practice Questions

About the BY Abitur Informatik eA Practice Questions