https://ir.unisa.ac.za/handle/10500/24121 2026-05-06T12:53:21Z 2026-05-06T12:53:21Z Postma, Stef W. https://ir.unisa.ac.za/handle/10500/24193 2018-06-01T01:00:56Z 1986-01-01T00:00:00Z

New CS syllabuses at Natal (PMB) Postma, Stef W. The Department of Computer Science of the Pietermaritzburg Campus of the University of Natal is one of the youngest departments in the country, although service courses to the Faculty of Commerce have been available for some years. In 1985 the department is teaching its second lot of third year students, and is preparing to offer an Honours course in 1986. Masters and doctoral students are catered for on an individual basis. As a result of the experiences gained over the last four years, a slight expansion in the academic staff complement, the fifth generation ferment, and the requirements of the Honours degree, it was felt that the syllabuses [UNIV-85] should be revised. This paper sets out the final results of the revision and attempts to justify some of the decisions reached. It should however be realised that the revision did not involve a change of course amidstreams, but, in many instances, only minor adjustments.

1986-01-01T00:00:00Z Handley, C.C. https://ir.unisa.ac.za/handle/10500/24135 2018-05-31T09:35:50Z 1986-01-01T00:00:00Z

Finding All Primes Less Than Some Maximum C.C.Handley University of Natal Durban4001 Handley, C.C. The problem of finding all prime numbers less than some specified maximum is frequently set as an exercise to beginning programmers, particular students doing their first programming course at University. Several different solutions to this problem are presented and tested. Experimentally derived timings are presented for these algorithms implemented in different languages. From these times, we can draw the conclusions that using only primes as divisors is not significantly faster than using all odd numbers, and that, in certain circumstances, FORTRAN programs may well take longer than equivalent Pascal programs.

1986-01-01T00:00:00Z Berman, Sonia https://ir.unisa.ac.za/handle/10500/24134 2018-05-31T09:36:44Z 1986-01-01T00:00:00Z

A persistent programming language: preliminary Report Berman, Sonia A persistent programming language PPL is currently being designed at the University of Cape Town. The language treats persistence (permanent storage) as an orthogonal property of data and is consistent in its treatment of persistent and transient data. The persistence of an object is the length of time the object exists. In traditional programming languages, data does not last longer than the execution of the program unless some storage agency such as a file or database is used. With persistent programming, data can continue to exist after programs have been run to completion, and the method of accessing the data is the same for both long and short term objects. The inclusion of semantic data modelling concepts [8] in a programming language is also being investigated in PPL. This paper describes the need for a persist.ent programming language and gives an overview of PPL.

1986-01-01T00:00:00Z Aik-Koen, Heng https://ir.unisa.ac.za/handle/10500/24133 2018-05-31T09:37:08Z 1986-01-01T00:00:00Z

A summation problem Aik-Koen, Heng This paper suggests a method to minimize the roundoff errors of adding N positive nimbers. The idea of construction can be easily applied to a linear recurrence process.

1986-01-01T00:00:00Z