Materials for Info1008

This is a presentation introducing students to algorithmic concepts such as sequencing, pseudocode and modularity. It includes a class exercise to define the algorithm to make a cup of tea.

This is a presentation introducing students to the idea of Algorithms. It is intended for students who are technical, but are not Computer Science students. The presentation covers definitions, characteristics, complexity and some simple examples.

These slides describe how control structures (if/else and loops) are used within algorithms. It includes a description of conditionals (>, ==, etc.) and logic (AND, OR, etc).

This presentation explains how we move from a problem definition to an algorithmic solution using simple tools like noun verb analysis. It also looks at how we might judge the quality of a solution through coupling, cohesion and generalisation.

This presentation gives a high level introduction to modelling in software engineering. It looks in detail at how to model behaviour, in particular using UML Activity Diagrams.

This is a presentation for our year one INFO1008 course of Computational Systems. It covers the need for requirements capture and the difficulty of building a specification based on user information. We present UML Use Cases and Use Case diagrams as a way of capturing requirements from the users point of view in a semi-structured way.