What This Document Is
This document contains solution sketches for Assignment Five of Cornell University’s Introduction to Algorithms (CS 4820) course, from Spring 2018. It focuses on a fraud detection problem involving bank cards and equivalence testing. The assignment was due on March 8th.
Why This Document Matters
This resource is intended for students enrolled in CS 4820 who are seeking to review and understand potential approaches to solving the assignment problems. It’s most useful after attempting the assignment independently, as a way to check understanding and identify areas for improvement. It provides insight into the expected level of rigor and problem-solving techniques used in the course.
Common Limitations or Challenges
This document provides *sketches* of solutions, not fully detailed explanations. It assumes a base understanding of algorithmic concepts and may not be sufficient for students completely unfamiliar with the material. It does not offer alternative solution approaches or detailed debugging guidance.
What This Document Provides
The full document includes: a problem statement regarding fraud detection with bank cards; two parts to the problem – one asking to determine if more than n/2 cards are equivalent, and another asking about more than n/4; a generalized solution approach using O(knlog(n/k)) equivalence tests; a correctness proof for the algorithm; and a discussion of the worst-case number of equivalence tests required. This preview only describes the document’s contents and intended use – it does *not* include the actual solutions or proofs.