Investigating software complexity : knot count thresholds

Graduate Project

Public Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_projects/gb19ff29d

Descriptions

Attribute Name	Values
Creator	Hannan, Paula A.
Abstract	This study concentrates on threshold values for the two most popular control flow metrics: McCabe's cyclomatic complexity and the knot count. We describe the results of an experimental study to empirically determine a threshold value for knot count for student programmers. The experiment was designed to measure the interaction between difficulty, as measured by knot count, and comprehension quiz scores. This experiment had two goals: 1. Show that there are threshold values for the knot count metric. 2. Discover knot count threshold values for students in Pascal and C.
Resource Type	Capstone Project
Date Issued	1989-10-17
Degree Level	Master's
Degree Name	Master of Science (M.S.)
Degree Field	Computer Science
Degree Grantor	Oregon State University
Commencement Year	1989
Academic Affiliation	Computer Science
Déclaration de droits	In Copyright
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]

La vignette	Titre	Date de téléchargement	Visibilité	actes
	Hannan_Paula_A_1989_10_17.pdf	2022-11-30	Public	Télécharger