Proposal - dvberkel/debruijn GitHub Wiki

This page proposes a session for the 2012 Software Craftsmanship conference. It will answer the following questions in detail.

  1. The proposed session length (30 or 60 mins)
  2. Details of the algorithm featured
  3. A rough outline of how the session will work and what it will require technically (from participants and from the organizers and venue)
  4. Code!

It also provides references to artifacts created as a compendium to the proposed session.

Session Length

I would like to propose a session of 30 minutes. In 30 minutes the essence of the algorithm can be explained and coded up. It will miss certain depth and breadth which could be addressed in a longer session

Details of the algorithm

This session would discuss an algorithm to generate De Bruijn sequences. In particular the algorithm that uses graph theory will be discussed.

Outline of Session

The proposed session will have the following outline.

  1. We start of with a presentation introducing De Bruijn sequences, ample examples thereof and presenting an algorithm to produce De Bruijn sequences. An impression of the presentation can be found in a screencast.
  2. Participants are asked to choose a language to implement the proposed algorithm. Starter projects are provided.
  3. The starter project provides a set of unit tests which are currently failing. The objective is the make them pass.

In a session of 60 minutes the following aspects could be discussed as well.

  1. Runtime Complexity of the algorithm.
  2. Alternative algorithm which efficiently generates De Bruijn sequences.

Prerequisites

Participants

The participants interested in coding should clone/fork the project on GitHub.

Organizers

A room with a beamer.

Code!

The session has an associated project that is hosted on GitHub.