Difference between revisions of "CSC111 Final Exam 2014"
| Line 16: | Line 16: | ||
<br /> | <br /> | ||
| − | =Problem #1= | + | =Problem #1 (50 points)= |
<br /> | <br /> | ||
<source lang="python"> | <source lang="python"> | ||
| Line 44: | Line 44: | ||
<br /> | <br /> | ||
The list above is a list of people, dogs, and cats. | The list above is a list of people, dogs, and cats. | ||
| − | =Your Assignment= | + | ==Your Assignment== |
<br /> | <br /> | ||
Write a program that will read this string, parse it, store it in some data structure, and output the answers to the following questions: | Write a program that will read this string, parse it, store it in some data structure, and output the answers to the following questions: | ||
| Line 74: | Line 74: | ||
| + | ==Grading== | ||
| + | * A maximum of 30 points will be given to well documented programs that answer all questions using regular parsing methods, but not using any new classes. | ||
| + | |||
| + | * A maximum of 40 points will be given to well documented programs that answer all the questions and that create new classes and objects to hold the various pieces of information. | ||
| + | |||
| + | * A maximum of 50 points will be given to well documented programs that answer all the questions and that use classes derived from the People and Dog classes of [[CSC111_Homework_10_2014#Problem_.232:_Of_dogs_and_people... | Problem 2 of Homework 10]]. | ||
| + | |||
| + | <br /> | ||
</onlydft> | </onlydft> | ||
