🏷️ LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →
Log in
HomeStudy Guides420,000CA160,000

CS135 Final: Final Exam Review great review for overall key concepts

247 views4 pages
School
University of Waterloo
Department
Computer Science
Course
CS135
Professor
Byron Weber Becker

For unlimited access to Study Guides, a Grade+ subscription is required.

Document Summary

Understand the basic syntax of scheme, how to form expressions properly, and what dr. racket may do when given an expression that causes an error. Be comfortable with the terms: function, parameter, application, argument, constant, expression. Be able to define and sue simple arithmetic functions. Understand the purposes and uses of the definitions and interactions windows. Understand the reasons for each component in the design recipe and the particular way they are expressed. Use the design recipe and appropriate coding style for all programs you write in scheme. Understand boolean data, and be able to perform and combine comparisons to test complex conditions on numbers. Understand the syntax and use of a conditional expression. Understand how to write check-expect examples and tests and use them in assignments. Be aware of other types of data which will be used in the future, such as strings and symbols.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

CS135
Final Exam
Study Guide
CS135 Final: Final_Package.pdf
yellowworm625
CS135
Final Exam
Study Guide
CS135 Study Guide - Final Guide: General Idea, Boundary Value Problem, Firstclass
magentalouse7
CS135 Chapter 1-5: How To Design Programs, Chapter 1-5
sayheyfei

Related Questions

  1. Complete the following problem using concepts of STACK.
  2. If you are using JAVA, you must include the main method as well which should test your other methods and print the outputs according to the tasks.
  3. If you are using PYTHON, make sure your code has the methods invoked and proper printing statements according to the tasks.
  4. Your program will take an arithmetic expression as a string input. For Example:

     

    • “1+2*(3/4)”

     

    • “1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14”

     

    • “1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14”

     

    Program

     

    Your program will determine whether the open brackets (the square brackets, curly braces, and the parentheses) are closed in the correct order.

     

    Outputs:

     

    Output 1

     

    1+2*(3/4)

    This expression is correct.

     

    Output 2

     

    1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

    This expression is NOT correct.

    Error at character # 10. ‘{‘- not closed.

     

    Output 3

     

    1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14

    This expression is correct.


    Output 4

     

    1+2]*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

    This expression is NOT correct.

    Error at character # 4. ‘]‘- not opened.

    Task 1

    Solve the above problem using an array-based stack.

     

    Task 2

    Solve the above problem using a linked list-based stack.

Example 1: Define a function that takes an argument. Call the function. Identify what code is the argument and what code is the parameter.

Example 2: Call your function from Example 1 three times with different kinds of arguments: a value, a variable, and an expression. Identify which kind of argument is which. 

Example 3: Create a function with a local variable. Show what happens when you try to use that variable outside the function. Explain the results.

Example 4: Create a function that takes an argument. Give the function parameter a unique name. Show what happens when you try to use that parameter name outside the function. Explain the results.

Example 5: Show what happens when a variable defined outside a function has the same name as a local variable inside a function. Explain what happens to the value of each variable as the program runs.

9. 14 marks. Consider the following Scheme functions, (define (deira x) (cond [(even? x) 2: else 1])) (define (multiply-some numbers) (cond [(empcy? numbers) [else (* (delta (firs!. numbers)) (multiply-some (rest runders))))) Write a condensed trace, showing the recursive calls of multiply. sone and calls to delca, for the following expression. Put one step on each line. You may not need all the lines. (multiply-some (cons 21 (cons 4 icons 62 emp'y))))