Problem set 4 is available here. It is due on 8 March by 10PM.

# Other articles

# Lecture 12: Performance

After we finish with floating point, slides for today are here.

# Lecture 11: Floating Point

Slides for today are here.

# Quiz 3

When instructed to in class, follow this link to get to Quiz 3.

# Lecture 10: Multiplication and Divsion

Slides for today are here.

# Reading for 1 March

Read chapter 1 section 1.6.

# Lecture 9: Arithmetic Circutis

Slides for today are here.

# Reading for 22 February

Read in chapter 3 sections 3.1-3.5.

# Quiz 2

When instructed to in class, follow this link to get Quiz 2.

# Lecture 8: Transistors and logic

Slides for today are here.

# Quiz 1

When instructed to in class, follow this link to get Quiz 1.

# Lecture 7: Compilers

Slides for today are here.

# Reading for 15 February

Reading in Appendix B sections 1,2, and 3.

# Problem Set 3

**Due 27 February by 10pm**Your assignment is to code a recursive implementation of Quick Sort in MIPS assembly and run it on the simulator.

You can find the tools for this assignment here.

Here is an example of quick sort in C.

#include <stdio.h> int data[] = { 46,78 …

# Problem Set 2

**Due 20 Feruary by 10pm**Problem set 2 is available here.

You will use my hacked up version of Prof. McMillan's MIPS simulator to modify the code we wrote in class. This is brand new code so expect and report the occasional bug.

# Programming MIPS

Today we will back up a bit and write some MIPS code live in class. There is no better way to learn to program than actually doing it.

Let's start with an implementation of insertion sort in C. Here is a typical implementation.

#include <stdio.h> int data[] = { 42, 19 …

# Lecture 6: Stacks and Procedures

Slides for today are here.

# Readings for 8 February

Today we'll talk about section 2.8, next time we'll talk about section 2.12-13.

# Lecture 5 - Assembly and Simulator

You can find the slides for today here.

Copying the code from the slides loses for formatting so I'll put the code fragments here.

Slide 9

add $t0,$zero,$zero # sum = 0 add $t1,$zero,$zero # for (i = 0; ... loop: addu $t0,$t0,$t1 # sum = sum + i; addi $t1,$t1 …

# Problem Set 1

Problem set 1 is available here. This is brand new code so expect and report the occasional bug.

The little text field should turn red if you have the format wrong and green when it thinks you have the answer correct.

# Lecture 4 - Addressing Modes

You can find the next slides here.

# Try a poll

# Lecture 3 - Instruction Set

When we finish the previous slides we will begin talking about the instruction set. You can find slides for today here.

# Lecture 2 - Representation

Today we will talk about representing information. You can find slides for today here.

# Reading for 23 January

Read in P&H Chapter 2.1-2.7.

# Reading for 18 January

Read P&H Chapters 1 and 2.3-2.4.

# Getting to know you survey

Please fill out this survey so I can better get to know you.

# Sign up for Piazza

Signup for Piazza using this link.

# Poll Everywhere

Sign up for Poll Everywhere using this link. We'll use it for responses in class.

# If you want in to 411

If you are not currently enrolled and would like to be considered please fill in this form.

# Lecture 1 - Introduction

Today we will introduce the course and the topic. You can find slides for today here.

# Welcome

Welcome to the site for Comp 411 section 2 for spring 17.