Institutional Repository

Browsing Quaestiones Informaticae Vol 4 No 2 by Type "Article"

Browsing Quaestiones Informaticae Vol 4 No 2 by Type "Article"

Sort by: Order: Results:

  • Finding All Primes Less Than Some Maximum C.C.Handley University of Natal Durban4001 
    Handley, C.C. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    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 ...
  • New CS syllabuses at Natal (PMB) 
    Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    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 ...
  • A persistent programming language: preliminary Report 
    Berman, Sonia (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    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 ...
  • Some remarks on deleting a node from a binary tree 
    Aik-Koen, Heng (Computer Society of South Africa (on behalf of SAICSIT), 1986)
  • A summation problem 
    Aik-Koen, Heng (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    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.

Search UnisaIR


Browse

My Account