Change search
ReferencesLink to record
Permanent link

Direct link
En studie i att bestämma komplexitet: Att visa och exponera relationer mellan objekt i en topologi
2013 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

The aim of this thesis was to determine which software complexity measurements that was applicable on data structures, in this case extensible markup language (XML) based scripts and to expose the bindings between the different internal objects that a data structure consist of.This thesis summaries the theory on a subset of the currently available complexity measurements. A few suitable measurements on complexity where found and applied to evaluate the parameter settings logic at Scania, to find a correlation between the complexity of the system and its real world parameters.Since exposing the bindings between the internal objects are a major part of this thesis, the relation between different types of internal bindings are investigated. Mainly into how the performance is affected by, one to many and one to one relationships, and also which factors underlie for the complexity growth.Some examples are also given in this thesis on how to reduce the complexity of the parameter settings logic. These could as well be applied to other data driven schemas.A reduction in complexity should lead to easier management and maintenance of the systems for the developers. In the long run a higher quality of code could be achieved which could in turn reduce the time needed to parameterize the different Electrical Control Units used in Scania's trucks, busses and industrial motors on the assembly lines.

Place, publisher, year, edition, pages
2013. , 71 p.
Keyword [en]
Keyword [sv]
Teknik, Complexity measurements, Complexity metrics, Length measurements, Structural complexity, Complexity, Lines of code, McCabe, Cyclomatic complexity, Tree impurity, Information flow, Myers interval, Simpson's paradox, XML, Data driven schemas, Scania
URN: urn:nbn:se:ltu:diva-52761Local ID: 9db47141-7b6a-4b72-b268-0ead317725eeOAI: diva2:1026133
External cooperation
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Validerat; 20131024 (global_studentproject_submitter)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

fulltext(4928 kB)0 downloads
File information
File name FULLTEXT02.pdfFile size 4928 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Brood, Jonas

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link