PC with a Java environment

One hour lecture, one hour tutorial/practical and one hour surgery per week.
Formal lectures to introduce basic ideas and worked examples.
Tutorials to modify and adapt lecture examples to solve similar problems.

1. Describe and use algorithms for searching and sorting, and to process data structures
2. Describe and use data structures, their implementation and their access functions
3. Suggest how to improve upon the efficiency of algorithms
4. Design and implement algorithms

AND BE ASSESSED IN THE FOLLOWING COMMON SKILL COMPETENCIES

a. 8. Receive and respond to a variety of information
b. 13. Deal with a combination of routine and non-routine tasks.

- Design of algorithms
- Use of pseudo-code and structure diagrams
- Considerations of efficiency
- Sorting techniques
- Searching techniques
- Comparison of linear and binary searching
- Use of Arrays
- Implementation of linked lists, stacks, queues and their access functions .

A ASSIGNMENT weighted at 50%.
A EXAMINATION - UNSEEN IN EXAMINATION CONDITIONS length 2 HOUR(S) weighted at 50%.
@

Coursework (50%) to implement an algorithm, evaluate its efficiency, suggest how to improve its efficiency and implement an improved algorithm (Learning outcomes 3, 4, a)
An examination (50%) (Learning outcomes 1-3, a, b)

Java by Dissection. Kelley et al, Addison-Wesley (2000)
Understanding Algorithms, Brunskill and Turner, McGraw-Hill (1996)