https://ir.unisa.ac.za/handle/10500/24082 Wed, 06 May 2026 12:45:36 GMT 2026-05-06T12:45:36Z https://ir.unisa.ac.za/handle/10500/24105 A Comparison of Methods used to Represent Graphs on a Computer Sutcliffe, Geoff In general graph theorists have a limited knowledge of computers and computing, and are unaware of the possible variations of representation available, and in what circumstances which representation would be better. To assist in this regard a comparative study of currently used methods for representing graphs on a computer was made. The comparison was over four regions of interest, a) time efficiency, bl representation flexibility, c) space efficiency, d) language flexibility. The comparison was made for five classe·s of graph theoretic problems, a) graph creation, b) path finding, c) structure finding, d) graph traversal, e) graph analysis. A minimal set of graph operations for graph manipulation was also provided in the cour.se of the comparison. Tue, 01 Jan 1985 00:00:00 GMT https://ir.unisa.ac.za/handle/10500/24105 1985-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24103 A Consideration of Formalisms in Computing Short, R. Formalisms comprise the essential bricks and mortar that we need in order to construct information systems. Not surprisingly therefore the invention and refinement of formalisms has formed and continues to form a significant activity and interest throughout the length and breadth of the computing community from the academic researcher to the work-a-day analyst or programmer. In the light of their significance therefore it would seem to be a worthwhile exercise to endeavour to document something of the process of formalism creation, its motivators and objectives. Tue, 01 Jan 1985 00:00:00 GMT https://ir.unisa.ac.za/handle/10500/24103 1985-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24102 Tools for Creating Tools: Programming in Artificial Intelligence Machanick, Philip After a brief look at how the notion of the stored program is applied by programmers in the area of Artificial Intelligence (Al), we shall look at a specific Al tool: a production svstem. The discussion is at a non-rigorous level, intended to allow the concepts involved to be related to other fields more familiar to those in the mainstream of Computer Science, most notably, the field of Compiler Construction. Production systems are of particular interest because they are the basis on which rule-based expert systems are constructed. To complete the picture, future developments in tools for buiiding expert systems are considered. Tue, 01 Jan 1985 00:00:00 GMT https://ir.unisa.ac.za/handle/10500/24102 1985-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24100 Quo Vadis, Computer Science? MacGregor, K.J. The discipline of Computer Science has been established for almost twenty years. In SOUTH AFRICA, Computer Science Departments have been in existence for fifteen years, and producing graduates for twelve, however, the path ahead for Computer Science is really no clearer than it was in the early years. The different situation that exists in South Africa, and the pressure being exerted by the computing community, continues to cause doubts to be raised as to the relevance of Computer Science to the needs of the South African marketplace. This, in itself, is not of major concern if it is believed that the local computing community will mature into requiring the specialist knowledge for which a Computer Science course equips its graduates, however, this has not happened as yet and there is some doubt as to whether it will ever happen. As a result, perhaps, the time has come to consider whether Computer Science as a pure discipline, such as information processing should be taught as the norm in South African Universities with Computer Science relegated to a minor role. Tue, 01 Jan 1985 00:00:00 GMT https://ir.unisa.ac.za/handle/10500/24100 1985-01-01T00:00:00Z