Study Guides (248,655)
Canada (121,665)
CS 135 (14)
Final

Final Exam Review great review for overall key concepts

4 Pages
413 Views

Department
Computer Science
Course Code
CS 135
Professor
Byron Weber Becker

This preview shows page 1. Sign up to view the full 4 pages of the document.
Description
CS 135 Final Exam Review Module 1understand the basic syntax of scheme how to form expressions properly and what Dr Racket may do when given an expression that causes an errorbe comfortable with the terms function parameter application argument constant expressionbe able to define and sue simple arithmetic functionsunderstand the purposes and uses of the Definitions and Interactions windows Module 2understand the reasons for each component in the design recipe and the particular way they are expresseduse the design recipe and appropriate coding style for all programs you write in schemeunderstand Boolean data and be able to perform and combine comparisons to test complex conditions on numbersunderstand the syntax and use of a conditional expressionunderstand how to write checkexpect examples and tests and use them in assignmentsbe aware of other types of data which will be used in the future such as strings and symbolslook for opportunities to use helper functions to structure your programs and gradually learn when and where they are appropriate Module 3intuitively understand the grammar rules used in the textbook and in the help desk to specify the syntax of Schemeunderstand the substitution based semantic model of Scheme and be prepared to simplify furtherbe able to trace the series of simplifying transformations of a Scheme program Module 4understand the use of posnsbe able to write code to define a structure and to use the functions that are defined when you do sounderstand the data definitions we have used and be able to write your ownbe able to write the template associated with a structure definition and expand it into the body of a particular function that consumes that type of structureunderstand the use of type predicates and be able to write code that handles mixed dataunderstand unionnotation in contracts Module 5understand the data definitions for lists how the template mirrors the definition and be able to use the template to write recursive functions consuming this type of dataunderstand boxandpointer visualization of listsunderstand the additions made to the semantic model of Beginning Student to handle lists and be able to do stepbystep traces on lists functionsunderstand and use listofnotation in contracts
More Less
Unlock Document

Only page 1 are available for preview. Some parts have been intentionally blurred.

Unlock Document
You're Reading a Preview

Unlock to view full version

Unlock Document

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit