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: 10/1/01 at the start of class Complete each of the following problems: Consider the following Prolog code, taken from an on-line tutorial linked from the class home page: takeout(X, [X|R], R). takeout(X, [F|R], [F|S]) :- takeout(X, R, S). Describe what this predicate does. Write a Scheme implementation of takeout that behaves as closely as possible to this Prolog predicate. In what way(s), if any, is the behavior of your Scheme code different from the behavior of the Prolog code? Write a Scheme implementation of takeout_all that removes every instance of its first parameter at the top level of its second parameter, which is a list. Write a Prolog implementation of takeout_all.