Mark Guzdial
Amy Bruckman
Abstract
Seeking the best measures to reach advantaged and less-advantaged students equally.
- Chuang, I. and Ho, A. HarvardX and MITx: Four years of open online courses---Fall 2012--Summer 2016 (Dec. 23, 2016); https://ssrn.com/abstract=2889436Google Scholar
- DiSalvo, B., Reid, C., and Khanipour Roshan, P. They can't find us: The search for informal CS education. In Proceedings of the 45<sup>th</sup> ACM Technical Symposium on Computer Science Education (SIGCSE '14). ACM, New York, NY, USA, 2014, 487-492 Google ScholarDigital Library
- Ericson, B. and Guzdial, M. Measuring demographics and performance in computer science education at a nationwide scale using AP CS data. In Proceedings of the 45th ACM Technical Symposium on Computer Science Education (SIGCSE '14). ACM, New York, NY, USA, 2014, 217--222 Google ScholarDigital Library
- Goodman, J., Melkers, J. and Pallais, A. Can Online Delivery Increase Access to Education? Faculty Research Working Paper No. w22754. National Bureau of Economic Research, 2016.Google Scholar
- Hansen, J.D. and Reich, J. Socioeconomic status and MOOC enrollment: Enriching demographic information with external datasets. In Proceedings of the Fifth International Conference on Learning Analytics And Knowledge (LAK '15). ACM, New York, NY, USA, 2015, 59--63. Google ScholarDigital Library
- Rawls, J. A Theory of Justice. Harvard University Press, Cambridge, MA, 1971.Google Scholar
Index Terms
- Providing equitable access to computing education
Recommendations
Equitable and equitable list colorings of graphs
A proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color classes differ by at most 1. A graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable and each color appears on at most @?|V(G)...
Equitable colorings of planar graphs without short cycles
An equitable coloring of a graph is a proper vertex coloring such that the sizes of every two color classes differ by at most 1. Chen, Lih, and Wu conjectured that every connected graph G with maximum degree @D>=2 has an equitable coloring with @D ...
Equitable Learning Environments in K-12 Computing: Teachers’ Views on Barriers to Diversity
The current efforts to expand computer science (CS) education in K-12 schools, such as the “CS for All” initiative, highlight the need for all students to get an opportunity to study computing. However, as recent research has shown, diversity in ...
Comments