Please note - Swinburne University of Technology

References
Electricity Council. Power System Proteaion. 2nd ed. Stwenage. U.K.:
Peregrinus, 1981
Flurscheim, C.H. Power Circuit Bmker Theory and Design. Stevenage:
Herts Peregrinus for the Institution of Electrical Engineers, 1975
Greenwood, A. Electrical Vansients in Pbwer Systems. NY.: Wiley-
Interscience, 1971
Stevenson. W.D. Elements of fower System Analysis. 4th ed, New
York: McGraw-Hill, 1982
EE598
Digital Systems and Control
No. of hours per week: two houn
Prerequisites: EE489 Control Systems, SM494
Engineering Mathematics
Instruction: lectures/tutorialsllaboratory
Assessment: examination/assignment
A final-year subject in all streams of the degree of Bachelor
of Engineering (Electrical).
Subject aims
To consolidate the work on systems and control in earlier
years by introducing sampling and discrete data in feedback
systems, the principles of process control and techniques of
computer based control including interfacing and data
acquisition.
Subject description
Design of control systems to meet a set of specifications.
Classical methods of lead-lag networks and PID controllers
from root locus and frequency domain approach.
Commercial packages and PLC's.
Algorithms suitable for compensation using computer based
control systems.
State variable feedback and design of continuous and
discrete time multivariable control systems to meet a set of
specifications.
Advanced topics of adaptive control and optimisation.
TextslReferences
Chase, F. Diagram Sets in Process Control and Computer Intedacing.
1989
Franklin, PaYell Workman. Digital Control of Dynamic Systems.
Addison-Wesley. 1990
Kuo, B. Digital Control Systems. Holt, Rinehart and Winston. 1980
Shinskey, F. Process Conhol Sysrems - Applicatmn Design and
Tuning. 3rd ed, McGraw-Hill. 1988
EE641 Fundamentals of Computing
No. of hours per week: four houn
Prerequisites: satisfactory completion of three
year
engineeringlscience degree or equivalent
industrial experience
Instruction: lecturellaboratory
Assessment: testsllaboratory exercises
A first-year subject in the Graduate Diploma in Computer
Systems Engineering.
Subject aims
To introduce the fundamental concepts of computing,
familiarity with PCs and some proficiency in the use of the
PASCAL language for constructing solutions to engineering
problems.
Subject description
Historical context of computing.
Binary numbers.
lntroduction to computer systems including PCs.
DOS operating system.
Turbo PASCAL program development environment.
Fundamental development of algorithms and structured
programming techniques.
Introduction to PASCAL
syntax diagrams
control structures
elementary and user-defined data types
procedure and functions with value and variable
parameters
identifier scope
arrays, strings, text files, sets and records.
Elementary inputloutput interfacing techniques using
PASCAL.
References
Horowitz, E. and Sahni, 5. Fundamentals of Data Structures in Turbo
Pascal. Rockville, MD: Computer Science Press, 1989
Koffman, E.B. Turbo Pascal: Pmblem Solving and Program Design. 3rd
ed, Reading, Mass.: Addison-Wesley, 1991
Leestrna, ST. and Nyhoff, L.R. Turbo Pascal - Programming and
Pmblem Solving. Macrnillan, 1990
Leestrna. SC. and Nyhoff, L.R. Advanced Pmgramming in Pascal with
Data Structures. New York, Macrnillan, 1989
EE642 Data Structures
No. of hours per week: four hours
Prerequisites: satisfactory completion of a three
year
engineeringlscience degree or equivalent
industrial experience
Instruction: lecturehutorialllaboratory
Assessment: testsllaboratory exercises
A first-year subject in the Graduate Diploma in Computer
Systems Engineering.
Subject aims
The aim of this subject is to develop a sound understanding
of: fundamental data structures and algorithms and their
manipulation; single-register and multiple-register
architectures and their addressing modes; mapping PASCAL
to assembly language and the assembly process; internal
representations of data and its manipulation including
floating-point and integer arithmetic.
Subject description
Data structures: PASCAL pointer types, lists, stacks, queues,
trees directed and undirected graphs and algorithms for the
manipulation of these structures, file types and
organisations.
Elementary computer organisation using PASCAL as the
descriptive lanquage: the Von-Neumann fetch-execute cycle.
simple single register architectures, their constraints and
evolution to multiple register architectures (immediate, direct,
register, register-indirect and indexed addressing modes).
PASCAL to assembly language mappings for a multipleregister
architecture. Informal treatment of parser
construction from a language's syntax using assembly
language as an example. The assembly process. The fetch,
decode and execution process for the multiple-register
machine.
Internal representation of data types. Integer and floatingpoint
arithmetic.
References
Egan, G.K. Introduction to Digital Computer Systems. Swinburne
Press, 1991
Koffman, E.B. Turbo Pascal: Problem Solving and Program Design. 3rd
ed, Reading, Mass.: Addison-Wesley, 1991
K06h, J.K. Data Structures, Algorithms and Program Style. Boston,
Mass.: WIlS Computer Science, 1986
Leestma, S.C. and Nyhoff, L.R. Advanced Programming in Pascal with
Data Structures. Macrnillan, 1990
Tenenbaum, A.M. and Augenstein, M.J. Data Structures Using Pascal.
Englewood Cliffs: N.J.: Prentice-Hall, 1981