MétaCan
Menu
Back to cohort
Record W2594056401 · doi:10.1145/3017680.3017766

In-Lab Programming Tests in a Data Structures Course in C for Non-Specialists

2017· article· en· W2594056401 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTeaching and Learning Programming
Canadian institutionsBritish Columbia Institute of TechnologyUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceProgramming languageTest (biology)CompilerTest suiteSoftware engineeringMathematics educationTest casePsychologyMachine learningRegression analysis

Abstract

fetched live from OpenAlex

This paper reports on our experiences with in-lab programming tests (i.e., using a compiler and IDE) in a large undergraduate data structures course in C for non-specialists. By adding a suite of in-lab programming tests to our regular assessments (midterm, final exam, programming homework, etc.), we expected students to improve significantly in these areas: (1) programming ability as measured by final exam grades on programming-related questions, (2) confidence in programming ability, and (3) contributions/effectiveness in pair programming partnerships. Goal (1) was not met. Although Goal (2) was met, improved confidence did not translate into improved performance. Goal (3) was partially met. We present data gathered from in-lab programming test assessments, final exam programming assessments, and post-course surveys, including a two-year follow-up survey.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.897
Threshold uncertainty score0.838

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0030.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.063
GPT teacher head0.380
Teacher spread0.316 · 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

Quick stats

Citations4
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicTeaching and Learning ProgrammingFrench-language works237,207