#### Filter Results:

#### Publication Year

1987

2012

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Recursion has traditionally been a difficult concept for students to understand, both as a control structure and as an analytical tool. This paper explores recursion using Prolog (whose predominate control structure is recursion) and through fractals which possess a visually recursive form. We discuss several simple Turbo Prolog programs which demonstrate… (More)

This paper discusses a non-traditional course in computer networking. The course is a laboratory course with substantial hands-on experiences, which can help to prepare students for jobs in industry as soon as they graduate from an undergraduate institution. This course is not meant to replace the traditional network course but to supplement it by teaching… (More)

Effects of operations on abstract data objects are often difficult for students to comprehend. Visual models can be helpful to students, when the connections among the data object models, virtual machine representations of data objects, and algorithms operating on the data objects are made clear to the students.
This paper discusses the design criteria used… (More)

This paper describes a set of author developed interactive web exercises and a development environment designed to facilitate language acquisition in a beginning course in C++. The exercises test the students' understanding of several C++ language constructs as well as general programming concepts such as scope of variables. The environment allows students… (More)

Throughout the history of computer science education there has been debate on what should be the appropriate mathematics background for computer science majors. The first computer science instructors were mathematicians and the first curriculums were just modifications of mathematics curriculums. However, as the discipline has grown and matured there has… (More)

The Wiener polynomial of a graph G is a generating function for the distance distribution dd(G) = (D 1 , D 2 ,. .. , D t), where D i is the number of unordered pairs of distinct vertices at distance i from one another and t is the diameter of G. We use the Wiener polynomial and several related generating functions to obtain generating functions for distance… (More)

- ‹
- 1
- ›