EEL-5840 Lecture 6 Fall 2009 Dr. Arroyo 1Now Due Tuesday September 15, 2009 in classBe sure to follow the guidelines for Programming Assignments. Since these problems are simple, you may skip the Statement of the Problem, Approach and Algorithm - Program Flow sections and give an overall conclusion for the entire programming assignment. Make sure you give me a listing of each program and at least three test cases for each. You may wish to use the "dribble" option in the file menu of XLISP to capture the screen as you test your functions. I.Define MYLIST to what the primitive function LIST does. II.Define MYAPPEND to what the built-in function APPEND does. III.Define MYLAST to what the built-in function LAST does. IV. Write a function, UNNEST, which takes a single list as input and returns a simple list of all its atoms. Ex. (unnest '(1 (2 (3)) (4 5))) ==> (1 2 3 4 5) (unnest '((((test two))))) ==> (test two) V. Write a function, LEN, which is the same as LENGTH. DO NOT use LENGTH in your
This is the end of the preview. Sign up
access the rest of the document.