All Practice Exams
100+ Free North Rhine-Westphalia Zentralabitur Computer Science Practice Questions
North Rhine-Westphalia Zentralabitur Computer Science (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 North Rhine-Westphalia Zentralabitur
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: North Rhine-Westphalia Zentralabitur Computer Science Exam
4 Inhaltsfelder
Kernlehrplan Informatik GOSt: Daten/Datenstrukturen, Algorithmen, Automaten, Rechnernetze/Kryptologie
MSB NRW, Kernlehrplan Informatik für die gymnasiale Oberstufe
16 Apr – 8 May 2026
NRW Zentralabitur written main exam window for 2026
MSB NRW, Zentralabitur GOSt Rahmentermine 2026
300 / 900 points
Minimum Gesamtqualifikation to pass under § 29 APO-GOSt
APO-GOSt § 29
Free 100-question English MCQ study bank for NRW Zentralabitur Informatik. Official exam: German constructed-response covering data structures, algorithms, automata/formal languages, and networks/cryptology (Kernlehrplan Informatik GOSt). Not an official format simulation; no fee for regular school candidates.
Sample North Rhine-Westphalia Zentralabitur Computer Science Practice Questions
Try these sample questions to test your North Rhine-Westphalia Zentralabitur Computer Science exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.
1What is a class in object-oriented programming?
A.A blueprint that defines attributes and methods for creating objects
B.A single specific instance of data with no reusability
C.A type of loop structure
D.A network communication protocol
Explanation: A class defines the structure (attributes) and behavior (methods) shared by all objects created from it, serving as a reusable blueprint.
2What is an object, as distinct from a class, in object-oriented programming?
A.A specific instance of a class, with its own concrete attribute values
B.The same thing as a class, with no distinction
C.A type of network cable
D.A purely mathematical function with no data
Explanation: An object is a concrete instance created from a class, holding its own specific attribute values while sharing the class's defined structure and methods.
3What does 'encapsulation' (Kapselung) mean in object-oriented design?
A.Bundling data and methods together while restricting direct external access to internal state
B.Making all attributes public and directly modifiable from anywhere
C.Deleting all class methods after use
D.A synonym for a network firewall
Explanation: Encapsulation bundles an object's data and behavior together, typically restricting direct external access to internal attributes via private fields and public methods (getters/setters).
4What is inheritance (Vererbung) in object-oriented programming?
A.A mechanism where a subclass acquires attributes and methods from a parent (super)class
B.A process where all classes must be identical to each other
C.A synonym for encryption
D.A method for deleting unused variables
Explanation: Inheritance allows a subclass to reuse and extend the attributes and methods of a parent class, supporting code reuse and hierarchical modeling.
5What is a linked list (verkettete Liste) data structure?
A.A sequence of nodes where each node stores data and a reference (pointer) to the next node
B.A fixed-size, contiguous block of memory with no node references
C.A type of encryption algorithm
D.A network topology diagram
Explanation: A linked list consists of nodes, each holding data and a reference to the next node, allowing flexible, non-contiguous memory allocation and easy insertion/deletion.
6What is a binary tree (Binärbaum) data structure?
A.A hierarchical structure where each node has at most two children (commonly called left and right)
B.A structure where each node has exactly ten children
C.A one-dimensional list with no hierarchy
D.A network protocol for routing data
Explanation: A binary tree is a hierarchical data structure where each node has at most two child nodes, typically referred to as the left and right child.
7What is a binary search tree (BST)?
A.A binary tree in which, for every node, left-subtree values are smaller and right-subtree values are larger than the node's own value
B.A binary tree with completely random, unordered node placement
C.A tree with no left or right distinction at all
D.A structure exclusively used for storing images
Explanation: A binary search tree maintains an ordering invariant: for each node, all values in its left subtree are smaller, and all values in its right subtree are larger, enabling efficient search.
8What is a stack (Stapelspeicher) data structure's key access principle?
A.LIFO (Last In, First Out) — the most recently added element is removed first
B.FIFO (First In, First Out) — the oldest element is removed first
C.Random access to any element regardless of order
D.Elements are always sorted alphabetically
Explanation: A stack follows the LIFO principle: the last element pushed onto the stack is the first one popped off.
9What is a queue (Warteschlange) data structure's key access principle?
A.FIFO (First In, First Out) — the oldest element is removed first
B.LIFO (Last In, First Out) — the newest element is removed first
C.Elements are removed in random order
D.Elements can never be removed once added
Explanation: A queue follows FIFO: elements are removed in the same order they were added, with the oldest element served first.
10What does a UML class diagram typically show?
A.A class's name, attributes, methods, and relationships (e.g. inheritance, association) to other classes
B.Only the source code's exact line numbers
C.The physical wiring of a computer network
D.The color scheme of a software application's interface
Explanation: A UML class diagram visually represents a class's name, attributes, methods, and its structural relationships (association, inheritance, etc.) to other classes.
About the North Rhine-Westphalia Zentralabitur Computer Science Practice Questions
Verified exam format metadata for North Rhine-Westphalia Zentralabitur Computer Science (Informatik) is pending. The practice questions above remain available while official exam length, timing, passing score, fee, and administrator details are reviewed.