Institutional Repository

Browsing Quaestiones Informaticae (QI) by Author "Schach, Stephen R."

Browsing Quaestiones Informaticae (QI) by Author "Schach, Stephen R."

Sort by: Order: Results:

  • Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    Three levels of traces for data structures (as opposed to simple variables) are defined. A machine-code core dump is essentially a low level trace. A high level trace reflects the high level language in which the data ...
  • Becker, Ronald I; Perl, Yehoshua; Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    An implementation of an algorithm for finding a min-max partition of a weighted tree T with n vertices into q subtrees by means of k = q-1 cuts is presented. The implementation is shown to have asymptotic complexity ...
  • Hirsch, Michael; Schach, Stephen R.; Van Biljon, Willem R. (Computer Society of South Africa (on behalf of SAICSIT), 1985)
    Two approaches to high-level debugging systems for Pascal are compared, namely the use of a debugging precompiler as against a debugging interpreter. A description is given of a high-level Pascal debugging interpreter ...
  • Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    Details are given of an implementation of Grimbleby's algorithm for the common spanning tree problem with running times up to 50% less than for the original implementation. An explanation is given as to why implementations ...
  • Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    data structure and its computer implementation. However, in the course of debugging a program written in a high-level language, the user is sometimes forced to try to understand the low-level implementation of his data ...

Search UnisaIR


Browse

My Account