cse141: Assignments

Homework Policy

• Homeworks are due by 5.00pm on the due date unless otherwise noted.
• Turn in your printed solutions to Sanath's mailbox (Ramesh, Sanath Kumar)in the CSE grad student mailroom, unless otherwise noted.
• Late assignments will not be accepted.
• There is no regrading of written homeworks, except for addition errors. No single problem will have a significant impact on your grade.
• Homework must be completed individually.
• Studying in groups is definitely encouraged.
• Typically, homework assignments may be graded based on a statistical subset of the problems in each assignment.
• Homeworks must be typed or clearly handwritten. Illegible/unreadable answers will receive no credit.

Integrity Policy

• Cheating WILL be taken seriously. Doing otherwise is not fair to honest students. It is also not fair to allow the cheater to thing that it is a reasonable alternative in life.
• Please review the UCSD student handbook for more details on Academic Integrity.
• Anyone copying information or having information copied during a test will receive an F for the class and will not be allowed to drop. They will be reported to their college dean. If you can prove non-cooperative copying took place, your grade may be restored, but you must prove it to the dean--I don't want to be involved. Anyone caught cheating or falsely representing the work of others on the homework will not be allowed to turn in further homework. Your grade will be based exclusively on the tests with a penalty of 25% OR GREATER applied.
• We photocopy a random sampling of the exams in order to ensure that students do not modify their tests after they have been returned.
• Online solutions, etc.: A solutions manual exists for this text. Using it, or any solutions you may find on the internet elsewhere IS CHEATING and will be dealt with accordingly. We know what the solution manual solutions look like. Homework is a small fraction of your grade.

Assignments

Due: January 11

Please login into the WebCT blackboard learning system. Your login name is your official UCSD user name (i.e., your @ucsd.edu email address without the "@ucsd.edu" part). Password is your campus wide password.

Select the "CSE 141 - 2011 Winter Swanson" within your course list and then click on the "Discussions" in your course tools. Take some time to explore the discussion board features.

Reading the WebCT discussion board is mandatory. It is the only place that all announcement related to class will be posted.

Due: January 11

Please send TA a code name for the grade sheet (appearing in the grade sheet instead of your real name).

Changelog

Due: January 20

Unless otherwise noted, the following problems are from the Patterson & Hennessy textbook.

• Chapter 2: 2.4(part b only) and 2.17(part b only)

Changelog

Due: February 3

Unless otherwise noted, the following problems are from the 4th edition of the Patterson & Hennessy textbook.

• Chapter 1: 1.4, 1.15 (Part (a) only

Due: February 3

In this assignment, you may need gcc and gdb. If you are not familiar with these tools, here is a short tutorial about the basic use of them. Now, consider the C code.

1. Please use gcc to generate the assembly for these two functions without optimization (-O0).
   1. Identify each function in the output file, and then create an annotated version of the assembly that includes a brief description of what each instruction is doing (referencing statements in the source code where appropriate), and a count of the arithmetic operations and memory accesses required by each instruction (check the slides from Thursday for an example).
      To figure out what the assembly code does, use the four documents listed below. The first one should have most of what you need and includes common addressing modes as well, so start there. However, depending on which version of gcc your machine has installed and which particular processor you are running, you may encounter additional instructions. The other documents will be helpful in this case. Unfortunately, we have not found a good, concise listing of x86 instructions.
   2. How many arithmetic operations and memory accesses will sum(a, 10) require (assuming 'a' is an array of 10 integers)?
   3. How about max(4, 1)?
2. Repeat the previous problem, but compile the program with optimization level 1 (-O1).
3. Assuming arithmetic operations and memory accesses take the same amount of time, what is the speedup of the optimized version relative to the unoptimized version?

References

• Table of instructions you are likely to encounter in this class (this will be updated throughout the course).
• A good reference for 32bit x86 instructions.
• A very compact summary of x86 instructions.
• A longer document about 64-bit x86..

Changelog

Due: February 10

Unless otherwise noted, the following problems are from the 4th edition of the Patterson & Hennessy textbook.

• Chapter 1: 1.10.1(b)-1.10.3(b)
• Chapter 4: 4.6.1(b)-4.6.3(b), 4.10.1(b)

Changelog

Due: February 17

Unless otherwise noted, the following problems are from the 4th edition of the Patterson & Hennessy textbook.

• Chapter 4: 4.20.1(a), 4.20.2(a), 4.20.3(a), 4.22.1(a), 4.22.2(a), 4.24.1(a), 4.24.2(a), 4.24.3(a)

Changelog

Due: February 24

• Chapter 4: 4.21(a part only)

Changelog

Due: March 3

Unless otherwise noted, the following problems are from the 4th edition of the Patterson & Hennessy textbook.

• Chapter 5: 5.4.1, 5.4.2, 5.4.4, 5.4.5, 5.4.6, 5.7.1 to 5.7.6 (Part b only) Note: In question 5.4, the Index is must be from 11-5. There is a typo in the book.

Changelog

Due: March 10

Unless otherwise noted, the following problems are from the 4th edition of the Patterson & Hennessy textbook.

• Chapter 5: 5.5.1-5.5.2, 5.10.1-5.10.2, 5.11.1-5.11.2 (Do only part a. of all above problems).

Due: March 10

Unless otherwise noted, the following problems are from the 4th edition of the Patterson & Hennessy textbook.

• Chapter 6: 6.3.1, 6.3.3 (Do only part b. of all above problems)
• Chapter 4: 4.28.2, 4.28.5 Using the following MIPS code:

  			add $1,$0,$0
  			Again: beq $1,$2,End
  			add $6,$3,$1
  			add $8,$4,$1
  			lw $7,0($6)
  			addi $1,$1,1
  			sw $7,0($8)
  			beq $0,$0,Again
  			End:
  			(Do only part a. of all above problems).