COMP SCI 3013NA - Event Driven Computing
Ngee Ann-Adelaide Education Centre - Trimester 2 - 2014
General Course Information
Course Code COMP SCI 3013NA Course Event Driven Computing Coordinating Unit School of Computer Science Term Trimester 2 Level Undergraduate Location/s Ngee Ann-Adelaide Education Centre Units 3 Course Description Event driven paradigm: Finite State Automata, their behaviour and implementation. Correspondence with regular expressions. Examples of embedded systems. Introduction to interconnected state machines, Petri Nets, and concurrency. Concepts of state-space and relationship to testing.
Building Graphical User Interfaces: model view controller paradigm. Building GUIs with the Java Swing library. Ease of use and human-computer interaction issues. Introduction to design patterns for managing complexity in large systems
Practical projects cover the use of FSAs for control logic and GUI design.
Course Coordinator: Mr David Knight
The full timetable of all activities for this course can be accessed from Course Planner.You can find the schedule of lecture topics on the course webpage:
Course Learning OutcomesThe course provides an introduction to finites state machines, and the event-driven programming paradigm.
Upon completion of this course you will be able to:
- Describe the different ways a finite-state machine can be represented;
- Explain how a finite state machine recognises an input string;
- Explain how a non-deterministic finite state machine works;
- Explain the behaviour of regular expressions;
- Translate a regular expression into a corresponding finite-state machine;
- Build GUI-based software systems;
- Explain a few basic design-patterns, and know when to apply them.
University Graduate Attributes
University Graduate Attribute Course Learning Outcome(s) Knowledge and understanding of the content and techniques of a chosen discipline at advanced levels that are internationally recognised. 1,2,3,4,5,7 The ability to locate, analyse, evaluate and synthesise information from a wide variety of sources in a planned and timely manner. 1,2,3,4,5,6,7 An ability to apply effective, creative and innovative solutions, both independently and cooperatively, to current and future problems. 1,2,3,4,5,6,7 A proficiency in the appropriate use of contemporary technologies. 6
Required ResourcesThere is no required text-book.
Comprehensive lecture notes are available for most parts of the course.
Recommended ResourcesYou can perform all the exercise work required for the course in the NgeeAnn computer Labs.
The programming language used is Java, which is similar to C++ (but with most of the disgustingness removed...)
However, if you want to be able to work at home, you could consider installing Java on your own computer.
For more information, go to the Java website --- simply Google "Java".
Online LearningYou can find the general information about this course at www.cs.adelaide.edu.au/~third/edc
Specific information about this year's offering can be found under the heading "current offerings" near the top of the page. Links to examples, exercises, and tutorials will be posted on the page.
Learning & Teaching Activities
Learning & Teaching ModesThe course will be taught intensively over two three-day sessions, with interleaved lecture/demonstration sessions.
There will also be tutorial classes, and practical exercises.
You are expected to attend the lectures and take part in the activities.
If equipment allows, lectures will be recorded, but things can go wrong --- equipment failure, lecturer failure, etc.
It is unwise to rely on the recording as your only source of the lectures.
WorkloadYou are expected to attend both intesive sessions (about 18 hours)
In between the session you will need to spend significant time consolidating your understanding of the material.
You will need to plan to allocate 60 or more hours for the exercise work.
This course is very demanding, but the results are very satisfying.
If you want to do well, we encourage you not to take another course during the same trimester as EDC.
Learning Activities SummaryThere is an approximate schedule of the topics that will be covered on the course website.
The exact timing will depend how the sessions go when I am with the class.
- Assessment must encourage and reinforce learning.
- Assessment must enable robust and fair judgements about student performance.
- Assessment must maintain academic standards.
Assessment SummaryThe assessment will comprise two parts:
Three programming exercises (10%+10%+10%); and
A final exam (70%).
Assessment Related RequirementsTo pass the course you must:
Score at least 40% for the final exam; AND
Score at least 40% for the practical exercises combined; AND
Score at leat 50% overall.
If you fail to achieve either of the 40% requirements, you mark will be capped at 44F (a fail).
Assessment DetailAll practical assignments require you to write programs, which will be marked by an automatic testing script.
You are strongly encouraged to begin the exercises early, to allow time for seeking help when needed.
You will find that the marking script is aggressively hostile --- it will seek to break your program.
To encourage you to test your own program, access to the tester will be limited to only three test runs.
The first test run will occur on the due date for the execise, and the subsequent two runs will be at about 4-day intervals afterwards.
The test script does not tell you exactly what is being tested, and may provide little or no information that is useful in finding errors.
If you submit your exercise at the last minute, and hope to use the automated tester to help you debug your program, you will be seriously disappointed.
You should build your program in small stages, and test it thoroughly.
The testing regime is like this because, you will most likely soon graduate, after which there will be no more automatic testers available --- you will need to learn how to test, and write you own testers.
No information currently available.
Grades for your performance in this course will be awarded in accordance with the following scheme:
M10 (Coursework Mark Scheme) Grade Mark Description FNS Fail No Submission F 1-49 Fail P 50-64 Pass C 65-74 Credit D 75-84 Distinction HD 85-100 High Distinction CN Continuing NFE No Formal Examination RP Result Pending
Further details of the grades/results can be obtained from Examinations.
Final results for this course will be made available through Access Adelaide.
You can find the latest SELT survey results on the course website, here:
- Academic Support with Maths
- Academic Support with writing and speaking skills
- Student Life Counselling Support - Personal counselling for issues affecting study
- International Student Support
- AUU Student Care - Advocacy, confidential counselling, welfare support and advice
- Students with a Disability - Alternative academic arrangements
- Reasonable Adjustments to Teaching & Assessment for Students with a Disability Policy
Policies & Guidelines
- Academic Credit Arrangement Policy
- Academic Honesty Policy
- Academic Progress by Coursework Students Policy
- Assessment for Coursework Programs
- Copyright Compliance Policy
- Coursework Academic Programs Policy
- Elder Conservatorium of Music Noise Management Plan
- Intellectual Property Policy
- IT Acceptable Use and Security Policy
- Modified Arrangements for Coursework Assessment
- Student Experience of Learning and Teaching Policy
- Student Grievance Resolution Process