---

Homework 3: Finding heavy elements with Karp's algorithm

---

• Assignment
  • Implement Karp's algorithm for finding heavy elements in a data stream

    The relevant class notes is here: click here

  • How the program is invoked:

    Karp     θ     <     inputFile (Or:   Karp     θ     <     inputFile             if you use Java)

    θ is the support level (frequency ≥ θ)

    inputFile is the input "stream" (in the form of a file)

    ---

  • Output of the program:

    A list of (value, count) pairs

    Example output:

    4 5             2 1

    means: value 4 has count 5 at the end of the algorithm, and the value 2 has count 1 at the end of the algorithm

  ---

  ---

• Help files
  • Test data files:

    data1: click here data2: click here

    ---

  • Program to find all heavy elements:

    FindHeavy.c - click here

    Compile with: cc -o FindHeavy FindHeavy.c

    Usage: FindHeavy θ < inputFile