When I went back to school a while ago (to GMU), they had begun a policy of academic integrity. Apparently this is all the rage on campuses these days, but I don't know that students take it very seriously for the most part.

The prof was adamant and I was actually very happy to include an acknowledgements section to every homework and other assignment. Typically I included an entire page, but here's a copy of one the shortest - taken from our final (take home) exam.

----
Acknowledgements

I have neither given nor received aid on this exam.

However, I have used several references while formulating my responses. I used the Silberschatz and Tanenbaum texts. I also reviewed many of Denning’s course slides (particularly those on synchronization, security, and queueing). I wrote a program to do mean value analysis that is a direct implementation of the MVA algorithm given in Denning’s lecture slides and course notes. There is no original material in this. It is my own imperfect interpretation of what I have read and heard in lectures. I have also browsed web pages at

(1) http://www.citi.umich.edu/u/honey/crypto/lecture-14/lecture%2014.PPT

(2) http://www.esign.com.au/guide/guide.shtml

(3) http://archive.entrust.com/resourcecenter/pdf/tech_overview.pdf

(4) http://www-itg.lbl.gov/security/Akenti/pk_infrastructure.vg.pdf

(5) http://www.ise.gmu.edu/~csis/infs762/handouts/handout11.pdf

(6) http://www.redbooks.ibm.com/pubs/pdfs/redbooks/sg245512.pdf

(7) http://www.cs.uni-sb.de/~anja/lehre/vorlesung00/book/Computer_Networking/07.05.htm

Finally, I received several (at least five or six) responses from Professor Denning clarifying parts g and i of problem 1, and the code sample in problem 2.

Keith L. Green

-----