Location: Thesis subjects | Courses | CL Homepage | Dept. of Appl. Inf. (AI and DP) | Faculty of Math., Physics, and Inf. | Comenius Univ. Bratislava | Slovakia


Finished Bachelor and Master Theses

Bachelor Theses

Specification and implementation of balanced trees in Peano arithmetic

Author
Matej Vince
Advisor
Ján Kľuka
Academic year
2006/07
Language
Slovak
Abstract
This bachelor work studies 2-3 and red-black tree data structures. It implements these data structures and also basic operations with them: membership, insert and delete. Formal specification of these operations is included, so it can be used as a starting position for verification of its implementation. This work can be also used as an additional text to teaching declarative programming.
Thesis
PDF
CL files
2-3 trees Preview, Red-black trees Preview

* – updated within last 7 days Last modified: 2007-06-22T15:33+0200