In course design, topic outline organization encompasses the structuring and sequencing of topics to be delivered in a learning environment. Recent studies in topic outline optimization revolve around massive open online courses (MOOCs) due to their abundance but not much has been studied on the traditional courses. This study investigates the…

This thesis addresses problems from two areas of theoretical computer science. The first area is that of computational learning theory, which is the study of the phenomenon of concept learning using formal mathematical models. The goal of computational learning theory is to investigate learning in a rigorous manner through the use of techniques…

This material contains two units which view applications of computer science. The first of these examines Horner's scheme; and is designed to instruct the user on how to apply both this scheme and related algorithms. The second unit aims for student understanding of standard bisection, secant, and Newton methods of root finding and appreciation of…

A description is provided of a computer system designed to aid in the analysis of student programing work. The first section of the report consists of an overview and user's guide. In it, the system input is described in terms of a "dribble file" which records all student inputs generated; also an introduction is given to the aids…

Built-in data structures are the registers and memory words where binary values are stored; hard-wired algorithms are the fixed rules, embodied in electronic logic circuits, by which stored data are interpreted as instructions to be executed. Various topics related to these two basic elements of every computer program are discussed. (JN)

Unlike most program assessment systems, Program Assessment using Specified Solutions (PASS), evaluates student C programs by assessing the way a problem was solved by performing a comparison of the submitted program with a solution plan. This article describes PASS, its use of instructor specified solution plans, assessment and feedback systems,…

Based on a computer-science course, this article outlines an alternative ordering of programming concepts that aims to develop a reuse habit before other styles of programming are developed. Although the discussion is based on transition from Modula-2 to C++, the issues raised apply to transition from any procedural to any object-oriented…

The use of statistical methods in the design and analysis of discrete algorithms is explored. The introductory chapter contains a literature survey and background material on probability theory. In Chapter 2, probabilistic approximation algorithms are discussed with the goal of exposing and correcting some oversights in previous work. Chapter 3…

Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)

Computer science education for the liberal arts student has both a practical value (creating an intelligent consumer) and an appreciative value (teaching algorithmic thinking). A computer literacy course can be structured to harmonize with the aims of liberal education. (SK)

Discussion of how to teach programming skills to novice programmers focuses on the use of a program animator that uses a copies model of recursion to teach the recursive function. Various mental models are reviewed; testing the recursion animator is described; and possibilities for further research are suggested. (12 references) (LRW)

Describes "Josef," a robot programing language similar to the LOGO turtle language, which has been designed as an instructional system through which the algorithmic problem-solving skills required in computer programing can be developed and tested in a controlled learning environment. Four figures and a reference list are included. (JL)

When problems defy solution, mathematicians can settle for "almost." This branch of mathematics (called computational complexity) encompasses both the number of parts involved in a problem and the intricacy of their interrelatedness. Current research in this area is discussed, considering various computer applications involved. (JN)

A detailed analysis and computer-based solution to a puzzle addressing the arrangement of dominoes on a grid is presented. The problem is one used in a college-level data structures or algorithms course. The solution uses backtracking to generate all possible answers. Details of the use of backtracking and techniques for mapping abstract problems…

Explains a proposed block of instruction that would give students in industrial engineering, operations research, systems engineering, and applied mathematics the basic understanding required to begin more advanced courses in simulation theory or applications. (DDR)