Pancyprian Computer Science - independent foundations case studies
Pancyprian Computer Science - independent foundations · Put your knowledge to work in context.
This independent study page provides practice for Pancyprian Computer Science - independent foundations. Its editorial learning areas include Programming and C++ foundations; Algorithms and computational thinking; Data representation and relational databases; Computer architecture, operating systems and networks. 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. The Pancyprian Computer Science - independent foundations case studies are 4 cases and about 2,729 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 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 min3The 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 min4Candidate 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