Do we know how difficult the rainfall problem is?
Zu finden in: Koli Calling 2015, 2015
The programming task known as the Rainfall Problem has developed a reputation for being surprisingly difficult for introductory-level (CS1) students. We contribute a survey of studies of the problem as well as a new study of students' solutions collected at three institutions. In all three CS1s, at least about half of the students were able to fully solve the problem and the large majority were at least close. Failure to handle invalid or missing input accounted for most bugs. Our survey and study together suggest that the Rainfall Problem is not necessarily overwhelmingly difficult: Success rates vary and some reasonably good results have been achieved under multiple programming paradigms. We provide a breakdown of confounding factors and suggest improvements and hypotheses for future studies of the Rainfall Problem.
Dieses Konferenz-Paper erwähnt...
KB IB clear
|Kathi Fisler, D.J. Gilmore, T.R.G. Green, Mark Guzdial, J.-M. Hoc, Raymond Lister, Leo Porter, R. Samurçay, Elliot Soloway, Grace Tan, Anne Venables, Daniel Zingaro|
KB IB clear
|Programmierenprogramming, Programmierparadigmen, rainfall problem|
Volltext dieses Dokuments
|Do we know how difficult the rainfall problem is?: Fulltext at the ACM Digital Library (: , 936 kByte; : )|
Falls Ihnen diese Seite gefallen hat
Beats Biblionetz ist Teilnehmer des Partnerprogramms von Amazon Europe S.à.r.l.
*(ohne Suchmaschinen und ohne Proxy-Verluste)