Search

Search Results

• Teaching reliability theory with the Computer Algebra System Maxima

  45-75

  Attila Csenki

  Views:

  23

  The use of the Computer Algebra System Maxima as a teaching aid in an MSc module in Reliability Theory is described here. Extracts from student handouts are used to show how the ideas in Reliability Theory are developed and how they are intertwined with their applications implemented in Maxima. Three themes from the lectures are used to illustrate this: (1) Normal Approximations, (2) Markov Modelling, (3) Laplace Transform Techniques.
  It is argued that Maxima is a good tool for the task, since: it is fairly easy to learn & use; it is well documented; it has extensive facilities; it is available for any operating system; and, finally, it can be freely downloaded from the Web. Maxima proves to be a useful tool even for Reliability research for certain tasks. This latter feature provides a seamless link from teaching to research – an important feature in postgraduate education.

• Difference lists in Prolog

  73-87

  Attila Csenki

  Views:

  23

  Prolog is taught at Bradford University within the two-semester module Symbolic and Declarative Computing/Artificial Intelligence. Second year undergraduate students are taught here the basics of the functional and the logic programming paradigms, the latter by using the Linux implementation of SWI Prolog [6]. The topic 'Difference lists' is mentioned in traditional textbooks such as [2] and [5] but it was felt that the available texts do not quite serve our purposes. We present here a lecture handout and a laboratory sheet for the teaching sessions on Difference lists. It is believed that the lectures and lab sessions together with the handouts shown here are a gentle, self-contained and reasoned introduction into the topic. The figures here shown to illustrate the concepts are considered a special feature of the handouts which in this form do not seem to be well known.