# Homework 2: Function Calls, Switch Statements, and Optimizations

Assigned Saturday, October 20, 2012 Friday, October 26, 2012 at 17:00

## Introduction

The purpose of written homework assignments is to get you thinking about the topics being covered in lecture and in readings in the textbook which are not represented in the hands-on, programming lab assignments. These written assignments also better prepare you for course examinations. It is worth noting that the book contains many pratice problems similar to the problems we ask on these written assignments. The solutions for those practice problems are located at the end of each chapter and should give you a feel for the kind of answers we expect you to turn in for these kind of assignments.

## Logistics

Since these written homeworks are not programming lab assignments, you will turn in your assignment online as electronic documents in PDF format. We will not accept any paper submissions.

Same rules as for homework #1

We will provide solutions to all of the problems in the written homework assignments in a timely fashion after the assignment is due. Since the late policy affords you a maximum of three late days, we cannot release solutions until the Wednesday following the assignment's due date, at the earliest.

## Questions

From the textbook (including some practice problems, do them on your own first, you may then check your answers at the end of the chapter, make sure you understand the solution provided, turn in your answer to each corresponding question below as part of your write-up - you do NOT need to turn in the answer to the practice problem in its entirety - just enough to explain your answer to the question below):

1. Practice Problem 3.30, Is the stack affected after executing these two instructions? If so, how? If not, why not?
2. Practice Problem 3.33, How would you change the assembly code to eliminate the space that the compiler wasted on the stack?
3. Practice Problem 3.51, What is returned if the function is called with i=6?
4. Practice Problem 3.42, Can you describe a general strategy for arranging elements of a struct so that the space the struct uses is minimized?
5. Homework Problem 3.62
6. Homework Problem 3.64

## Notes

Make sure you are using the second edition of Computer Systems: A Programmer's Perspective. If you're not using the right book, you might be doing the wrong problems!