units
FIT2069
Faculty of Information Technology
This unit entry is for students who completed this unit in 2012 only. For students planning to study the unit, please refer to the unit indexes in the the current edition of the Handbook. If you have any queries contact the managing faculty for your course or area of study.
Refer to the specific census and withdrawal dates for the semester(s) in which this unit is offered, or view unit timetables.
Level | Undergraduate |
Faculty | Faculty of Information Technology |
Offered | Clayton First semester 2012 (Day) |
This unit covers the internal mechanism of computers and how they are organised and programmed. Topics include combinatorial and sequential logic, Boolean Algebra, Karnaugh maps, counters, ripple adders, tree adders, memory/addressing, busses, speed, DMA, data representation, machine arithmetic, microprogramming, caches and cache architectures, virtual memory and translation look-aside buffers, vectored interrupts, polled interrupts, pipelined architecture, superscalar architecture, data dependency, hazards, CISC, RISC, VLIW machine architectures.
At the completion of this unit students will have -
A knowledge and understanding of:
Examination (3 hours): 60%; In-semester assessment: 40%
2 hrs lectures/wk, 3 hr laboratory/fortnight, 2 hr tutorial/fortnight
FIT1031 or FIT1001 and FIT1008 or FIT1015