Reference no: EM132248939

void handleReport(UInt8 *buffer, UInt16 length);

A mouse packet has the following structure:

B0: report format
B1: reserved
B2: dX (bits[7:0])
B3: dY (bits[7:0])
B4[1:0]: Left/Right button states
B4[3:2]: dX (bits[9:8])
B4[5:4]: dY (bits[9:8])
B4[7:6]: timestamp (ms) bits[1:0]
B5: timestamp (ms) bits[9:2]
B6: timestamp (ms) bits[17:10]

1) Write one or more functions that extract the mouse deltas, button state, and timestamp from the device.
2) The 18-bit packet timestamp reflects a device timestamp in milliseconds. It will roll over after a few minutes. The host can accommodate a 32-bit timestamp that is updated with values from the incoming packet. Write code that detects the timestamp rollover in the incoming packets, and extends it to 32 bits.

Please complete the following task in C, C++, or Objective-C. You are free to use whatever data structures and design you prefer. Please prioritize optimizing for speed over memory and provide the space and time complexities of your solution in big-O notation.

1) create a deck of cards

2) shuffle the deck of cards, and display the cards (in their shuffled order)

3) reshuffle the deck, and display the cards (in their shuffled order)

4) look for any 2-card sequence that was also present in the previous shuffle. If any are found, print the identified cards and go back to step 3

5) when two back to back shuffles do not contain a duplicate sequence, you're done.

Questions:

1) How might you adapt your code to check for sequences of 3, 4, or more cards from the previous shuffle?

2) How might you adapt your code to check for combinations of N cards, rather than sequences? In a combination, the order of cards does not matter. In a sequence, the order of cards does matter.

3) How might you adapt your code to check for card sequences that were present in any previous shuffle? (i.e. comparing against all previous shuffles, not just the most recent one)

4) Would you do differently if you were now optimizing for memory over speed?