Graduate Project

 

Investigating software complexity : knot count thresholds Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_projects/gb19ff29d

Descriptions

Attribute NameValues
Creator
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
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language

Relationships

Parents:

This work has no parents.

Items