CS115 Lecture Notes - Lecture 5: Data Definition Language, Advanced Land Observation Satellite

• School: University of Waterloo
• Department: Computer Science
• Course: CS115
• Professor: Victoria Sakhnini

Document Summary

Be comfortable with the terms recursive, recursion, self-referential, base case, structural recursion. Understand data de nitions for lists, how the template mirrors the de nition and be able to use the templates to write recursive functions consuming this type of data. Understand box-and-pointer and nested boxes visualizations of lists. Be able to do step-by-step traces on list functions. Understand how to use (listof ) notation in contracts. Be comfortable with lists of structures, including understanding the recursive de nition of such data types and be able to derive and use a template based on such a de nition. Has one or more base cases / self-referential (recursive) cases. Constructing a list ex. (cons a (cons b empty)) : list of a and b (cons 7 (cons 9 (cons 2 empty))) : list of 7, 9, 2. Rst : ( rst (cons elt alist)) => elt. Rest: (rest (cons elt alist)) => alist.