ECE220: Computer Systems & Programming
Spring 2018 Honors Section

Announcements

• Welcome to the Honors Section of ECE220! I hope that you had a great break!
• We will use Compass for distributing grade information.
• Please use Piazza for discussion of assignments (sign up here).
• If you need to refresh your knowledge of the LC-3 tools, try the old homework under References below.
• Here are some old exam problems that you can peruse to study for MT1. I may add more later.
• First (rules) and last (reference) pages of Midterm 1 can be found here. It's about 6 pages of actual material (plus white space, front and back pages, and so forth). You won't need an ASCII table, but you may want to have a picture of a stack frame.
• Here's a grading scale including both an absolute scale and a curve.
• Here are some old exam problems that you can peruse to study for MT2 (zip or tar.bz2).
• First (rules) page of Midterm 2 can be found here. It's about 6 pages of actual material (plus white space, front and back pages, and so forth). You won't need the LC-3 reference this time.
• First (rules) and last two (reference) pages of Final can be found here. It's about 7 pages of actual material (plus white space, front and back pages, and so forth), but a fair bit of reading. The LC-3 reference is back, but we won't offer Appendix A this time.

Course Information

• Course overview and policies
• Lecture schedule
• Web page from the first offering of ECE220 (Spring 2013)

Staff and Office Hours

See photos here.

Assignments

• MP1: Printing Subroutines; here's a test, an lc3sim script, and the output expected from the script. Read the comments in the test file for instructions.
• MP2: Translating and Printing a Student's Schedule (and some tests that will show up in your SVN directory soon)
• MP3: Solving a Scheduling Problem with DFS
• MP4: Solving a Row in a Nonogram (due SATURDAY 17 Feb.)
• MP5: Using Functions to Draw a Picture (original version--yellow highlighting in current version shows changes)
• MP6: Blocky: A Game of Falling Blocks
• MP7: Testing and Debugging C Programs
• MP8: Flood Fill with Recursion
• MP9: Mieber: Walk Me There
• MP10: Mieber: Walk Me There, Part II
• MP11: Code Generation for an LC-3 Compiler
• MP12: Dancing Turtles

Exams

Lecture Notes and Overviews

• MT1 Material
• Review: Computers are Dumb
• Introduction to 220
• Review: Systematic Decomposition
• Review: Review: Good Design
• Review: Letter Frequency Planning
• Review: Review: Letter Frequency Decomposition
• Review: Letter Frequency Coding
• LC-3 I/O Registers
• LC-3 I/O Implementation
• LC-3 I/O Usage Example
• Code Reuse: Subroutines
• Call Interface Specification
• Privilege and Other Reuse
• The Stack Abstraction
• High-Level Languages
• Review: Re-Introduction to C
• Review: Basic I/O in C
• Expressions and Operators in C
• Scope, Storage Class, Memory Map, and Register Conventions
• C to LC-3 Example: Finding an Absolute Value
• Control Constructs in C
• C Functions and Examples
• Designing Loops
• MT2 Material
• Programming with Functions
• Stack Frames Revisited
• Pointers
• Arrays
• Error Taxonomy
• Testing and Examples
• Testing the Nonogram Code
• Recursion
• Recursion Examples
• More Recursion Examples
• Structured Data in C
• Developing a Data Structure
• Defining New Types
• Dynamic Resizing
• Fully Dynamic Allocation
• Pointer-Based Data Structures
• Dynamic Allocation Think-Pair-Share
• Final Material
• Implementing Dynamic Allocation
• (see I/O notes under Reference Sheets below)
• I/O in Unix and C
• Pyramid Tree I/O Example
• Three Part I/O Example
• Function Pointers and Callbacks
• Hierarchies of Structures
• Data and Function Inheritance
• Access Control
• Constructors and Destructors
• New and Delete
• Overloading and References
• Implications of Overloading

Reference Sheets

• Homework #12 from F12 ECE120 -- hw12-probA.bin, hw12-probB.asm
• 220 exam handout with guide to the LC-3 tools
• Command Line Reference Sheet
• Vim Reference Sheet
• SVN Reference Book
• Instructions for remote EWS login
• Patt and Patel appendices: Appendix A describes the LC-3 Instruction Set Architecture, and Appendix C describes a microprogrammed implementation of their control unit.
• LC-3 with RTL
• MT1 Solution
• I/O Notes
• MT2 Solution
• Final Solution

Example Programs

• LC-3
  • Letter Frequency Example: asm, flow chart
  • Print in Binary Example: asm
  • Read Number Subroutine: asm, 120 Slides for non-subroutine version
  • 16-bit Palindrome Test: asm
• C
  • C to LC-3 example: C, LC-3
  • C function examples: functions.c
  • Loop design example: dump memory
  • Prime printing example: primes
  • Quadratic solving example: quadratic
  • Reverse printing example: print_reverse
  • Nim solution example: Nim
  • Dynamic allocation think-pair-share: trees.c and the tree from the slides. Replace build_tree with your own version; main includes a few tests, and the output file should match the input file.
  • Implementation of dynamic allocation: header file (pdf, source), source file (pdf, source), test code source
  • Pyramid tree I/O example: Makefile, C header, C source, example graph, and second example graph
  • Three-part I/O example: word split (pdf, source), line sort (pdf, source), and unique count (pdf, source)
  • Generic sort routine (including three examples of use): isort.c