Generic competence (GC) development is an integral part of higher education to provide holistic education and enhance student career development. It also plays a critical role in complementing the curriculum. Many tertiary institutions provide various GC development activities (GCDA). Moreover, institutions strongly need to further understand…

The discrete mathematics topics of trees and computational complexity are implemented in a simple reliability program which illustrates the process advantages of the PASCAL programing language. The discussion focuses on the impact that reliability research can provide in assessment of the risks found in complex technological ventures. (Author/JJK)

Focuses on identifying the educational effects of "activity oriented" instructional techniques. Examines which instructional methods produce enhanced learning and comprehension. Discusses the problem of learning "sorting algorithms," a major topic in every Computer Science curriculum. Presents a low-tech, hands-on teaching method for sorting…

Presented is a method where a quadratic equation is solved and from its roots the eigenvalues and corresponding eigenvectors are determined immediately. Included are the proposition, the procedure, and comments. (KR)

Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)

Presents the algorithm to approximate square roots as reproduced from the 1579 edition of an algebra book by Rafael Bombelli. The sequence of activities illustrates that the process of understanding an original source of mathematics, first at the algorithmic level and then with respect to its mathematical validity in modern terms, can be an…

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)

This article, which is organized around a single, well-known algorithm for root extraction, presents a way of incorporating dynamical systems into the teaching of mathematics. Included are sample exercises using complex numbers and the computer where students have the opportunity to do some analysis on this algorithm. (KR)

Describes a model for training instructional designers who will work as members of videodisc development teams. This model develops and integrates competencies relating to instructional design, project management, interpersonal skills, storyboarding and flowcharting, programming, video production, and interactive video system knowledge. Three…

Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)

This unit is 1 of 12 developed for the university classroom portion of the Mathematics-Methods Program (MMP), created by the Indiana University Mathematics Education Development Center (MEDC) as an innovative program for the mathematics training of prospective elementary school teachers (PSTs). Each unit is written in an activity format that…