Courses / Module

On successful completion of the module, students should be able to:

• Describe the phases of program translation from source code to executable code and the files produced by these phases
• Recognise the underlying formal models such as finite state automata, push-down automata and their connection to language definition through regular expressions and grammars
• Explain the benefits of intermediate languages in the compilation process
• Describe the steps and algorithms used in code generation
• Describe how the computer system uses activation records to manage program modules and their data
• Describe approaches to object lifetime management (e.g. garbage collection) and evaluate tradeoffs between different strategies

Delivery methods	Hours
Lectures	24
Labs / Practicals	24
Tutorials	0
Planned learning activities	0
Independent student activities	77
Total	125

• Module Graded (numeric value) or Ungraded (Pass/Not Passed): Graded
• Continuous Assessment detail(s): Continuous Assessment up to 50%.

Assessment type	Options	Weighting	Duration
Continuous Assessment		50%
University scheduled written examination	On-campus	50%	120 minutes
Other		0%
Total		100%	120 minutes

• Pass standard: 40%
• Could the result of this module be capped? No

• Are supplemental/resit registrations permitted? Yes
• University scheduled written examination (Autumn): 120 minutes, On-campus

• CS210 and CS211 or equivalent.

 Compilers Principles, Techniques and Tools by Alfred V. Aho, Ravi Sethi, Jeffrey D.Ullman (also known as the dragon book)Introduction to Theory of Computation by Michael Sipser 

For a full timetable search, go to NUIM Timetable. Venue locations can be found here.