Quaestiones Informaticae Vol 1 No 2https://hdl.handle.net/10500/239702024-03-28T17:22:49Z2024-03-28T17:22:49ZDesign Principles of the Language BPLWilliams, M.H.https://hdl.handle.net/10500/239872018-05-22T01:00:54Z1979-01-01T00:00:00ZDesign Principles of the Language BPL
Williams, M.H.
BASIC and Pascal are two rather different programming languages, both of which have proved to be very popular. A new language BPL has
been designed as an interactive programming language based on these two languages, combining advantages of each. This paper discusses
some of the criteria used in the design of the language.
1979-01-01T00:00:00ZThe Management of Operating System State DataTurton, Trevorhttps://hdl.handle.net/10500/239862018-05-22T01:00:54Z1979-01-01T00:00:00ZThe Management of Operating System State Data
Turton, Trevor
A new approach is proposed for the management of operating system state data. Relational database concepts are suggested for the analysis
and organization of this data, and a common central service routine is described which could manage all shared state data. This central
routine is based on the techniques currently employed by database management systems.
1979-01-01T00:00:00ZAn Algorithm for Merging Disk Files in PlaceRoets, P. P.https://hdl.handle.net/10500/239852018-05-22T01:00:51Z1979-01-01T00:00:00ZAn Algorithm for Merging Disk Files in Place
Roets, P. P.
An algorithm is presented for sorting a random access file in place. The algorithm is unique in the sense that no auxiliary storage, apart from a
number of buffers in the machine's high-speed memory, is required. In addition, the algorithm makes active use of the random access
capabilities of rotating magnetic media and cannot be converted to operate on sequential files. The run time is known to be of 0( n log n) under
certain circumstances. An example also shows that this run time can deteriorate to 0( n* ), which is probably also the worst-case run time.
1979-01-01T00:00:00ZDie Toepaslikheid van 'n Analitiese Model by die Keuse van 'n Leerstruktuur vir 'n TeksverwerkingstelselPenzhorn, A.https://hdl.handle.net/10500/239842018-06-19T10:49:56Z1979-01-01T00:00:00ZDie Toepaslikheid van 'n Analitiese Model by die Keuse van 'n Leerstruktuur vir 'n Teksverwerkingstelsel
Penzhorn, A.
Die keuse van 'n geskikte leerorganisasie vir 'n rekenaarstelsel is nie altyd eenvoudig en voor die hand liggend nie. In die geval onder
bespreking moet 'n geskikte leerorganisasie gekies word vir 'n teksverwerkingstelsel wat die gebruik van 'n intelligente eindpunt met
sekondere stoorvermoe insluit Groot blokke teks kan na redigering per direkte koppeling na 'n minirekenaar gestuur word vir berging,
paginering, formatering en latere berwinning. Die oogmerk is dus die keuse van 'n doeltreffende leerstruktuur vir die berging en verwerking
van die teks op sekondere gebeue. Om die keuse te vergemaklik, is analitiese modelle ontwikkei o.a. deur Yao. Sy model word, met die oog
op die toepaslikheid daarvan, bespreek
1979-01-01T00:00:00Z