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

  • any mathematical function found in the section 1.5 of the Racket documentation found here
  • define

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

Module 2

  • any string function found in Documentation on Strings here.
  • Any string function found in the section 1.11 of the Racket documentation found here
  • max, min

Assignment 2 solutions may only use functions and special forms from Module 1 and Module 2. You may not use conditional or if statements.

Module 3

  • 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, and 3.

Module 4

  • define-struct
  • any of the automatically generated functions associated with user-defined structures or the built-in stucture posn

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

Module 5

  • cons
  • first, rest
  • empty?, cons?
  • length
  • member?
  • string->list, list->string
  • any Char functions included in the documentation found here

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

Module 6

  • add1, sub1
  • list
  • second, third, fourth

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

Module 7

  • append
  • remove

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

Module 8

  • filter
  • map
  • ormap
  • andmap
  • foldr
  • build-list
  • range
  • sort
  • local
  • lambda
  • Assignment 8 solutions may only use functions and special forms from Modules 1, 2, 3, 4, 5, 6, 7 and 8. However, solutions must use abstract list functions (meaning no recursion), as well, all helper functions must be defined locally.

Valid XHTML 1.0 Strict Valid CSS!

Last modified on Thursday, 15 November 2018, at 13:43 hours.

Course Supported by Instructional Support Group