rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    non sort: A
    title: system for measuring program complexity
  name:
    name part: Zolnowski, Jean Cochrane
    name part: 1947-
    role:
      role term: creator
  name:
    name part: Drew, Dan B.
    role:
      role term: degree committee member.
  name:
    name part: Lively, William M.
    role:
      role term: degree committee member.
  name:
    name part: Noe, Phillip S.
    role:
      role term: degree committee member.
  name:
    name part: Simmons, Dick B.
    role:
      role term: degree supervisor.
  name:
    name part: Texas A & M University
    role:
      role term: degree granting institution.
  type of resource: text
  genre: bibliography
  genre: Academic theses
  origin info:
    place:
      place term: txu
    date issued: 1976
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: xiii, 213 leaves ; 28 cm
  abstract: At this stage in software research, few validated tools exist for an objective evaluation of a program or for comparisons between programs. There are no generally applicable or empirically validated categorizations for computer programming. Furthermore, there are no generally accepted, comprehensive, and validated measures of computer program complexity or difficulty. There is a great void of data relevant to software, whether it be with regard to programs' error/change histories, their usability, complexity, or any other program quality. The purpose of this research is the development of techniques for measuring a program's complexity. This consists of the development of a system which would serve not only as a static analyzer for analyzing a program in terms of its relevant complexity characteristics, but also as a vehicle for actually collecting statistics on each complexity characteristic as it was evidenced in a program. The program statistics collected are analyzed and then utilized in various measures of program complexity. A great number of subjective opinions have been put forth on the topic of program complexity. These opinions have proposed a wide range of program characteristics as factors relevant to complexity. Unfortunately, there is little objective validation to reinforce these proposed characteristics as valid in measuring complexity. Objective data collection and program analysis is needed not only to validate these opinions on complexity characteristics but also to show which of the proposed characteristics appear often enough in programs to even be relevant..
  note: by Jean Cochrane Zolnowski.
  note: "Major subject: Computing Science."
  note: Vita.
  note: Texas A & M University
  note: Includes bibliographical references (leaves 209-212).
  subject:
    topic: Computer programming
  subject:
    topic: Computer programs
  subject:
    topic: Computing Science
  subject:
    topic: Computer programming
  subject:
    topic: Computer programs
  classification: QA76.6 .Z6 1976
  identifier: http://proxy.library.tamu.edu/login
  identifier: https://hdl.handle.net/1969.1/DISSERTATIONS-613884
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: https://hdl.handle.net/1969.1/DISSERTATIONS-613884
  record info:
    record content source: TXA
    record creation date: 770118
    record change date: 20220104090649.0
    record identifier: in00000601186
    language of cataloging:
      language term: eng