Hesse Abitur Computer Science, basic course - independent foundations study materials
Hesse Abitur Computer Science, basic course - independent foundations study resources

Hesse Abitur Computer Science, basic course - independent foundations case studies

Hesse Abitur Computer Science, basic course - independent foundations · Put your knowledge to work in context.

This independent study page provides practice for Hesse Abitur Computer Science, basic course - independent foundations. Its editorial learning areas include Programming, object modelling and software development; Algorithms, recursion and complexity; Digital representation and data structures; Entity modelling, relational algebra and SQL; Automata, languages and computability; Computer systems, networks and distributed communication; Responsible computing and teaching foundations. The Hesse Abitur Computer Science, basic course - independent foundations case studies are 6 cases and about 3,545 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

The Slow Catalog Query

A public library's catalog database has 2.4 million rows in a table with columns id, title, author, year, subject, and checked out. The web catalog runs this query about 40 times per second: SELECT id, title FROM books WHERE author = ?

613 words, about 3 min
3

Candidate Records at East Mercia Examinations Board

East Mercia Examinations Board stores records for 25,000 candidates. Each record contains an 8-digit candidate number, a 60-character name, and nine paper marks that are integers from 0 to 100.

803 words, about 4 min
4

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
5

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
6

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