Third Year Student Projects 2005/2006

  1. General applications:
  2. Teaching tools:
  3. Logic and automated reasoning:

Anybody who wants to propose an own project relating to the above topics should feel free to discuss them with me.

CLASSIFICATION: General Applications SH: Y, F CM: Y, F BM: Y, F

TITLE: Virtual Time-Clock


The aim of this project is to develop a tool that helps employees and managers keep track of the hours worked and the kinds of tasks performed. Such a tool would be useful for collecting information of time allocation and could be used, for example, to automate the completion of time-sheets for transparency review exercises of the Government.

CLASSIFICATION: General Applications SH: Y, F CM: Y, F BM: Y, F

TITLE: E-Class Register


This project will develop an computerised class register for deployment in schools. Teachers will be able to record the theme and activities of each lesson, the homework set, dates of tests and exams, and cautions of pupils. It will also help teachers to keep an attendance register. Pupils will be able to view infos of their lessons, their daily attendance, the dates of next class tests/exams. Parents will be able to have the same information about their children. Teachers will have access only to data relating to their lessons. Additional features might include the provision of support for managing assessment results, lesson timetables, etc.

CLASSIFICATION: General Applications SH: Y, UF CM: Y, UF BM: Y, UF

TITLE: Movie Review Editing and Publishing System


This project will develop a web content management system for editing and publishing systems of movie reviews. The systems is expected to provide the following functionalities:

  1. submission of reviews from authors anywhere in the world,
  2. editors are able to edit and approve reviews for publication via the world-wide web,
  3. database of movies including all relevant details and reviews,
  4. convenient online querying/search mechanisms,
  5. online scoring and/or voting functions,
  6. any other features as appropriate.

CLASSIFICATION: Teaching Tools SH: Y, C CM: Y, C BM: N

TITLE: Animation of algorithms

Supervisor: RenS

Animated versions of algorithms can improve the understanding of the working of an algorithm considerably. With the advent of the world wide web and the ability of the most common web browers to execute simple Java programs, it is now possible to make animated algorithms easily accessible to a wide audience, and animated algorithms have become a valuable aid in teaching. A large collection of animated algorithms implemented in Java for a range of basic algorithms used in Computer Science can already be found on the web, e.g.

The task of this project is to design and implement an animated version of a sufficiently complex algorithm chosen by the student (which is not already available on the web). Three suggestions for such algorithms are the following:

CLASSIFICATION: Formal Systems SH: Y, C CM: Y, C BM: N

TITLE: An Automated Reasoner for Propositional Logic


The aim of this project is to implement an automated reasoner for propositional logic (Boolean logic) which is based on a refinement of the resolution calculus. The basic resolution calculus is conceptually simple and consists of two inference rules which are applied to formulae in a certain simple normal form (clauses). A problem however is the proliferation of inferences performed in this calculus. This problem can be overcome by restricting the number of inferences that can be performed through two control parameters: an ordering and a selection function. The task is to implement an automated reasoner for propositional logic which is based on ordered resolution with selection which permits the interactive control of the parameters.

This `research' project would suit a student interested in logic and automated theorem proving.

REFERENCES: Kelly, J. J. (1997), "The Essence of Logic". The Essence of Computing Series, Prentice Hall.
Socher-Ambrosius, R. and Johann, P. (1997), Deduction Systems. Graduate Texts in Computer Science, Springer, New York.

COURSE PREREQUISITES: any course that taught propositional/Boolean logic

Renate A. Schmidt
Home | Publications | Tools | FM Group | School | Man Univ

Last modified: 16 Feb 05
Copyright © 2005 Renate A. Schmidt, School of Computer Science, Univ. Man.,