Writing Graph Algorithms in Executable Pseudocode – Mgr. Boris Ranto
Mgr. Boris Ranto
Bachelor's thesis
Writing Graph Algorithms in Executable Pseudocode
Writing Graph Algorithms in Executable Pseudocode
Abstract:
Cieľom tejto bakalárskej práce je poskytnúť nástroj, ktorý by umožnil návrh programov v pseudokóde, ktorý je priamo spustiteľný. Pseudokód by mal byť bez prebytočnej komplexnosti z hľadiska jednoduchosti výsledného kódu. Práca si dáva za cieľ slúžiť ako študijný materiál pre návrhárov programov, ktorí sú ochotní sa podriadiť navrhnutej notácii.Abstract:
The aim of this bachelor thesis is to provide the tool that would allow software designer to write pseudocode that is directly executable without additional complexity in terms of pseudocode simplicity. The thesis is aimed to serve as a learning material for software designers that are willing to comply to the suggested notation.
Language used: English
Date on which the thesis was submitted / produced: 17. 5. 2011
Identifier:
https://is.muni.cz/th/r8s03/
Thesis defence
- Date of defence: 20. 6. 2011
- Supervisor: Ing. Petr Gotthard
- Reader: RNDr. Vojtěch Řehák, Ph.D.
Citation record
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Informatics / Informatics