A new quantitative assessment tool for computer science programs

Authors:
T. V. Fossum;S. M. Haller
Affiliations:
University of Wisconsin--Parkside, Kenosha, WI;University of Wisconsin--Parkside, Kenosha, WI
Venue:
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Year:
2005

Citing 2
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Teaching introductory programming to Information Systems and Computing majors: is there a difference?

ACE '04 Proceedings of the Sixth Australasian Conference on Computing Education - Volume 30

Priming categorization in a card sort

HCI'13 Proceedings of the 15th international conference on Human-Computer Interaction: human-centred design approaches, methods, tools, and environments - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have designed a quantitative measure using card sorts that we show is statistically significant in distinguishing beginning students (novices) from those who have acquired competency appropriate to graduates of computer science (CS) programs. Using card sorts and applying this quantitative analysis, CS departments can arm themselves with another measure of the effectiveness of their academic programs in achieving their learning outcomes.