Assignment 6

Assignment 6 - CS 136 Fall 2009 Kate Larson Assignment 6...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Kate Larson Assignment 6 Due Tuesday, November 10, 2009, 10pm Language level : Module (full PLT Scheme). You are allowed to use mutation, if you wish. Question 3 involves programming in C. To submit : a6q1binary.txt , a6q1reverse-binary.txt , circular.ss , circularList.c , circularList-driver.c 1. In Assignment 5 you were asked to implement two C functions, binary and reverse binary . In this question you are asked to analyze your code in these programs with respect to the size and number of stack frames that are used when these two functions are called with parameter n . If you did not do this question in Assignment 5, then we will post sample code that you can use. This code will be posted once Assignment 5 has been submitted. Copy the code for the binary function you are going to analyse into file a6q1binary.txt . If the function binary was called with parameter n , then • How many stack frames would be created? • How large would each stack frame be? Include your answer in the file a6q1binary.txt , along with an explanation. Copy the code for the reverse binary function you are going to analyse into file a6q1reverse-binary.txt . If the function reverse binary was called with pa- rameter n , then • How many stack frames would be created? • How large would each stack frame be? Include your answer in the file a6q1reverse-binary.txt , along with an explanation. To submit:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/21/2010 for the course CS 136 taught by Professor Becker during the Fall '08 term at Waterloo.

Page1 / 3

Assignment 6 - CS 136 Fall 2009 Kate Larson Assignment 6...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online