Introduction

TRAKLA2 exercises are intended for Data Structures and Algorithms course. Each exercise is an independent learning object that you can interact with and receive immediate feedback on your performance in terms of automatic assessment, i.e., the system reports the number of correct steps out of the maximum steps when requested. In addition, the model solutions are available for each exercise. Read the tutorial on our on-line support page to learn more about the exercises.

All you need to do the exercises is a Java enabled web browser. We have two versions available. The full learning environment requires on-line connection while solving an exercise (see free registration, and http://trakla.cs.hut.fi/). However, we have also provided the following set of exercises with reduced functionality (Grading does not submit the answer anywhere) that can be used off-line without an internet connection. For example, a lecturer can demonstrate the working of an algorithm or a learner is able to practise an algorithm after the lecture. Each time an exercise is initialized, a new instance of the exercise is produced, thus making it possible to provide individually tailored exercises and allow practise an algorithm with unlimited number of times.

Exercises

The material (currently over 50 exercises and their variations) is divided into the following 8 categories according to their subject matter. As you can see, the material is under development as the exercises do not fully cover any category. More exercises will be created in the future we are willing to hear from you if you have novel ideas for new exercises. Please, fill in the feedback form and send your comments and suggestions.

1. Basic algorithms


2. Sorting algorithms


3. Priority queues


4. Search trees


5. Hashing


6. Graph algorithms


7. Analysis


8. Spatial Data Algorithms


Created by SVG-hut on Wed Jun 20 16:00:45 EEST 2007