Visualisation of algorithms
by Ludek Kucera
International Journal of Continuing Engineering Education and Life-Long Learning (IJCEELL), Vol. 15, No. 3/4/5/6, 2005

Abstract: The present paper summarises the author's experience in teaching algorithms in undergraduate courses for students of Informatics at Charles University. In the author's view, the most efficient way of instruction is a classical lecture in a lecture hall that guarantees the quality of contact between a teacher and a student, that cannot be matched by any audiovisual channel; but with a teacher supported by a complex visualisation environment made to requirements of a particular algorithm, which not only animates the algorithm (forward and backward computation with or without interruptions), but also makes it possible to display the information necessary for understanding and analysing the algorithm (e.g., invariants of correctness, termination and complexity analysis, complexity related features etc.), implementation details and other important topics. Certain aspects of such visualisation environments are discussed.

Online publication date: Sat, 03-Sep-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Continuing Engineering Education and Life-Long Learning (IJCEELL):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com