Title
What do successful computer science students know? An integrative analysis using card sort measures and content analysis to evaluate graduating students' knowledge of programming concepts
Abstract
This paper describes a multi-institutional study that used a repeated single-criterion card sort to investigate graduating computer science students' knowledge of programming concepts. The study seeks to improve computer science instruction by gaining insight into how graduating students retain and assimilate introductory programming knowledge into their broader understanding of the discipline. A total of 291 card sorts was elicited from 65 undergraduate students in their final year of study at eight colleges and universities throughout the USA. To fully exploit the rich qualitative and quantitative aspects of the card sort data, an integrative analysis process was used that combined content analysis with two measures, normalized minimum spanning tree and edit distance, both developed specifically to analyze card sort data.
Year
DOI
Venue
2005
10.1111/j.1468-0394.2005.00306.x
EXPERT SYSTEMS
Keywords
Field
DocType
knowledge acquisition,card sorts,content analysis,programming concepts,computer science education
Edit distance,Card sorting,Content analysis,Computer science,Exploit,Programming knowledge,Multimedia,Knowledge acquisition,Minimum spanning tree
Journal
Volume
Issue
ISSN
22.0
3.0
0266-4720
Citations 
PageRank 
References 
2
0.59
6
Authors
10
Name
Order
Citations
PageRank
Renee McCauley1988.61
Laurie Murphy226324.95
Suzanne Westbrook3366.61
Susan M. Haller429674.64
Carol Zander520.59
Timothy Fossum651.89
Kate Sanders755655.54
Briana Morrison8607.25
Brad Richards9424.41
Ruth E. Anderson1025328.53