This paper is presented in satisfaction of the requirement for two problems in lieu of thesis which are required for the degree, Master of Science. The two problems are: (1) to provide an electric interface between the M6800 microprocessor and the printer; and (2) to design an Arabic character set and to provide the logic required for its implementation. As it would be artificial and impractical to document these problems separately, a single document here is provided.

The purpose of telecommunication network configuration optimization is to find the best homing relationship between tandems and switches so as to minimize interswitch traffic, or equivalently to maximize intraswitch traffic. Note that, since minimal interswitch traffic implies minimal IMT utilization, communication costs will also be minimal.

In this paper the DBase II query language of an RDBMS for personal computers is discussed. Other languages will be provided by large and sophisticated DBMS will not be discussed here. The reason for selecting the DBase II query language for discussion are as follows: 1. It is a simple language that can be learned easily [TOWN 84, DINE 84]. Within a short period, users can learn all of the facilities and manage the system very well. 2. It is a language suitable for interactive programming and execution like BASIC. 3. It provides adequate facilities for a small data base system and serves as an introductory guide for more sophisticated systems.

This paper describes multitasking facilities of Ada in concurrent and real-time programming. Synchronization and process communication mechanisms are discussed in detail, also, a new mechanism to solve the scheduling problem is developed. In the concurrent programming aspect, a comparison is made between Ada's rendezvous and Pascal's Monitor concept. In the real-time programming aspect, the differences between the Ada multitasking and the traditional "cyclic executive approaches are contrasted and their associated costs/benefits analyzed.

No matter how extended the use of the computer is, the printed document is still the primary medium for the presentation information, and will continue to be for some time. The use of computing facilities for preparation and production of the document is becoming as prevalent as their use for numeric computation. Commercially, document preparation systems are now a standard facility at research institution, and they have become quite common on each computer program. A conventional document preparation system usually contains two parts: a text editor used to create, enter, update, and maintain the text and control words that comprise the document in its "input" form, and a text formatter used to process that input and produce the final document.

This problem is intended to be an introduction to the design of a software system which translates PDP-8 assembly language source into it's machine-readable object code. This assembler runs on the IBM 360/50. It is assumed that the reader is familiar with the basic PDP-8 assembly language. For the description and use of this assembler the reader is referred to the PAL-III SYMBOLIC ASSEMBLER PROGRAMMING MANUAL from DEC (order number DIGITAL 8-3-5, Digital Equipment Corporation: Maynard, Massachusetts, 1965.). The Second problem of the study concerns the design of a simulator for the PDP-8 computer.

This is a report concerning the project I completed for my 590 (special problem) credit. The subject of this project was a system for interactive practice room scheduling by music students at NTSU. This system was created in the fall semester of 1982 as a class project for software Development (CSCI 553) with Dr. Irby. The system was not completely finished, and I received permission from Dr. Irby to finish it and help implement its use at the Music department. I was able to observe three usages of the system: Spring, Summer I, and Summer II semesters of 1983. This report details the problems encountered during each of these usages, and changes made to the system due to them. Results of a first-use survey, under documentation, and complete final code listings were also included.

In this paper, five different sorting methods will be discussed. Each method will be analyzed and discussed in detail pointing out its efficiency, weaknesses, powerfullness, and the appropriate type of applications. The different methods are represented graphically using Turbo Pascal where one pass is performed in each method at a time. The methods discussed in this project are, Bubble Sort, Quick Sort, Heap Sort, Shell Sort, and Double Selection Sort. The latter is a new method that I modified from the Selection Sort. Finally, comparisons between the sorting methods mentioned above will be discussed.