CSC 215 Weekly Assignments: Week 8

CSC 215


Overview

This week we will determine whether we can effectively integrate the ASR-33 into our assembly language programs to use it as an input/output device. If we can, we will extend the time we can spend programming in Intel 8080 assembly language.

Friday, October 23rd

Classwork / Homework / Evaluation

I'm out today, but Chris is here to give you the promised quiz. After that you'll have the rest of class and homework time to work on the four function reverse polish notation calculator program.

Wednesday, October 21st

Classwork / Homework / Evaluation

We'll begin class by sharing the reverse string programs from last class. We'll then stay in the same pairs and work on our final assembly language programming project, described below. You'll have the rest of your class period today to start on the project, but you'll be given homework time to prepare for the quiz on the version of the reverse string program that we select together in class today that will be given at the start of class on Friday.

We will use tt_revstr_asm.txt as the one to study for the quiz on Friday.

Project: Four Function Postfix Calculator

Write an assembly language program using the ASR-33 for I/O that implements a four function (+, -, * and /) Reverse Polish notation calculator on 16 bit signed integers. A sample run of your finished program might look like this:

=> 256 4 +
260
=> 2 3 4 * +
10
=> 2 3 4 + *
20

Monday, October 19th

Classwork / Homework / Evaluation

Today in class we will share the string reversal programs assigned last week using the ASR-33 for input / output and determine whether we can use it effectively as user interface.

Two students had working versions of the assigned program, Dimitri with reverse_string.asm and Mason, with teletype_reverse.asm.

Having made that much progress, and hearing from the rest of the class that while they didn't get it working, they made progress toward the goal, we agreed that this was definitely worth another day of time to complete. Here's what we agreed:

  • We would form the following pairs:
    Giselle and Delaine (the return of 67!)
    Mason and Waleed
    Dimitri and Stephan
    Nathan and Chris (both absent today)
    
  • The pairs will have class and homework time to get improve the programs so that they:
    1. Prompt the user to enter a string.
    2. Print out the string in reverse.
    3. Repeat this process forever.
    
  • Pairs will share their programs at the beginning of class on Wednesday. We will select the version we prefer, and we will have a short quiz on that version on Friday.