Matura Computer Science study guide
Matura Computer Science · Work through your exam, one topic at a time.
The Matura in Computer Science (Informatyka) is the Polish school-leaving examination in computing, taken by candidates who need a formal result for university admission or for their own certification. It is aimed at secondary-school students who have studied the extended computer science curriculum, but it also attracts candidates preparing for technical or IT-related degree programmes. The Matura Computer Science study guide has 8 sections and about 2,653 words.
01Algorithms and Programming
Matura Computer Science tests algorithmic thinking in Algorithms and Programming : reading a specification, choosing a method, tracing it by hand and writing correct, efficient code, usually in Python or C++. Marks come from a justified complexity argument as much as from a working program.
355 words, about 2 min02Data Structures and Data Representation
Data Structures and Data Representation tests two linked skills: picking the structure whose cost matches the operation, and converting faithfully between binary, hexadecimal, two's complement, floating point and character encodings. Stack: LIFO - function calls, undo, bracket matching, DFS.
352 words, about 2 min03Databases and SQL
Databases and SQL asks you to model data relationally - keys, integrity, normal forms - and to write queries that return exactly the required rows, including grouping and joins. A relation is a table; the primary key uniquely identifies each row and cannot be NULL; a foreign key references a primary key and enforces referential integrity.
337 words, about 2 min04Computer Networks and the Internet
Computer Networks and the Internet tests layered models, encapsulation, addressing and the protocols behind everyday services. OSI layers: physical, data link, network, transport, session, presentation, application.
303 words, about 2 min05Computer Systems and Hardware
Computer Systems and Hardware covers the von Neumann model, the CPU's internal organisation, the memory hierarchy, Boolean logic and how capacity is calculated. Von Neumann architecture: one memory holds both instructions and data, executed in a fetch–decode–execute cycle; the shared bus is the classic bottleneck.
340 words, about 2 min06Software Engineering and System Development
Software Engineering and System Development tests the life cycle: requirements, design notation, testing strategy and change management. Waterfall is sequential with frozen requirements; agile delivers in iterations and welcomes late change.
312 words, about 2 min07Social, Ethical, Legal and Economic Aspects of Computing
Social, Ethical, Legal and Economic Aspects of Computing tests whether you can classify a licence, apply data-protection rules and reason about the consequences of technology. GPL is copyleft: distributing a derivative work means the whole must be GPL and the source made available.
332 words, about 2 min08Problem Solving with a Spreadsheet and a Programming Language
Problem Solving with a Spreadsheet and a Programming Language combines the two practical tools of the exam: a spreadsheet for calculation and a program for data processing. Relative A1 shifts when filled; absolute A 1 does not; mixed A 1 and A1 lock one coordinate.
322 words, about 2 min