Institutional Repository

Browsing Quaestiones Informaticae Vol 2 No 1 by Issue Date

Browsing Quaestiones Informaticae Vol 2 No 1 by Issue Date

Sort by: Order: Results:

  • The Design and Microprogrammed Implementation of a Structured Language Machine 
    Finnie, G.R. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    A computer architecture is described which is suitable for the execution of structured languages (such as Pascal or Algol) at the intermediate language level. The design is heavily stack oriented and consists basically ...
  • A CSP Description of some Parallel Sorting Algorithms 
    Linck, M. H. (Linck, M.H. (1982) A CSP Description of some Parallel Sorting Algorithms,. Computer Society of South Africa (on behalf of SAICSIT), 1982)
    Hoare's CSP notation is used to describe 3 parallel sorting algorithms. The first algorithm uses n/2 processes working in parallel, the second uses an array of n parallel processes and the third algorithm is a parallel ...
  • The Relative Merits of Two Organisational Behaviour Models for Structuring a Management Information System 
    Pirow, Peter (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    The basic 'model' usually applied to the structure of MIS is that of Anthony. This paper investigates the use of the Paterson model as an alternative. This is approached from the theoretical standpoint, and reference is ...
  • The Design Objectives of Quadlisp 
    Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    Quadlisp is a symbol manipulation language for sophisticated users, and it is an improper extension of Lisp 1.5 (in the same sense that Pascal is an improper extension of Algol). Elements from Lisp thus are basic to the ...
  • An Efficient Implementation of an Algorithm for Min-Max Tree Partitioning 
    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 ...
  • An Interactive Graphical Array Trace 
    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 ...
  • Micro-Code Implementation of Language Interpreters 
    Roets, P. P. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    An evaluation is made of the improvement of language interpreters by coding recurring sequences of instructions in micro-code. The results of an experiment with PASCAL indicate that the increase in speed expected may not ...

Search UnisaIR


Browse

My Account