NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 2 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Robins, Anthony – Computer Science Education, 2010
Compared to other subjects, the typical introductory programming (CS1) course has higher than usual rates of both failing and high grades, creating a characteristic bimodal grade distribution. In this article, I explore two possible explanations. The conventional explanation has been that learners naturally fall into populations of programmers and…
Descriptors: Programming, Learning Processes, Grading, Simulation
Peer reviewed Peer reviewed
Direct linkDirect link
Brusco, Michael J.; Stahl, Stephanie – Psychometrika, 2005
There are two well-known methods for obtaining a guaranteed globally optimal solution to the problem of least-squares unidimensional scaling of a symmetric dissimilarity matrix: (a) dynamic programming, and (b) branch-and-bound. Dynamic programming is generally more efficient than branch-and-bound, but the former is limited to matrices with…
Descriptors: Least Squares Statistics, Comparative Analysis, Programming, Mathematics