dc.contributor.advisor |
Kourie, Derrick G. |
|
dc.contributor.postgraduate |
Marshall, Linda |
|
dc.date.accessioned |
2014-03-04T11:43:46Z |
|
dc.date.available |
2014-03-04T11:43:46Z |
|
dc.date.created |
2014 |
|
dc.date.issued |
2014 |
|
dc.description |
Thesis (PhD)--University of Pretoria, 2014. |
|
dc.description.abstract |
The problem addressed in this thesis was identified in a real life context in which an attempt was made to re-constitute a BSc Computer Science degree programme. The curriculum was modelled on the ACM/IEEE Computing Curriculum of 2001. It was further required to comply with accreditation requirements as defined by ABET’s Computing Accreditation Commission. Relying on a spreadsheet, the curriculum was iteratively and manually evaluated against the ACM/IEEE curriculum specification. A need was identified to automate or at least semi-automate this process.
In this thesis a generalisation of the problem is presented. Curricula are modelled as directed graphs (digraphs) in which graph vertices represent curriculum elements such as topics, knowledge areas, knowledge units year- levels or modules. Edges in the graph represent dependencies between these vertices such as belonging to grouping or pre-requisites. The task of curriculum comparison then abstracts to a task of digraph comparison.
A framework, the Graph Comparison Framework, is proposed. The frame- work comprises of components which are used to guide the digraph comparison process. The so-called Graph Trans-morphism algorithm component is the only component in the framework which is mandatory. The algorithm converts the information from one of the digraphs being compared into the structure of the other. This conversion enables the graphs to be compared as graph isomorphisms. All digraphs are modelled as sets of triples, making it possible to subtract one digraph from another using the set minus operator. The resultant difference sets are used by components defined in the framework to quantify and visualise the differences.
By modelling curricula as digraphs and applying the framework to the di-graphs, it is possible to compare curricula. This application of the framework to a real-world problem forms the applications research part of the thesis. In this part, domain knowledge of curriculum design is necessary to apply to the curriculum being developed in order to improve it. |
en_US |
dc.description.availability |
unrestricted |
en_US |
dc.description.department |
Computer Science |
en_US |
dc.identifier.citation |
Marshall, L 2014, A graph-based framework for comparing curricula, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd<http://hdl.handle.net/2263/37060> |
|
dc.identifier.uri |
http://hdl.handle.net/2263/37060 |
|
dc.language.iso |
en |
en_US |
dc.publisher |
University of Pretoria |
en_ZA |
dc.rights |
© 2014 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. |
en_US |
dc.subject |
Discrete Mathematics |
en_US |
dc.subject |
Computers and Education |
en_US |
dc.subject |
ACM/IEEE Computing Curriculum of 2001. |
|
dc.subject |
Curriculum |
|
dc.subject |
ABET's Computing Accreditation Commission |
|
dc.subject |
Comparing curricula |
|
dc.subject |
Graph-based framework |
|
dc.subject |
UCTD |
en_US |
dc.subject.other |
B14/4/59/gm |
|
dc.title |
A graph-based framework for comparing curricula |
en_US |
dc.type |
Thesis |
en_US |