Your total score for this course depends on the following:

• Permanent evaluation: Assignments computer systems
• Permanent evaluation: Project computer architecture
  Permanent evaluation counts for 55% of the course grade.
• Examination period: Theory exam
  The theory exam counts for 25% of the course grade.
• Examination period: Practical exam
• Examination period: Defense practical exam
  The practical exam together with its oral defense counts for 20% of the course grade.
• To pass the course, you need to get an overall score (sum of all of the above) of at least 50%. Note that as of next year (Academic Year 2014-2015), it will be necessary to obtain an overall score of at least 50% and a score of at least 50% on the theory exam.

• The weights of the different parts of the course remain the same as during the January session:
  • 25% theory-exam
  • 20% practical-examen
  • 55% assignments during the year ("permanent evaluation")
  Each of these parts may have to be re-done during the Second Session.
  You do not have to (but may) re-do those parts for which you got a score of at least 50% (i.e., "partiële vrijstelling"). You should explicitly ask for this exemption via e-mail and you will be notified via e-mail whether this request was granted.
• For the "assignments during the year" part, you will need to individually finish and submit (and defend) the "Computer Systems" assignments and a "Computer Architecture" project. These will be slight modifications of the original ones. Deadline for these assignments is 15 August 2014 at 23:55. Submission is done via Blackboard.
• The structure of the examination remains the same. All defenses take place during the examination period.
• The examination method and the material to study for the Second Session are identical to that of the First Session. There will again be a written theory exam about both CS and CA, as well as a practical exam with oral defense on Computer Architecture. An overview of the material to study for the exams is given here.

All lectures (in PDF format) can be found online (on Blackboard) as announced in class. Before each class, the slides are last year's. By the end of the lecture, the slides are updated to reflect this year's changes.

byRefenceVSbyValue.c demonstrates the use of call-by-value and call-by-reference in C.

In each lab session, you will be given some assignments (Computer Systems) and/or a project (Computer Architecture). All assignments are made individually, projects are solved in groups of two students.

After each lab session, a new "assignment" is enabled on Blackboard, with a strict deadline. You submit your solution of the assignments before the deadline (typically one week after the lab session). You submission must have these characteristics:

• Fill in all solutions to the assignments in the file oefeningen.html. Each solution consists of text, screenshots and/or hyperlinks to files (i.e. scripts, MIPS-files, ...).
• Put all your files in a tgz archive. The name of that archive consists of your last and first name, without spaces. If, for example, your name is Jan De Smedt, the file name of your archive must be DeSmedtJan.tgz.

The assignments can be found here.

In each lab session, you will work on a project in pairs of two students. Projects build on each other, to converge into a unified whole at the end of the semester. During the semester, you will be evaluated three times. At these evaluation moments, you will present your solution of the past projects by giving a demo and answering some questions. You will immediately receive feedback, which you can use to improve your solution for the following evaluations.

For every project, you submit a small report of the project you made by filling in verslag.html completely. A report typically consists of a summary of everything you implemented and an explanation of the choices you made ​​in the implementation. Again, put all your files in a tgz archive. The name of that archive consists of your last and first name, without spaces. If, for example, your name is Jan De Smedt, the file name of your archive must be DeSmedtJan.tgz.

The projects can be found here.

The HTML forms you will need for the solutions (right click, save as):

• oefeningen.html
• verslag.html

You have to adapt the HTML-code manually (i.e., in notepad) to fill in the forms. A good HTML tutorial can help you with this. Remark: in the forms, the <u> element for underlining is redefined to "overline". This way, you can express NOT in Boolean algebraic expressions: e.g., NOT A OR B becomes A+B. Unfortunately, double overline is not possible. Of course, you can always use the NOT A OR B notation.

Throughout the course we will use the following tools:

• Logisim
• MARS

Both tools require java to run. The tools are installed on the lab computers.

If you would like to run a UNIX distribution on your own computer, we suggest Ubuntu. You can install Ubuntu next to your Windows using the Windows installer. After installation, you will be able to choose on startup between Windows and Ubuntu. If you would like to run Ubuntu inside your Windows, you can install Ubuntu on VirtualBox by following these steps.

In order to copy files in Windows from and to servers (e.g., between your laptop and the radix.ua.ac.be server) you can use WinSCP. You can simply use the scp command if you are using UNIX.

The burden of timely submission of your work on Blackboard is on you! (late submissions are not accepted)

• Beware that Blackboard's clock may differ slightly from that on your computer. Allow a margin for submission.
• Be sure to check that your submission was actually made. Check for example under Grade Centre whether your (as yet unmarked) submission shows up.

Introduction to Unix

Introduction session on Unix commands. The use of Unix Shell Commands is explained.

Material:

• Slides Introduction
• Slides Introduction to UNIX
• Assignments

Regular Expressions and Sed

Introduction and assignments on regular expressions and sed.

Material:

• Slides
• Assignments

UNIX Scripting

Introduction to and assignments on UNIX Scripting.

Material:

• Slides
• Assignments

Data Representation

Assignments on data representation

Material:

• Slides
• Assignments

vi

Material:

• Slides

MIPS

Assignments on MIPS

Material:

• Slides
• Assignments

MIPS: Stacks and subroutines

Assignments on MIPS Stacks and subroutines

Material:

• Assignments
• frame example
• Subroutines/Functions in MIPS

MIPS: Recursion

Assignments on MIPS Recursion

Material:

• Assignments

Gates and Wires

Introduction to Logisim and the use of gates.

Material:

• Project assignment

Adders

Build an 16-bit adder (ripple carry adder and carry lookahead adder).

Material:

• Project assignment
• Slides CLA

ALU

Build a 16-bit ALU.

Material:

• Project assignment
• ALU_GroupXX.circ
• Test.py
• Test_GroupXX.txt

FSM

Build a register file, counter, clock divider and finite State Machine for a traffic light.

Material:

• Project assignment

Datapath (1)

Build a program counter and a datapath.

Material:

• Project assignment
• SD_GroupXX.circ
• Test.py
• SDTest_GroupXX.txt

Datapath (2)

Add branch, jump and immediate instructions to the instruction set.

Material:

• Project assignment
• Test.py (updated!)

Using the Datapath

Write programs to run on your datapath.

Material:

• Project assignment