© 1995 .. 2003 - Peter Whitehouse
Brisbane, Australia

IS1 | IS2 | IS3 | IS4,AI1 || CS1 | AP1 | AP2 | AP3
Assessment Items | Profile | Sample Profile Spreadsheet | Work Program

Course Outline - 1999 Work Program

[IS1] Term 1: Introduction to Relational Database Languages

SQL overview, structure, interfaces, Relational Model of Data, table characteristics, Data Types. Database Maintenance, table/database creation and destruction, table instantiation, Views, aliases, Indexes, Keys, SET and FORMAT commands. Single Table Queries using SELECT - projections, selections (including equality, DISTINCT, NOT, OR, AND, LIKE, BETWEEN and NULL. Derivation functions including COUNT, SUM, AVG, MIN and MAX, Grouping (including GROUP BY and HAVING)

[IS2] Term 2: Relational Database Manipulation

Set oriented operations including UNION, intersection, IN, ANY and ALL, Multiple Table Operations - cross products, Joins (including Natural inner, cross, outer left), join conditions and filter clauses, Sub-Queries, self-joins, more complex HAVING clauses. Correlated sub-queries compared with joins, efficiency and query optimization, Existential and Universal quantification Limitations to the relational model, Query By Example (QBE) using Microsoft Access, stored queries, forms and Event-driven application development using Access. Form design and on-line help definition. Scripting languages and PHP/MySQL live to web.

[IS3] Term 3: Information System Design

Overview - the first through fifth generations of hardware, software and database management systems. Data independence and representation. Redundancy, ad-hoc queries, performance, optimization, cost effectiveness, security, integrity. The software development cycle (inc. discussion of:

• Specification:languages (e.g Z)
• Design: data modelling Entity-Relationship Modelling vs Conceptual Schema Diagrams, C.A.S.E.
• Implementation : development systems, 4GLs, C.A.S.E.
• Testing : correctness proofs, debugging strategies
• Maintenance : perfective, corrective, adaptive

Elementary Fact Types, linguistic structure, properties and relations, predicates, reference schemes. Conceptual Schema Design Procedure (CSDP): Convert Examples into elementary facts, eliminate surplus entities and duplicate roles and identify derived facts, add uniqueness constraints, rationalise fact type arity, add mandatory role and occurrence frequency constraints and subtypes, add equality, exclusion and subset constraints, and perform quality checks.

[IS4,AI1] Term 4: Information System Development/Artificial Intelligence

Conceptual to relational transformation via. the Optimal Normal Form (ONF) algorithm, controlled redundancy to balance number of tables against presence of NULLS. Primary, Secondary and Foreign Keys Application development from Conceptual model to working prototype A basis for the fifth generation, the three schema architecture, CIP operation and typical 5GIS interactions. Philosophical models of intelligence. Basic structure of a PROLOG program, predicate structure, facts, derivation and inference rules. Recursive inferences. Mapping between conceptual schemata and Prolog. Expert systems - characteristics and comparisons with a conventional DBMS. Construction of a simple expert system shell from a decision tree. AI applications

[CS1] Term 5: Computer Systems

Number Systems, Information Fundamentals, ASCII, Parity, Control Codes, Architectures, Serial vs Parallel Data transmission, (A)Synchronous, Protocols and Modems. Bit-Oriented Operations (AND, OR and NOT), Setting, querying and clearing Bits using Masks. Computer Operation, RAM, ROM, memory referencing schemes, CPU operation, Keyboards, Monitors (characteristics and organisation), Computer Graphics, Printers, Disks (types, and organisation). Systems, Networks (Terminology, Topology, operation), examples of networks and the Internet. Operating Systems and Operating Environments, Components and functions, comparisons with Unix/Linux

[AP1] Term 6: Introduction To Algorithmic Languages

Algorithm design, including diagrammatic form of algorithm development, Formalisation and complete specification of problems, C.A.S.E. with DELTA, Pascal/Delphi program organisation, CRT/Console Applications in Delphi. Use of Comments and other forms of documentation, Conventional Setout, Syntax, Scalar Data Types, Unary and Binary operations available for Scalar types, Pascal Expression and Statement formation, Input and Output, Selection (including IF..THEN..ELSE and CASE)

[AP2] Term 7: Control Structures in Algorithmic Languages

Iteration (including REPEAT, WHILE and FOR, along with reasons for choosing one form of iteration over another) Constants, subranges and User Enumerated Types, Procedures and Functions (including Local/Global variables and Scope rules), Data flow through sub-programs, Recursion. Modular Programming, step-wise refinement, Units, Utilities and toolboxes

[AP3] Term 8: Abstract Datatypes in Algorithmic Languages

Set theory, Sets in Pascal, set applications. Arrays, including strings, vectors and multi-dimensional arrays, referencing schemes, string manipulation. Records, representation, access and manipulation of data within record structures, Tables. Files - both random access and Text files for use as storage 'organs' for programs. Sorting, selecting and Parsing data stored in compound data structures - alternative algorithms and efficiency.

CS1: Computer Systems - summative - (Part A) - Due: in the block starting 14th March, 2005 [block testing].

AP1f: Introduction to Algorithmic Languages - formative - Due: in the week beginning 6th June, 2005 [block testing].

AP2: Algorithmic Control Structures - summative - Due: in the block starting 26th August, 2005 [block testing].

AP3: Abstract Data Structures - summative - Due: in block starting 14th November, 2005 [block testing].

Assignments

AI - minor: Artificial Intelligence - Due: Friday 11th March, 2005..

SE2 - minor: Social and Ethical - Guided Research, Extended Writing Task - Due: Monday 6th June, 2005.

AP - major: Algorithms ans Programming Case Study - Proposal Due: 3rd October, 2005; Algorithms Due: 24th October, 2005; System and Manual Due: 7th November, 2005.

Diagnostic tests

regularly (1 days notice) 80%=pass, poor results reported to parents.

Results (both summative and formative) are recorded on your assessment profile as percentages as follows:

Each SUMMATIVE assessment item contributes to your CULMULATIVE mark in each of ALPHA and BETA.

A SAMPLE PROFILE is available as an excel spreadsheet for you to explore. You are encouraged to enter your own marks into the profile copy and investigate the effects of varying performance on items yet to be completed.

Performance standards are applied to cumulative percentages for ALPHA and BETA separately, and the performance composite determines the exit rating. A schedule of minimum performance composites is given below:

Notice that standards for ALPHA range from S1..S5, whereas there are only 4 standard levels in BETA. An S1 standard at EXIT corresponds to an EXIT LEVEL of VHA for that dimension.

These cutoffs are applied to cumulative achievement to determine your EXIT rating and may vary at the professional discretion of the Faculty Head in consultation with the QSA.

The BETA mark determines the MAXIMUM rating that can be attained by a student, with ALPHA needing to correspond to at least that standard, else the LOWER of the two is chosen. A successful student in IPT must not only be able to recall facts and methods, but must also be able to demonstrate the ability to apply their knowledge to unfamiliar situations. Tradeoffs between alpha and beta are specifically prohibited by the syllabus.

On your profile, the PROGRESS GRAPH to the right indicates the trend your marks are making towards your EXIT rating for each of the dimensions (alpha and beta), the cutoffs have been included for your reference.