CS 115: Introduction to Computer Science 1

Built-in functions and special forms allowed on assignments

Each assignment identifies the modules that are covered. Unless the question specifically describes exceptions, you are restricted to using the functions and special forms covered in lectures and described in this post for all assignment solutions. As the term goes on, more functions will be added for each module.

Module 1 & Module 2

Assignment 1 solutions may only use functions and special forms from Module 1 & 2.

Module 3

  • map, foldr, range, lambda
  • length, first, rest, append

Assignment 2 solutions may only use functions and special forms from Modules 1, 2 and 3.

Module 4

  • basic comparison functions, e.g. =, >, >=, <, <=, string=?, symbol=?, equal?, etc.
  • and, or, not
  • any type predicate function, e.g. string?, number?, integer?, symbol?, etc.
  • any predicate that tests the nature of its parameter, e.g. even?, negative?, zero?, etc.
  • cond, else

Assignment 3 solutions may only use functions and special forms from Modules 1, 2, 3 and 4.

Module 5

  • filter

Assignment 4 solutions may only use functions and special forms from Modules 1, 2, 3, 4 and 5.

Do not use recursion yet! That is, do not write a function that calls itself, even indirectly. All problems so far can be solved using map, foldr, cond, and elementary functions.

Valid XHTML 1.0 Strict Valid CSS!

Last modified on Monday, 04 June 2018, at 10:56 hours.

Course Supported by Instructional Support Group