Hamburg Abitur Computer Science - independent foundations case studies
Hamburg Abitur Computer Science - independent foundations · Put your knowledge to work in context.
This independent study page provides practice for Hamburg 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; Security and cryptographic foundations; Intelligent search and learning foundations; Computer systems, networks and distributed communication. 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, Security and cryptographic foundations, Intelligent search and learning foundations, and Computer systems, networks and distributed communication. The Hamburg Abitur Computer Science - independent foundations case studies are 4 cases and about 2,137 words.
1The 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 min2The 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 min3The 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 min4Two Workers Lose One Inventory Update
A simulated warehouse has one shared integer count initially equal to ten. Two worker threads each record one returned item by reading the count, adding one locally and writing the new value.
227 words, about 1 min