Assignment 01

Contents:

  • Overview
  • Internet Requirements
  • Practice Problems
  • Problems to be Submitted
  • Extra Credit

  • Overview

    Topic: History of Computing
    Related Reading: Ch.0 and 4.1-4.2 of [Br], Mod.1 and p.235-237 of [DH]
    Due: 8pm Thursday, 24 January 2002

    Internet Requirements

    You will need an Internet connection for completing the assignment as well as submission.

    Practice Problems

  • Complete Lab 1.1 (p. 9 [DH]). This lab walks you through the use of a web browser.

  • Complete Lab 1.2 (p. 15 [DH]). This lab introduces you to the textbook's web site.

  • Question 4 of Ch. 4.1 (p. 170 [Br])

  • Question 4 of Ch. 4.2 (p. 178 [Br])

  • Chapter Review Problems 1, 2 and 3 (p.218 [Br])

  • Problems to be Submitted (20 points)

    1. (10 points)
      Read Lab 1.3 (p. 19 [DH]). This lab has you search the Internet to find ten historical facts about computers, computing or the people involved in advancing the discipline. For this assignment, you need only find five such facts.

      In writing up your assignment, please adhere to the following standards:

    2. For clarity, please number the facts from 1 to 5
    3. With each fact, please include the URL which you used as a source.
    4. Each of the five facts should be something which is not included in the required reading.
    5. Each fact can be as short as one or two sentences (please do, however, state your facts in complete sentences). You are free to paraphrase your source. If you choose to give a direct quote from your source, that statement should be enclosed in quotation marks.
    6. Some additional web sites of interest, though not mentioned by the book include:

    7. www.computerhistory.org/
    8. www.computer.org/history/
    9. You might also want to browse some of the links which were used in the notes for lecture 01.

    10. (5 points)
      Algorithms appear in many aspects of our daily lives, often described in written instructions (e.g., preparing food, setting the clock on the microwave, ordering a product from a catalog). For this problem, your goal is to look around your daily life for an interesting example of such an algorithm description. An "interesting" example would be one which includes optional steps, repeated steps, or other such features. (a less interesting example is one which is a single sequence of steps, such as 'step1...step2...step3...stop')

      For your submission, please type these written instructions, as they appear.

      Furthermore, consider the definition of an algorithm, as given in Figure 4.1 on page 169 of the Brookshear text. Evaluate whether or not you feel that the instructions constitute an "algorithm" by this definition, explaining your thoughts.

    11. (5 points)
      If I ask you to turn to page such-and-such of the text, what process do you use? (I'm pretty sure that you do not start turning pages one at a time)

      Please try to give a formal description of your "algorithm" for finding the page, in a way which satisfies the definition given in Figure 4.1 of [Br] (which, by the way, is on page 169).

    Overall, please type your answers to all of the problems in a single document to be submitted electronically. Please see www.cs.luc.edu/~mhg/comp150/submit/ for details about the submission process.

    Extra Credit (2 points)

    "Know your source!"

    It's great to gather information from the Internet, but important to cite your source of information so that others can judge its credibility. You should have already included a URL with each fact.

    For extra credit, rely on a different source for each of the five facts and identify the person or organization who provided the content on the given web site.


    comp150 Class Page
    mhg@cs.luc.edu
    Last modified: 23 January 2002