#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1987

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Bruce S. Elenbogen, Martha R. O'Kennon
- SIGCSE
- 1988

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)

- Bruce S. Elenbogen
- SIGCSE
- 1999

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)

- Bruce R. Maxim, Bruce S. Elenbogen
- SIGCSE
- 1987

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)

- Bruce S. Elenbogen, John Frederick Fink
- Discrete Applied Mathematics
- 2007

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)

- Bruce S. Elenbogen, John E. Laird, +4 authors Steven L. Tanimoto
- SIGCSE
- 2002

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)

- Bruce S. Elenbogen, Bruce R. Maxim, Chris McDonald
- SIGCSE
- 2000

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)

- Bruce S. Elenbogen, John Frederick Fink
- I. J. Comput. Appl.
- 2012

- Hasina Abdu, S. Nawaz, Bruce S. Elenbogen
- Proceedings. Tenth International Conference on…
- 2004

The increasing presence of mobile and ubiquitous applications has created a need for distributed systems and applications that are dynamic and can efficiently adapt to changes in quality of service (QoS), resource availability, user requirements and location of mobile nodes. This is done by dynamically reconfiguring system components. Reconfiguration should… (More)

- Bruce S. Elenbogen, John Frederick Fink
- Electronic Notes in Discrete Mathematics
- 2002

- B. Elenbogen
- 2001

Interactive linear algebra laboratories at UM-D have the innovative feature that the presentation of each laboratory's focus topic spirals through three levels of increasingly sophistication: (1) basic, (2) realistic, (3) advanced. This increasing-levels-of-maturity approach provides students with the bridge to real-world application. It also allows the… (More)