The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. Even the backtracking implementation supports a rather powerful bounding function. An earlier article discussed the ...

We continue our study, begun in [3], of the classical/linear Towers of Hanoi "hybrid" problem, in which there are three pegs arranged in a row, and the rules governing ring movement depend on ring color. Whereas [3] dealt with perfect to perfect ...

Abstraction is an important part of mathematics and computer science, and it is a common stumbling point for students learning how to write mathematical proofs. This article outlines simple strategies for making mathematical proof less abstract in the ...

This paper is primarily about introducing students to research. Specifically, we present a method where students get to redo the simulations behind a few of the most cited research papers in complex networks. We also outline the design of a course that ...

The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. Even the backtracking implementation supports a rather powerful bounding function. Since the processing of permutation ...

We describe our experience in creating and teaching a graduate course in cryptography at the Johns Hopkins University. We emphasize on the importance of such a course for a graduate student in an information security program. We discuss the course ...

We investigate the effectiveness of a predictive interaction animation tool for understanding graph algorithms. We compare performance improvement of students after they have used two different animation tools for the given algorithms, when one of the ...

In this paper we show how an engaging problem can be used in both a discrete mathematics course and a programming course as a way to expose students to multiple methods of inquiry and to strengthen the links between the two courses. Since students ...

The most commonly stated definition of abstract data type (ADT) is that it is a domain of values and the operations over that domain. So, for example, a language's built-in types, like int are seen to be ADTs. It is our opinion that a pure ...

The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion presented in the May 2005 issue of Dr. Dobb's Journal [1], specifically taking the ...

We propose another simple Towers of Hanoi variant, a hybrid between classical Hanoi and linear Hanoi, in which the rules governing movement depend on ring color. An optimal algorithm is presented. The problem and its heavily recursive solution are not ...

This paper proposes the use of several classes of simple combinatorial problems that share the same solution for teaching problem equivalence and recursion. Our focus is on counting problems that involve Fibonacci numbers. While these problems have ...

Recursion is an important topic in computer science curricula. It is related to the acquisition of competences regarding problem decomposition, functional abstraction and the concept of induction. In comparison with direct recursion, mutual recursion is ...

This uses a massively wrong-headed algorithm for sorting to exemplify the use of the backtracking strategy and the branch-and-bound strategy. In addition, brief notes are included on parallel processing approaches: Java theads on multi-core computers ...

The current issue's new challenge is slightly different from previous challenges. It involves two questions, of whether particular goals may be achieved. If they may be achieved, then a suitable algorithm should be developed and justified; otherwise -a ...

The 0/1 knapsack (or knapsack without repetition) has a dynamic programming solution driven by a table in which each item is consecutively considered. The problem can also be approached by generating a table in which the optimal knapsack for each ...

We propose a simple new variation of the Towers of Hanoi problem, in which there are three pegs arranged in a row and there are two stacks (black, white) of n rings each, initially located on the end pegs. The object is to exchange the stacks in ...

This paper addresses the relationship between recursion and combinatorial problems, which may benefit teaching recursion in CS1/2 courses. Problems whose solutions are related to Fibonacci numbers are particularly interesting, since some can be ...