P1: File Navigation
P1: File Navigation

 

Due Date: Monday, Feb. 4, 2013, 23:59:59
Weight: 5%

The purpose of the first assignment is for students to refamiliarize themselves with text file parsing of a non-trivial input set.  Use the sample data input/output files below to test your program throughly before submitting it to the Curator.

P1 File Navigation (PDF format)

Sample sets of I/O files are available for testing:

Test
Set
Data
File
Command
File
Results
File
1 VA_Monterey  commands results
2 GISData commands results
3 GISData commands results

Downloading Sample Input/Output Files

To download a file, right-click on the link. Select "Save Target As..." or "Save Link As...", choose a directory to save the file, and save it.

Hints:

  • Use the java.io.RandomAccessFile class.
  • Separate parsing and processing  into different classes.
  • Use the java.io.FileWriter class for the logs.
  • Use the String.split() method for GIS records parsing.
  • There are fields in a GIS record that has multiple parts. They should have their own class.
  • Negative Latitude values are in the Southern hemisphere.
  • Negative Longitude values are in the Western hemisphere.
  • The instructor's solution is approximately 550-600 lines of code.
A student's curator submission that receives the highest score will be graded for adherence to these requirements, whether it is the last submission or not. If two or more submissions are tied for highest, the earliest of those will be graded. Therefore: implement and comment your C++ source code with these requirements in mind from the beginning rather than planning to clean up and add comments later. There are no exceptions to this policy!

 

The CS 3114 programming projects are individual work. Each submission must be pledged by including the commented posted pledge in the submitted file. The Va Tech Honor Code is in effect for all submitted work in CS 3114.
"On my honor, I have neither given nor received unauthorized aid on this assignment."

 
Computer Science 3114 Data Structures and Algorithms
D. Barnette