North Rhine-Westphalia Abitur Computer Science - independent foundations study materials
North Rhine-Westphalia Abitur Computer Science - independent foundations study resources

North Rhine-Westphalia Abitur Computer Science - independent foundations case studies

North Rhine-Westphalia Abitur Computer Science - independent foundations · Put your knowledge to work in context.

This independent study page provides practice for North Rhine-Westphalia Abitur Computer Science - independent foundations. Its editorial learning areas include Programming, object modelling and software development; Algorithms, recursion and complexity; Digital representation and data structures; Automata, languages and computability; Computer systems, networks and distributed communication; Security and cryptographic foundations. The questions develop subject knowledge and application through worked reasoning, distinctions between competing answers, and practical scenarios. Study the relevant guide before attempting a mixed set, then explain the evidence or calculation that supports each answer. Topics on this exam: Programming, object modelling and software development, Algorithms, recursion and complexity, Digital representation and data structures, Automata, languages and computability, Computer systems, networks and distributed communication, and Security and cryptographic foundations. The North Rhine-Westphalia Abitur Computer Science - independent foundations case studies are 4 cases and about 2,129 words.

1

The Recursive Path Counter That Freezes at 25 by 25

A student in a Java programming class writes a recursive method to count unique paths across a grid for a game. The method is: static long paths(int r, int c) { if (r == 0 c == 0) return 1; return paths(r-1, c) + paths(r, c-1); } It returns correct answers for 5×5 and 10×10 grids.

704 words, about 4 min
2

A Scanner That Accepts the Wrong Suffix

A school team designs a lexical scanner for a small language over the alphabet zero and one. The stated task is to accept exactly those complete input strings ending in the suffix zero one.

219 words, about 1 min
3

The Memory Hierarchy Upgrade Committee

A high school robotics team runs a simulation on 40 single-board computers. Each board has a 32 KB L1 cache with a 1-cycle hit time, a unified L2 cache with a 10-cycle hit time, and 100-cycle main memory.

609 words, about 3 min
4

The Attendance App Breach

A district's attendance web app has 12,000 student and staff accounts. Passwords are stored as unsalted SHA-256 hashes.

597 words, about 3 min