CS2604: Data Structures and File Processing

• Required pledge statement
  • Put this at the top of your program code.
  
  
• Program 1: due 9/23
  
  • Sample files:
    • Note: a 'd' or 'u' in the output file name signifies if the binary search algorithm rounded down or up, both solutions are acceptable.
    • data1.txt + search1.txt + out1d.txt + out1u.txt
    • data2.txt + data2_search.txt + data2_outd.txt + data2_outu.txt
  • Test files:
    • basic.txt + basic_search.txt + basic_out_d.txt + basic_out_u.txt
    • complex.txt + complex_search.txt + complex_out_d.txt + complex_out_u.txt
  
  
• Program 2: due 10/14
  
  • Note small mistake in spec: "edge" should not appear twice in the final line of data1.txt
  • Program 2 tips
  • Sample files:
    • webpages12.txt + data12.txt + search12.txt + output12.txt
  • Test files
    • basic.txt + basic_data.txt + basic_search.txt + basic_out.txt
    • complex.txt + complex_data.txt + complex_search.txt + complex_out.txt
    • extreme.txt (use with complex files)
  
  Program 3: due 11/11
  
  • Sample files:
    • freqfile.txt + treefile.txt + code.txt + messagefile.txt + encodedmsg.bin
    • freqfilespec.txt + treespec.txt + codespec.txt + msgspec.txt + endmsgspec.bin
    • Note: the tree file format is up to you, the file posted is just an example.
  • Test files
    • basic_freq.txt + basic_code.txt + basic_tree.txt + basic_message.txt + basic_encoded.bin
    • complex_freq.txt + complex_code.txt + complex_tree.txt + complex_message.txt + complex_encoded.bin
  
  Program 4: due 12/3 12/8
  
  • Sample files:
    • datafile1.txt + cmdfile1.txt + outfile1.txt (order = 3) & outfile14.txt (order = 4) + ( (files for order =3) student1.dat + student1.ix1 + student1.ix2)
  • Test files:
    • basic_data.txt + basic_command.txt + basic_out.txt + basic_student.dat + basic_student.ix1 + basic_student.ix2
    • complex_data.txt + complex_command.txt + complex_out.txt + complex_student.dat + complex_student.ix1 + complex_student.ix2

No late homeworks will be accepted.

• Homework 1: due 9/26 by 4:00 PM.
  • Homework 1 solutions

• Homework 2: due 10/31 by 4:00 PM.
  • Homework 2 solutions

• Homework 3: due 12/5 by 4:00 PM.
  • Homework 3 solutions