{"title":"使用常见问题集提高学生在CS2中的参与度和保留率","authors":"Aparna Mahadev, Elena Braynova","doi":"10.1145/3059009.3072981","DOIUrl":null,"url":null,"abstract":"Data Structures ranks as one of the most challenging courses in our program core curriculum. It has the steepest learning curve for our students, and the lowest retention rate. A persistent problem we face in teaching data structures is finding time and a mechanism to cover the mathematical concepts that are necessary for understanding the important aspects of the course. The authors addressed the challenge with various approaches over several years including: reorganization of the discrete mathematics I (MA220) and discrete mathematics II (MA290); reordering coverage of topics in courses, changing pre-requisites, changing credit hours, requiring students to submit weekly blogs, developing common problem sets to be used in both the MA220 and CS242, and providing peer-assisted learning sessions. In this poster presentation, we share our integrated pedagogical approach, and the benefits and shortcomings of various approaches we tried over the years. We share the results of a student survey we developed to assess our latest approach of using common problem sets in both courses. The survey results show that by using common problem sets, students had the opportunity to make connections not only between these two courses, but also between how what is being learned in the classroom fits into a broader scope of learning.","PeriodicalId":174429,"journal":{"name":"Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Using Common Problem Sets to Increase Student Engagement and Retention in CS2\",\"authors\":\"Aparna Mahadev, Elena Braynova\",\"doi\":\"10.1145/3059009.3072981\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data Structures ranks as one of the most challenging courses in our program core curriculum. It has the steepest learning curve for our students, and the lowest retention rate. A persistent problem we face in teaching data structures is finding time and a mechanism to cover the mathematical concepts that are necessary for understanding the important aspects of the course. The authors addressed the challenge with various approaches over several years including: reorganization of the discrete mathematics I (MA220) and discrete mathematics II (MA290); reordering coverage of topics in courses, changing pre-requisites, changing credit hours, requiring students to submit weekly blogs, developing common problem sets to be used in both the MA220 and CS242, and providing peer-assisted learning sessions. In this poster presentation, we share our integrated pedagogical approach, and the benefits and shortcomings of various approaches we tried over the years. We share the results of a student survey we developed to assess our latest approach of using common problem sets in both courses. The survey results show that by using common problem sets, students had the opportunity to make connections not only between these two courses, but also between how what is being learned in the classroom fits into a broader scope of learning.\",\"PeriodicalId\":174429,\"journal\":{\"name\":\"Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3059009.3072981\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3059009.3072981","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using Common Problem Sets to Increase Student Engagement and Retention in CS2
Data Structures ranks as one of the most challenging courses in our program core curriculum. It has the steepest learning curve for our students, and the lowest retention rate. A persistent problem we face in teaching data structures is finding time and a mechanism to cover the mathematical concepts that are necessary for understanding the important aspects of the course. The authors addressed the challenge with various approaches over several years including: reorganization of the discrete mathematics I (MA220) and discrete mathematics II (MA290); reordering coverage of topics in courses, changing pre-requisites, changing credit hours, requiring students to submit weekly blogs, developing common problem sets to be used in both the MA220 and CS242, and providing peer-assisted learning sessions. In this poster presentation, we share our integrated pedagogical approach, and the benefits and shortcomings of various approaches we tried over the years. We share the results of a student survey we developed to assess our latest approach of using common problem sets in both courses. The survey results show that by using common problem sets, students had the opportunity to make connections not only between these two courses, but also between how what is being learned in the classroom fits into a broader scope of learning.