The ``Mini-Project'' is due noon Nov 04, by Email to Ms Zhang. This project works as follows: Ms Zhang and I have a secret test file containing a number (say k) IP packet headers in ``pseudo binary'' form. You must write, and hand in on or before Nov 04, a program that reads this secret file and prints for each of the packet headers the content in human-readable form. Your score depends on how many packets you get right. To help you, we are providing you with an example input file and an example output file. Please use the format of the example output file. The example input file and example output file are on this same web page. The example input file has 10 packets. The test input file may have fewer or more packets. (3, 13, 17, 23, whatever). It will have the same format as the sample input file. It may have extra blank lines preceding or following the input packets, or preceding or following the line that gives the number of packets. I may change the example a little bit in the next few days, so keep checking. Your program had better handle the current example correctly! So you can start testing your program with this example input file. --- So what you hand in to Ms Zhang is a program (sourcecode), with concise and exact instructions on how to run it. Inluding what compiler, whether you have command line instructions or input - output redirections, etc. If input file and / or output file must be named on the command line, say so! If they must be added by input or output redirection, say so! The following compilers are allowed (and preferred): gcc, g++, cc, CC, javac . If you want to run with a different compiler, first ask permission. If it does not take extra time from Ms Zhang or Professor Ott, it is OK. Make sure to test your program in a Unix environment. If you do development in a microsoft environment (that is OK) there may be glitches if you run in a Unix environment. Solve such problems before you send in your program. We will not debug your program! If it needs debugging, you have a zero score. Good Luck. Teun Ott.