Diagnose a Computing Approach
Retrieval Prompts
- What questions help you choose between brute force and a smarter strategy?
- What questions help you choose an ADT before a data structure?
- What questions help you choose relational vs non-relational storage?
- What questions help you reason about whether a problem is feasible at all?
Compare and Distinguish
For each situation below, explain the first-fit choice you would investigate and why:
- exact solution on a very small search space
- huge search space where good enough is acceptable
- repeated subproblems inside recursion
- key-based cache lookup
- highly connected networked data
Do not answer with only names. State the signal that led you there.
Misconception Check
If your answer says "use NoSQL because it scales" without naming the data shape or consistency tradeoff, it is too vague.
If your answer says "use linked lists because inserts are fast" without naming the actual operations and access pattern, it is incomplete.
If your answer picks an algorithm without any comment on growth or memory, it is under-justified.
Mini Application
Choose one of these scenarios:
- a to-do app with comments and users
- a route-finding or recommendation problem
- a high-traffic page cache
- a small puzzle solver
Produce a short design note with these headings:
- Problem shape
- Likely strategy
- ADT or structure choices
- Storage choice
- Execution-stack concerns
Keep it to one page. The point is diagnosis, not full implementation.
Evidence Check
You are done only when:
- each major choice has a reason tied to the problem
- you named at least one tradeoff, not just one winner
- you showed that different layers of CS interact
- your note would let another learner challenge your assumptions