Towards a fine-grained analysis of complexity of programming tasks

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Researchers

Research units

Abstract

Bloom's and SOLO taxonomies have been used to describe the complexity of computer science tasks and student's outcome. However, using these taxonomies have coarse granularity and programming tasks with very different demands could be equally classified at the same level. My research proposes a new framework using Neo- Piagetian stages of development based on the Model of Hierarchical Complexity (MHC) that enable formal definition and fine-grained evaluation of programming tasks nuances in paradigms, languages, and constructs. By empirically validating the model, I expect it to be a valuable tool to provide best practices to develop pedagogical approaches and tools.

Details

Original languageEnglish
Title of host publicationICER 2017 - Proceedings of the 2017 ACM Conference on International Computing Education Research
Publication statusPublished - 14 Aug 2017
MoE publication typeA4 Article in a conference publication
EventACM Conference on International Computing Education Research - Tacoma, United States
Duration: 18 Aug 201720 Aug 2017
Conference number: 13

Conference

ConferenceACM Conference on International Computing Education Research
Abbreviated titleICER
CountryUnited States
CityTacoma
Period18/08/201720/08/2017

    Research areas

  • Model of hierarchical complexity, Neo-piagetian stages, Task complexity

ID: 17402396