A thorough understanding of algorithms and data structures is essential for any student of Computer Science. In this paper we present a sequence of programming projects that elegantly integrate both the study of algorithmic paradigms with an illustration of how the choice of data structure significantly impacts an algorithm. We do this in the context of a single, easily understood problem domain, that of finding a maximum matching in a graph. By focusing on only a single problem, students more fully appreciate the concept that any problem can be solved in a variety of different ways.

Mock trials are an effective and fun way of eliciting thoughtful dialogue from students, and encouraging them to produce incisive analyses of current ethical dilemmas related to computers and society. This paper describes our experience using mock trials in two computer ethics courses. Each trial was centered on a specific

This paper describes our experience extending the educational software program JFLAP. JFLAP enables students to design and simulate automata such as Finite State Machines, push-down automata, and Turing Machines. It is a valuable aid in any Automata Theory course. We modified JFLAP so that students could write Java programs that alter the actual automaton itself. This utility greatly increases the students' ability to grasp such fundamental topics as the Church-Turing thesis and the theory of undecidability.

In this paper we present a polynomial time algorithm for finding the shortest sequence of rotations that converts one binary tree into another when both binary trees are of a restricted form. The initial tree must be a degenerate tree, where every node has exactly one child, and the destination binary tree must also be degenerate, of a more restricted nature. Previous work on rotation distance has focused on approximation algorithms. Our algorithm is the only known non-trivial polynomial time algorithm for exact rotation distance between special cases of binary trees.

Any instance of the disjoint set union problem of size n, using any union strategy, that does one find per node in postorder has total cost $O(n)$. This special case, when the finds are restricted to occur in postorder, is related to the behavior of such self-adjusting data structures as the splay tree and the pairing heap.

Article Free Access Share on Efficient parallel algorithms for path problems in directed graphs Authors: J. M. Lucas Department of Computer Science, Rutgers University, New Brunswick, NJ Department of Computer Science, Rutgers University, New Brunswick, NJView Profile , M. G. Sackrowit Department of Computer Science, Rutgers University, New Brunswick, NJ Department of Computer Science, Rutgers University, New Brunswick, NJView Profile Authors Info & Claims SPAA '89: Proceedings of the first annual ACM symposium on Parallel algorithms and architecturesMarch 1989 Pages 369–377https://doi.org/10.1145/72935.72975Published:01 March 1989Publication History 1citation393DownloadsMetricsTotal Citations1Total Downloads393Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF