HW05: Intro to Forms and Javascript due Tue 03 Oct 13:20


In this assignment you will:


In all you do please remember that being a part of CSCI@HSU means DOING THE RIGHT THING.

So, do this assignment in a way that demonstrates integrity, develops competence, is correct, and honors God ... because what we do matters!

Allowed and Disallowed Resources

In completing this assignment you MAY use/access the following resources:

You may NOT use/access:

Failure to abide by these guidelines will result in a zero for the assignment and the incident will be reported to the university provost as a violation of the university academic integrity policy. A second incident of academic dishonesty (whether from this course or another computer science course) will result in an F in the course.

Part 1: Add a Form to poemlayout.html (8 pts)

In the hw05 directory edit your poemlayout.html file and add a form in the bottom-center section (which currently contains a poem). The form should provide elements that will allow a visitor to send you a poem. These are the requirements:

For reference purposes, here is an image of the page I created when following these instructions: https://josephus.hsutx.edu/classes/w1/source/images/flexedpoem.png (except that the submit button should be full width).

Commit and push your work to bitbucket.

Part 2: Add a Form to Your Personal Page (8 pts)

Add a form of some sort to the home page of your personal project (or to a separate page that is linked to from the home page). Remember, the purpose of creating the form is for you to practice making forms, so take time to include multiple kinds of elements even if you have to stretch a bit. Your form should be appropriately styled and should include a set of radio buttons. Use the list of guidelines in Step 1 above to guide you.

Commit and push your work to bitbucket.

Part 3: More Javascript Practice (8 pts)

In this exercise you will modify the hellojavascript.html and hw05.js files we used on lab day.

Write a Javascript function called removeDups that accepts an unordered array (with numeric indexes) of unordered elements as a parameter and returns the array with duplicate elements removed. The final array should not have any gaps. Demonstrate that this function works following the pattern we used in lab day.

Commit and push your work to bitbucket.