Last updated by Karen on Aug 5, 2014
Please send Karen e-mail and stay home if you have fever and other flu symptoms.
This section lists class announcements. Items will not remain on this page for the entire semester, but will instead attempt to represent the current week's announcements.
Week of Sept 1
TA information will be listed here, once TAs are assigned.
Acquire a copy of
And, you will need access to information about programming in the C language. Online sources may be enough, but no guarantees. Most any textbook that introduces the C language (not C++) is acceptable, so if you already have a book, use it. If you do not already have a book, please consider purchasing your own copy of
You will find this book relevant and useful in both further coursework and in industry.
printfformatting for integers
printfformatting for floating point values
There are both written homeworks and programs in this course. Programs focus on course topics. Grading is based on both correctness and programming style. You write C programs. You will be expected to design algorithms and organize code for these programs. Algorithm details will not often be covered in class. You are expected to write grammatically correct, clear documentation for the code. A description of expectations for programs is given in this Guidelines for Programs document. You will generally not be given test cases for your programs. So, you will need to identify reasonable test cases, and test your own program with them.
You will use computers that are running RedHat Linux, a Unix operating system. For the Fall 2014 semester, these are the mumble machines in rooms 1350 and 1351 CS. If you had an account in CS last semester, it will still be available to you. Otherwise, you have been assigned a new account.
Assignments are due as stated on each assignment: given by both a due date and a time. Assignments will be turned in online. Any assignment turned in after the due date/time and up to 24 hours late will receive a deduction of 25% of the total available points. Any assignment turned in more than 24 hours after the due date/time will not be graded, and it will receive a zero score. Exceptions to this late policy will be considered only if discussed with your instructor well before the assignment is due.
Grading is quite strict. Pay attention to the requirements given with each assignment; missing requirements will result in deductions.
You may work in pairs on most assignments. Both students working together must be currently enrolled in the course. Each student must (individually) turn in each assignment. On collaborated assignments, there will be 2 copies of the assignment turned in: one by each of the pair working together. This is required to simplify the grading and to insure that both partners have copies of code that might be utilized in subsequent assignments. Include the names and sections of both students involved, as stated in the assignment specification. The TA will choose to grade just one of these turned in assignments, giving the same score to both students. Pairings may be different on different assignments.
Exam questions will require your understanding of both homeworks and programs. Expect exam questions to determine whether you both did and understood the assignments.
There will be 3 exams. The first 2 will be during the standard evening exam time, starting at the beginning of the 5:30pm midterm time period; the last exam is given during the summary activity period. The dates of the exams are given in the schedule below.
Bring a current photo ID to all exams. Your UW student ID is preferred. No ID, no exam!
Each student may use one 8.5 by 11 inch sheet of paper with hand-written notes when taking the exams. Both sides of the paper may be used. These notes may not be shared when taking the exam. The goal of these notes is to reduce anxiety and help students prepare for exams by deciding what should be on the page of notes.
Copies of appropriate tables for ASCII/x86 will be provided as needed with the exam.
No electronic devices (such as calculators and laptop computers) may be used during exams. Cell phones will be turned off during exams. A phone that rings during an exam may result in a penalty, determined by the instructor.
If you have a conflict with any listed exam time, you must notify Karen before Friday Sept 20. Conflicts include other exams, as well as other class activities that meet during the exam time and have a graded component.
University policies will be followed strictly in this course. Please, pay particular attention to policies on academic misconduct and incompletes.
During the fall 2013 semester, there were only 2 exams. Here is the first fall 2013 exam. Please note that it covers more of the semester than this semester's first exam will.
Here are sample exam questions to help you prepare for Exam 1:
exam 1 extra questions
answers to some of the questions
To help prepare for exam 2, here are sample questions:
To help prepare for exam 3, here are sample questions:
Grades will be based on the exams and assignments. More difficult, and more time consuming assignments may be given more weight than easier ones.
Requests for re-grades must be made within one week after graded work is returned. For programs and homeworks, contact the TA listed as the grader on your grade sheet. For exams, talk to Karen.
Here are some (possibly) helpful web pages.
All students are responsible for the material under the headings of Topics and Lecture Slides, Reading, and On Your Own. Material under the heading of On Your Own will not be covered in class.
Only assume that lecture slides are ready the week they are
used in lecture. The slides posted far ahead may be referenced,
but they are old, and have not yet been
updated for this semester.
|Dates||Topics and Lecture Slides||Reading||On Your Own||Beyond 354||Due Dates|
on Important Terms you must know
questions, questions with answers
questions, questions with answers
Part 1: pdf
introduction to C,
I/O in C
Part 2: pdf,
lots of K&R,
on functions and memory allocation
questions, questions with answers
|finish the optional Assignment 0 by Friday|
C: structures and linked lists:
stack from a linked list pdf
integer arithmetic and logical operations:
lots more of K&R,
integer arithmetic, logical, and shift operations, 2
|addressibility: questions, questions with answers||floating point representation|
|9/22-26||Intel x86 assembly language pdf slides||two's complement multiplication||
Assignment 1 due Wednesday: C program
|9/29 - 10/3||
the stack and function implementation
pdf slides 1,
pdf slides 2
finish function implementation,
Covers C programming, linked lists, stacks, arithmetic and logical operations
dynamic memory allocation
Assignment 2 due Wednesday: binary bombs
I/O introduction and Disks
Part 1 pdf, Part 2 pdf
input and output
more on I/O and DMA
memory hierarchies and caching
just for fun, read The Story of Mel.
Assignment 3 due Wed: interrupts
Covers x86 coding, function implementation, I/O, exception handling
finish virtual memory,
linking and loading
Assignment 4 due Monday: caches
Part 1 pdf slides,
Part 2 pdf slides
|introduction to pipelining||Assignment 5 due Wednesday|
|Wednesday Dec 17, 10:05am-12:05pm||