Unit 0: Computer Science

Write a method that receives raw scores, drops invalid entries, scales the remaining scores to a 100-point range, and returns a summary object with min, max, and average.

Given daily attendance counts for a club, compute streaks, detect impossible values, and report the first week where attendance drops below a threshold.

Turn repeated validation code for a student project into helper methods that check naming, missing fields, and boundary cases without changing the observable output.

Given several Student objects and a method that updates points and status flags, predict the final state and identify which update should be made private.

Implement a quiz score calculator with small methods for parsing, validation, penalties, and feedback bands, then list tests for empty, perfect, and mixed inputs.

Take a menu-driven program and design a table of command names mapped to helper methods so adding a new command does not change the main loop.

Given arrays of usernames, minutes, and activity labels, find records with missing names, negative minutes, or duplicate timestamps.

Process a stream of score updates, maintain a sorted top-five leaderboard, and explain how ties should be handled.

Given expected and actual output arrays, locate the first failing case, summarize the failure pattern, and propose the smallest code area to inspect.

Write a loop that collects integer ratings until a sentinel appears, rejects invalid values, and reports the number of accepted and rejected entries.

Given an array of survey responses, count each valid choice, ignore unknown choices, and return the most common response with tie behavior documented.

Given two methods that claim to remove duplicates from a list, design cases that reveal whether either method skips elements or changes order unexpectedly.

Model project tasks with fields for name, owner, done status, and priority, then write a method that returns overdue high-priority tasks.

Given a loop over an array, produce a table of index, current value, running total, and branch taken after each iteration.

Write a helper that trims, normalizes spacing, removes unsupported characters, and preserves meaningful capitalization for display names.

Given arrays of assignment IDs and student IDs, identify repeated submissions by the same student for the same assignment.

Group compiler-style error messages into categories such as syntax, type, missing symbol, and runtime risk, then count each category.

Track failed login attempts per user, lock accounts after a limit, and explain how the code avoids locking the wrong user.

Given weekly project scores, compute each three-week rolling average and identify the largest improvement window.

Filter a roster by grade, prerequisite status, and schedule availability while keeping the original roster unchanged.

Create repeatable random test data for scores and absences using a seed, then explain why repeatability helps debugging.

Given code that accesses neighbors in an array, redesign the loop so it never reads outside the array and still processes every valid pair.

Sort student feedback comments by length, break ties alphabetically, and preserve the original comments for later display.

Given token arrays for two small programs, count matching adjacent token pairs and flag only when the score crosses a documented threshold.

Build a RubricItem class with name, max points, earned points, and feedback, then write a method to compute total percentage.

Given required setup steps and completed setup steps, return the missing items in the original required order.

Show a long list of practice prompts five at a time and compute which items appear on each page without duplicating or skipping entries.

Given an object that stores an internal array, write constructor and accessor logic that prevents outside code from mutating internal state.

Given a helper method with a hidden off-by-one bug, identify the failing input and rewrite the loop header correctly.

Break a data-cleaning and leaderboard project into milestones: input validation, storage choice, algorithm, tests, and written analysis.