Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp010k225d672
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Martonosi, Margaret R. | - |
dc.contributor.author | White, Joseph | - |
dc.date.accessioned | 2017-07-20T13:13:17Z | - |
dc.date.available | 2017-07-20T13:13:17Z | - |
dc.date.created | 2017-06-02 | - |
dc.date.issued | 2017-6-2 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp010k225d672 | - |
dc.description.abstract | Course evaluations at Princeton lack numerical difficulty measures, but the textual evaluations are rich with student commentary about course difficulty. This suggests that there is an opportunity to generate a numerical difficulty score from the textual evaluations. In this project, we collect a data set via scraping and test several variations of a “bag of words” approach with the goal of determining whether such an approach holds promise as a difficulty measure. These variations are evaluated by testing their correlation with the number of pages of weekly reading assigned in a course. Surprisingly, the correlation is negative, perhaps because STEM courses are perceived as difficult and are prone to lighter reading loads. As a result, a research agenda is suggested for similar tools that can complement human academic advisors in helping students to choose better schedules. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Experimental Measures of Difficulty for Princeton Courses | en_US |
dc.type | Princeton University Senior Theses | - |
pu.date.classyear | 2017 | en_US |
pu.department | Computer Science | en_US |
pu.pdf.coverpage | SeniorThesisCoverPage | - |
pu.contributor.authorid | 960889439 | - |
pu.contributor.advisorid | 010053117 | - |
Appears in Collections: | Computer Science, 1988-2020 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
written_final_report(1).pdf | 413.42 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.