CS 3304  Home  Syllabus  Grades  Related Links E-Mail Contacts  E-Mail Instructor  E-Mail TA  E-Mail Listserv  Listserv Archive Course Notes  Contents  Search  Topics  Keyword Index Languages  Pascal  Scheme  Prolog  Standard ML Programs  Dates/Guidelines  Submit Program  Program 1 (9/29)  Program 2 (10/24)  Program 3 (11/14)  Program 4 (12/10) Homework  Dates/Guidelines  HW #1 (9/5)  HW #2 (9/12)  HW #3 (9/19)  HW #4 (9/24)  HW #5 (10/1)  HW #6 (10/8)  HW #7 (10/22)  HW #8 (10/31)  HW #9 (11/5)  HW #10 (11/12)  HW #11 (11/26)  HW #12 (12/3)  HW #13 (12/12)			25 Points Due: 11/05/01 at the start of class Complete each of the following problems: Write an implementation for the Prolog predicate nth(Index,List,Element) that finds the Nth element of the given List, where the first element is counted as number 1. (This predicate is actually called nth1 in SWI-Prolog; there is also an nth0 predicate; you may use neither in your solution for this question). Chapter 7, Problem 10 (pp. 306-307 of 5E text, in 4E: Chapter 6, Problem 10 on p. 285. In some older 4E texts, the "10" is missing. The problem starts with the paragraph "Assume the following rules of associativity ..." in the paragraph following problem 9.) Chapter 7, Problem 21 (p. 308 of 5E text, in 4E: Chapter 6, Problem 21 on p. 286)