Investigating the Effectiveness of Active Interaction Tools on Student Learning

In this project, we investigate the effectiveness of active interaction animation tools for learning. We limit our scope to a particular computer science course that teaches graph algorithms on an undergraduate level. More specifically, we evaluate student understanding of basic graph algorithms when two kinds of interactive animation tools are used by the students to learn the algorithms: active interaction and passive interaction. We hypothesize that animations which engage students in active interaction are more effective and more beneficial to learning and comprehension than the animations which do not explicitly engage students in active interaction. We conduct an experiment and study the effects of these two kinds of interactive animation on learning effectiveness

OPTIMISATION TECHNIQUES FOR TELECOMMUNICATION NETWORKS

This thesis deals with various facets of the optimisation problem for telecommunication networks and proposes a number of new techniques for their solution. The necessary essentials, Graph Theory, Complexity Theory and Telecommunication Principles, are investigated. The relevant graphs are enumerated and the requirements of suitable optimisation algorithms for certain graphical problems are established. The Private Automatic Branch Exchange (PABX) is introduced. the variety of telecommunications traffic as well as the practical requirements of a connection topology are discussed. The fundamental Network Optimisation Problem (NJP) is defined and analysed. Simple exhaustive methods of solution are considered together with partial solution algorithms and simplification methods. Centralised networks with and without concentrators are introduced. Extensions and modifications are proposed for some techniques and existing practical methods of dealing with the NOP are investigated. A number of new ideas are proposed for the practical solution of the NOP. Reduction methods are presented for replacing large unmanageable networks with smaller ones, on which optimisation can take place. Fixed topology techniques are introduced for initial tandem switch selection purposes and perturbation methods are considered which can be applied to such an initial solution. Lookahead methods of link removal are introduced for the purposes of determining the tandem interconnection network together with the traffic routeing strategy. A composite method is proposed incorporating all of these concepts and the results of a number of numerical experiments upon actual network problem; are presented. the extension of the proposed techniques to other areas of problem solving and optimisation is considered. In particular, a new method for the solution of the Euclidean Travelling Salesman Problem (ETSP) is presented. A brief discussion is undertaken, in conclusion, concerning the practical difficulties of the NOP and The restrictions this placed upon solution algorithms of various types.Brit1sh Telecom, Ta1lis Consultancy, Londo