310 CS 5/3/2004 HANDOUT #59 C. Edmondson-Yurkanan
Objectives for the Last Exam: a 50minute exam
This exam will cover the material from the last
half of Lecture 30 thru Lecture 42 & is NOT cumulative
(except that some material does build upon the semester)
DATE: Friday May 7th in class 11a.m. and 2p.m. You must take the exam at
the class time for which you are officially registered:
only students in 50860 and 50870 may take the exam at 2p.m.
OFFICE HOURS: Regular office hours are over on Friday. We will announce
our last office hours once the exam and project are graded.
DETAILS:
Notecards will NOT be allowed for this exam.
Calculators will NOT be allowed for this exam.
Please bring your UT Photo ID.
I will provide you with the LC-3 reference card from exam2 (see
handout 46), plus I will include a list of virtual instructions
that you may use as well (shifting, push, pop, mul, div, sub, or).
I will also provide you with an ASCII table if needed, and
Figure C.3 and Table C.1.
READING:
a) MOST IMPORTANTLY: your notes from Lecture 30 through Lecture 42
and your notes from Discussions 12 through 15.
b) handouts #43,#46-#61 (#60: linking/loading notes, #61: a few practice
problems)
c) See agendas page for goals of each lecture, plus links to the lecture
and discussion notes.
d) Patt/Patel: 2.6, 2.7.1, 2.7.2, 4.3-4.4, 5.6, 7.4, 8.5, 9.2.5, Ch 10,
11.4.1, 12.3.5, 12.5, 14.3, 19.4, A.4, pg 565-570, 572, Fig C.6
e) Maccabe 1.1.6, 4.6 (skip 4.6.2), 6.3-6.5, 7.2.6, 8.3, pg 351-352,
10.2 (skip pg368, 370-374), 10.3 (skip 380-392), 10.4, 11.2.3,
12.1 (pg 441-4), 12.2 (skip 12.2.4), (omit 12.3)
-----------------------------------------------------------------------------
Topics Covered: (Note: a more detailed description of the topics is on
the agendas web page, day by day.)
OS topics:
* Interrupts - what h/w (ISA & microA.) additions are required to
support interrupts?
* VERY IMPORTANT: Programming with interrupts (3 components)
* OS cooperating processes interacting as producer-consumer
* trap handler called by OS (such as getc, putc)
* interrupt service routine
* buffer management s/w (such as enq, deQ, ...)
* Be able to write any of this code (either in HLL or LC3),
or be able to identify what action accurs in
which component
(continued)
OS topics continued:
* Layout of all OS (kernel) & user code in memory (called a memory map)
kernel code, kernel global data, (kernel stack), user code,
user globabl data, runtime stack for activation record and
local variables, heap for dynamically allocated data
* Linking and loading
* Translation process:
* at what time does an event occur: compile time, assembly
time, link time, load time, runtime
* OS exceptions (synchronous to your program and asynchronous)
* trap mechanism, interrupt, illegal instruction - were some
examples that we discussed
Compiler topics:
* compiler convention for function calls,
* stack pointer, frame pointer
* "state", i.e. what values must be stored for a func. call
* stack frame (aka activation record)
* using the CS310 Simple Stack Frame,
* using the CS310 complete Stack Frame,
* compare the 2 above to the Parameter Block approach
* Given a HLL variable, and assuming that the compiler does not use a
register for this variable, then into which section(s) of the
"OS memory map" is that variable stored? (for HLL global
vars, local scalar vars, local Ctype arrays/structures,
local dynamic variables,...) What addressing mode would
be used to access a HLL scalar variable, that is global, ...?
Algorithms:
* creating a mask to set, clear, invert a bitfield
* bit manipulation: insert a value into a bit field, extract a value
from a bit field
* Conversion from the binary repr. of an integer to the binary
re...