EE160 Programming for Engineers

At the end of this problem you should submit to Laulima (please zip these files to work around the 5 file limit):

• a file named UHusername_display_highscore.c
• a file named UHusername_display_highscore.h
• a file named UHusername_display_highscore_constants.h
• a file named UHusername_display_highscore_helpers.c
• a file named UHusername_display_highscore_helpers.h
• a file named UHusername_display_highscore_setup.h

  example:

  • zhaol_display_highscore.c
  • zhaol_display_highscore.h
  • zhaol_display_highscore_constants.h
  • zhaol_display_highscore_helpers.c
  • zhaol_display_highscore_helpers.h
  • zhaol_display_highscore_setup.h

• Update the display program that you completed from Lab 09

  It will be beneficial for you to leave your previous lab work untouched by copying them to a new folder for this lab and modify only the files in the new folder

  If you were not able to complete Display with Attacker and Teleport from the Lab 09, you can modify a fresh copy of the display program. The feature set between both lab assignments are independent. Just follow the download instructions from Lab 08 and coordinate with your lab instructor.

  Update your Display with Attacker and Teleport program from Lab 09 to add the following features:

  1. Implement a high score feature:

     • each time the token moves "on top" of an item, increment the score by 1
     • when an attacker moves "on top" of the token, the game ends
     • when the game ends, the current score is compared with the high score
       • the high score is read/written to a file for persistence, i.e. the high score can be retrieved after the program ends
       • if the current score is greater than the high score, then the program will ask the user for his/her name and stores the user's name and high score to the file
     • if you were not able to get the item and attacker to work, then:
       • increment the score each time the token is at one of the 4 corners of the screen
       • the game ends when the token is at a particular "trap" position, you can choose the "trap" position or make the "trap" position be random

Uber is a rideshare company that started in San Francisco, California. We will be analyzing a subset of their data that was previously hosted at InfoChimps

Download the modify Uber data

uber.1.0.1

Lab 10:
Count the number of rides
Calculate the distance travelled for each ride

At the end of this problem you should submit to Laulima (please zip these files to work around the 5 file limit):

• a file named UHusername_uber_ridecount_distance.c
• a file named UHusername_uber_ridecount_distance.h
• a file named UHusername_uber_ridecount_distance_constants.h
• a file named UHusername_uber_ridecount_distance_helpers.c
• a file named UHusername_uber_ridecount_distance_helpers.h

  example:

  • zhaol_uber_ridecount_distance.c
  • zhaol_uber_ridecount_distance.h
  • zhaol_uber_ridecount_distance_constants.h
  • zhaol_uber_ridecount_distance_helpers.c
  • zhaol_uber_ridecount_distance_helpers.h

• Write a program that will analyze the Uber data to do the following:

  1. determine the number of rides in the data set:

     • do not just use the ID column for this; there is no guaratee that the IDs are in sequential order and are not skipped within the data set
       for instance, don't assume there are 5 rides by looking at the last ride ID, because the data could have 4 rides and look like this:

       1
       1
       1
       3
       3
       3
       4
       5
       5
       

  2. determine the start-to-end displacement for each ride:

     • assume the 3rd (x) and 4th (y) column of the data represent distance (in meters) from some arbitrary origin to simplify the calculations (the 3rd and 4th columns are actually lattitude and longitude, respectively)
     • assume the data entries for each ride are consecutive like this:

       1
       1
       1
       1
       2
       2
       2
       3
       3
       3
       

     • assume the data entries for each ride are NOT interlaced like this:

       1
       1
       1
       2
       2
       1
       1
       2
       3
       3
       2
       3
       3
       

     • you can calculate the distance travelled using the following method:
       • $distance_x = {end\_position_x - start\_position_x}$, $distance_y = {end\_position_y - start\_position_y}$, $distance = √(distance_x^2+distance_y^2)$
     • Feel free to use the sqrt function from the math.h library
       • How to use the sqrt: http://www.cplusplus.com/reference/cmath/sqrt/
       • How to compile with the math.h library: http://stackoverflow.com/questions/4120592/c-programming-sqrt-function
     • Or you can write your own sqrt function
       Use at your own risk:
       • http://en.wikipedia.org/wiki/Methods_of_computing_square_roots
       • http://stackoverflow.com/questions/1623375/writing-your-own-square-root-function

  3. output the number of rides and displacement for each ride to an output file, uber_ridecount_distance_output.txt

• Things to note:

  • To help with visualize your data, you can use this web application

    • You need to process the data to generate a JSON file and then upload it

      More information about the JSON file format

      • http://www.w3schools.com/json/
      • http://en.wikipedia.org/wiki/JSON
      • http://www.json.org

    • Here are some sample JSON files from the Uber dataset

      • sampled_uber.json
      • full_uber.json (this file will take longer to process)
  • A lot of the programming that engineers do will relate to processing data. Typically, an engineer will analyze performance data before and after a proposed change to help make a decision on whether or not to move forward with the change. Even though it is not as fun as making games, it is definitely a worthwhile skill to aquire. Luckily, there are other languages available that have more support for data processing. The C programming language really shines when working with hardware (e.g. robotics, electronic gadgets, etc.)