A non-machine specific design of an algorithm teacher is proposed. It is a programmed environment to help students in a beginning computer science course learn problem solving skills. This paper provides an overview of the problem, a motivation and justification, followed by a brief description of what the program should provide the student.

ABSTFACT Many collegesand universities offer an introductory computer science course based on a specific programming language.The Department of Computer Science at the

article Free Access Share on Implementing a joint program between two campuses: University of Kansas and Johnson County Community College Author: William G. Bulgren Computer Science Department, University of Kansas, Lawrence, Kansas Computer Science Department, University of Kansas, Lawrence, KansasView Profile Authors Info & Claims ACM SIGCSE BulletinVolume 17Issue 1Mar. 1985 pp 302–305https://doi.org/10.1145/323275.323395Online:01 March 1985Publication History 2citation139DownloadsMetricsTotal Citations2Total Downloads139Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Many colleges and universities offer an introductory computer science course based on a specific programming language. The Department of Computer Science at the University of Kansas has recently reorganized its introductory computer science course to include such topics as algorithms, top-down algorithmic design, elementary programming techniques, and introduction to time-sharing. Besides the discussion of this transition, the paper discusses a questionaire that was developed and utilized during this transition. It is hoped that others will benefit from our experiences.

The steady-state joint probability distribution of queue lengths is obtained for queuing networks with Poisson arrivals m which some of the service-tune dlstnbunon funcuons are general (e g, not even differenuable).In particular, an analytical model for queuing networks which is more general than those considered to date is produced by using the concept of generalized function Previous results on the relationships between the properties of queuing discipline, product form, and local balance can be shown to hold m this more general setting.

A serious problem facing Computer Science educators is deciding what type of computer resource(s) needs to exist in order to serve Computer Science students. Should these resources include Time-Sharing, micro-processors, one large dedicated computer, and so forth? What are colleges and universities doing to attack this question? A panel of faculty from several colleges and universities of Computer Science education will present views and insights. There will be time for questions and answers from the audience.