There are seven research assignments that will be assigned to the seven different people in the class.  The research assignments are:

 

Charles Babbage and Ada Lovelace

Eight Queens Problem

The Enigma Machine

Fermats Last Theorem

The Knights Tour

The Sieve Of Eratosthenes

Towers Of Hanoi

 

Part 1:

All projects require you to write a small paper, 1 to 2 minutes if read out loud.  In the case of the problems on Babbage/Lovelace, Fermat and Eratosthenes the paper must be written in the first person, that is, as if the person was write it.  Whoever has the Babbage/Lovelace paper, you can be either person.  Each paper must answer at least some questions.  Be aware that those are the minimum requirements to pass that portion and not guarantee to receive an A on that portion.  You must use at least one textbook and journal article in your research in total for parts 1 & 2.   You may also use Web resources.  All work, including programs must provide proper citations,  quoted text and web-site evaluation.  Citations for programs should appear as comments.  There is nothing wrong with getting programs from a book provided you cite the source.  You can find out about citation format and web-site evaluation by visiting LibraryStuff.  If you need more information, you can contact Professor Spiegelman at spiegem@ncc.edu or speak to one of the reference librarians in the NCC library either in person, via email or chat (see http://library.ncc.edu).  

 

Part 2:

You will need to write a program.  The program must be written in a higher level language.  They must also be adequately commented, cited along with instructions on compiling and running.

 

---

This part will be assigned after Parts 1 & 2 are completed.

 

Part 3:

The details of part 3 same remain secret at the moment but it will involve the gradings of Part 1 and Part 2. 

 

The grading points of Part 2 programs will be:

• Clarity of comments.
• Modular design.
• Instructions on running and providing input.
• Ease of running.
• Clarity of output.

 

 Create your own educational wiki!HelpPublic, not yet premium Privacy Policy RSS