PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free Lower Saxony Zentralabitur Informatics Practice Questions

Lower Saxony Zentralabitur 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 Lower Saxony Zentralabitur

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

Lower Saxony Zentralabitur Art

Practice Questions

Lower Saxony Zentralabitur Biology

Practice Questions

Lower Saxony Zentralabitur Catholic Religion

Practice Questions

Lower Saxony Zentralabitur Chemistry

Practice Questions

Lower Saxony Zentralabitur English

Practice Questions

Lower Saxony Zentralabitur Evangelical Religion

Practice Questions
2026 Statistics

Key Facts: Lower Saxony Zentralabitur Informatics Exam

EPA 1989/2004

Official basis: Einheitliche Prüfungsanforderungen Informatik, last revised 05.02.2004

Einheitliche Prüfungsanforderungen in der Abiturprüfung Informatik

14.04.2026

Fixed statewide written exam date for Informatik in the 2026 Zentralabitur

MK Niedersachsen Neubekanntmachung der Abiturtermine 2026

KC 2017

Kerncurriculum Informatik gymnasiale Oberstufe, binding for the written exam

Nds. Kultusministerium, Kerncurriculum Informatik

300 / 900 points

Minimum Gesamtqualifikation to pass the Abitur (Block I ≥200/600, Block II ≥100/300)

Nds. Kultusministerium, Die gymnasiale Oberstufe und die Abiturprüfung

Outside IQB pools

Informatik is not in the IQB Abituraufgabenpools; Niedersachsen sets landeseinheitliche tasks

IQB Abituraufgabenpools overview; MK Niedersachsen

Free 100-question English MCQ study bank for Lower Saxony Zentralabitur Informatik. Official exam: German-language programming/problem-solving tasks (EPA Informatik 1989/2004) over the Kerncurriculum's algorithms, OOP, databases, and automata content. Written window 10.04.–11.05.2026 (Informatik: 14.04.2026). Not an official programming-exam simulation; no fee for regular school candidates.

Sample Lower Saxony Zentralabitur Informatics Practice Questions

Try these sample questions to test your Lower Saxony Zentralabitur 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 precise, finite sequence of unambiguous steps that solves a specific problem or class of problems
B.A random collection of instructions with no defined order
C.A physical computer chip
D.A programming language's official syntax rules only
Explanation: An algorithm is a precise, finite, unambiguous sequence of steps designed to solve a specific problem, a foundational concept underlying all of computer science.
2Which sorting algorithm repeatedly steps through a list, compares adjacent elements, and swaps them if they are in the wrong order?
A.Bubblesort
B.Binary search
C.Depth-first search
D.Hashing
Explanation: Bubblesort repeatedly compares and swaps adjacent elements in a list, 'bubbling' larger (or smaller) elements toward one end with each pass, until the list is sorted.
3What is the worst-case time complexity of Bubblesort for sorting n elements?
A.O(n²)
B.O(log n)
C.O(1)
D.O(n log n) always, with no exceptions
Explanation: Bubblesort's worst-case time complexity is O(n²), since in the worst case (e.g., a reverse-sorted list) it must perform nested comparisons across the entire list multiple times.
4Binary search (binäre Suche) requires which precondition to work correctly?
A.The list being searched must already be sorted
B.The list must contain exactly one element
C.The list must be unsorted for the algorithm to function
D.No precondition is required whatsoever
Explanation: Binary search requires a sorted list, since it repeatedly halves the search interval by comparing the target value to the middle element, a strategy that only works correctly on ordered data.
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: Binary search has O(log n) time complexity because each comparison eliminates half of the remaining search space, making it far more efficient than linear search for large sorted datasets.
6Which data structure follows a strict 'Last In, First Out' (LIFO) principle?
A.Stack (Stapel)
B.Queue (Warteschlange)
C.Binary tree
D.Hash table
Explanation: A stack follows LIFO: the most recently added element ('last in') is the first one removed ('first out') — like a stack of plates where you can only add or remove from the top.
7Which data structure follows a strict 'First In, First Out' (FIFO) principle?
A.Queue (Warteschlange)
B.Stack (Stapel)
C.Set (Menge)
D.None of these structures follow any defined ordering
Explanation: A queue follows FIFO: the first element added is the first one removed — like people waiting in a line, where whoever arrives first is served first.
8In a binary search tree (binärer Suchbaum), what property must every node satisfy relative to its subtrees?
A.All values in the left subtree must be smaller, and all values in the right subtree must be larger than the node's own value
B.All values in the tree must be exactly identical
C.The tree must have no more than one node total
D.Every node must have exactly three children
Explanation: In a binary search tree, every node's value must be greater than all values in its left subtree and less than all values in its right subtree, enabling efficient search, insertion, and deletion.
9Which best describes 'Rekursion' (recursion) as a programming technique?
A.A technique in which a function calls itself, typically breaking a problem into smaller subproblems until reaching a base case
B.A technique that forbids a function from ever calling itself
C.A technique used only for sorting numbers, never for other tasks
D.A synonym for iteration with absolutely no distinction
Explanation: Recursion is a technique where a function calls itself to solve smaller instances of the same problem, continuing until a base case is reached that can be solved directly without further recursive calls.
10What happens if a recursive function has no correctly defined base case?
A.The function will call itself indefinitely, typically leading to a stack overflow error
B.The function will automatically terminate after exactly one call
C.The function will always produce the correct result regardless
D.The function becomes a non-recursive iterative loop automatically
Explanation: Without a correctly defined base case, a recursive function will keep calling itself indefinitely, eventually exhausting the call stack and causing a stack overflow error.

About the Lower Saxony Zentralabitur Informatics Practice Questions

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