Date

Topic

Reading

Assigns

Notes (set)

1/20

Introduction

PH- Ch1

 MIPS1

1/22

C., MIPs and SPIM

PH-Ch3, App.A

 MIPS2

1/27

 ISA sand MIPS

PH-Ch4.1-4.3,4.8

A1 out

MIPS2-3

1/29

 Data Representations

PH-Ch4; M-Ch1

MIPS4

2/3

MIPS Instructions

PH-AppA

MIPS5

2/5

Decision Making

PH-Ch3, AppA

MIPS7

2/10

Jump and Branch

PH-Ch3, AppA

A2 out

MIPS7

2/12

Loops, Arrays

PH-Ch3,AppA

MIPS7

2/17

Arithmetic Instructions

PH-Ch3, AppA

 A1 due

MIPS8

2/19

Procedure Calls I

PH-Ch3

MIPS9

2/24

Procedure Calls II

PH-Ch3-Ch4

A2 due,A3 out

MIPS9

2/26

Procedure Calls III

PH-Ch.3,AppA

MIPS10

3/2

Linking and Loading

PH-Ch.4

MIPS11

3/4

MIPS Wrap-up

MIPS12

3/9

Midterm Review

A3 due

3/11

MIDTERM (in class)

3/16

Boolean Algebra

M-Ch2, PH-AppB

DC1

3/18

Boolean Algebra, Gates

M-Ch2, PH-AppB

DC1

3/23

Simplif. with K-Maps I

M-Ch3,

DC2

3/25

Simplif. with K-Maps II

M-Ch3

DC2

3/30

 Spring Break

4/1

Spring Break

4/6

Encoders, Decoders,Mux

M-Ch4

A4 out

DC3

4/8

Arithmetic Circuits

M-Ch4

DC4

4/13

Sequential Circuits I

M-Ch.5

DC5

4/15

Sequential Circuits II

M-Ch5

Dc5

4/20

Registers and Counters

M-Ch6

A4 due, A5 out

DC5

4/22

State Machines Analysis I

M-Ch5

DC6

4/27

State Machines AnalysisII

M-Ch5

DC6

4/29

State Mach. Design I

M-Ch5

Dc6

5/4

State Mach. Design II

M-Ch5

Dc6

5/6

MIPS Processor, Wrap-up and Review

PH-Ch5

A5 due

MIPS13