MétaCan
Menu
Back to cohort
Record W1984321109 · doi:10.1109/reet.2010.5633110

Planned programming problem gotchas as lessons in requirements engineering

2010· article· en· W1984321109 on OpenAlexafffund
Daniel M. Berry, Craig S. Kaplan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware Engineering Research
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceExperiential learningPlan (archaeology)MisfortuneValue (mathematics)Artificial intelligenceMathematics educationPsychology

Abstract

fetched live from OpenAlex

The term “gotcha” is used to describe an unforeseen exception or complexity in a programming assignment given to students. All too often, the students' discovering gotchas in a programming assignment embarrasses the instructor into revising the assignment. This paper argues that students' discovery of gotchas should be encouraged to promote experiential learning of the value and necessity of requirements engineering. Rather than viewing the discovery experience as a misfortune, an instructor should welcome the experience and even plan assignments with an abundance of gotchas to be discovered by students.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.023
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.023
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0030.006
Open science0.0020.004
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0070.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.025
GPT teacher head0.300
Teacher spread0.275 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations5
Published2010
Admission routes2
Has abstractyes

Explore more

Same topicSoftware Engineering ResearchFrench-language works237,207