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 (2/19)  Program 2 (3/19)  Program 3 (4/2)  Program 4 (4/30) Homework  Dates/Guidelines  HW #1 (1/24)  HW #2 (1/31)  HW #3 (2/07)  HW #4 (2/14)  HW #5 (2/21)  HW #6 (2/28)  HW #7 (3/23)  HW #8 (3/30)  HW #9 (4/06)  HW #10 (4/13)  HW #11 (4/20)  HW #12 (5/2)  HW #13 (5/2)			30 Points Due: 2/07/01 at the start of class Complete each of the following problems in the Chapter 14 Problem Set (pp. 602-603 of the text): Problem 3 Problem 5 Write your own implementation of the Scheme built-in function list-head: (list-head list k) Returns a newly allocated list consisting of the first k elements of list. K must not be greater than the length of list. Name your function my-list-head, since list-head is already provided as a standard operation in Scheme (you may not use list-head, list-tail, or sublist in your solution).