Towards a fine-grained analysis of complexity of programming tasks

Rodrigo Duran

doi:10.1145/3105726.3105731

Towards a fine-grained analysis of complexity of programming tasks

Rodrigo Duran^*

^*Tämän työn vastaava kirjoittaja

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference article in proceedings › Scientific › vertaisarvioitu

Abstrakti

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.

Alkuperäiskieli	Englanti
Otsikko	ICER 2017 - Proceedings of the 2017 ACM Conference on International Computing Education Research
Kustantaja	ACM
Sivut	271-272
Sivumäärä	2
ISBN (elektroninen)	9781450349680
DOI - pysyväislinkit	https://doi.org/10.1145/3105726.3105731
Tila	Julkaistu - 14 elok. 2017
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa
Tapahtuma	ACM Conference on International Computing Education Research - University of Washington Tacoma, Tacoma, Yhdysvallat Kesto: 18 elok. 2017 → 20 elok. 2017 Konferenssinumero: 13 https://dl.acm.org/doi/proceedings/10.1145/3105726

Conference

Conference	ACM Conference on International Computing Education Research
Lyhennettä	ICER
Maa/Alue	Yhdysvallat
Kaupunki	Tacoma
Ajanjakso	18/08/2017 → 20/08/2017
www-osoite	https://dl.acm.org/doi/proceedings/10.1145/3105726

Pääsy asiakirjaan

10.1145/3105726.3105731

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

@inproceedings{572f329a30bc498d8ea141446ac19ad5,

title = "Towards a fine-grained analysis of complexity of programming tasks",

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.",

keywords = "Model of hierarchical complexity, Neo-piagetian stages, Task complexity",

author = "Rodrigo Duran",

year = "2017",

month = aug,

day = "14",

doi = "10.1145/3105726.3105731",

language = "English",

pages = "271--272",

booktitle = "ICER 2017 - Proceedings of the 2017 ACM Conference on International Computing Education Research",

publisher = "ACM",

address = "United States",

note = "ACM Conference on International Computing Education Research, ICER ; Conference date: 18-08-2017 Through 20-08-2017",

url = "https://dl.acm.org/doi/proceedings/10.1145/3105726",

}

TY - GEN

T1 - Towards a fine-grained analysis of complexity of programming tasks

AU - Duran, Rodrigo

N1 - Conference code: 13

PY - 2017/8/14

Y1 - 2017/8/14

N2 - 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.

AB - 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.

KW - Model of hierarchical complexity

KW - Neo-piagetian stages

KW - Task complexity

UR - https://www.scopus.com/pages/publications/85030166313

U2 - 10.1145/3105726.3105731

DO - 10.1145/3105726.3105731

M3 - Conference article in proceedings

AN - SCOPUS:85030166313

SP - 271

EP - 272

BT - ICER 2017 - Proceedings of the 2017 ACM Conference on International Computing Education Research

PB - ACM

T2 - ACM Conference on International Computing Education Research

Y2 - 18 August 2017 through 20 August 2017

ER -

Towards a fine-grained analysis of complexity of programming tasks

Abstrakti

Conference

Pääsy asiakirjaan

Muut tiedostot ja linkit

Sormenjälki

Siteeraa tätä