Baltimore , Maryland
June 25, 2023
June 25, 2023
June 28, 2023
Computing and Information Technology Division (CIT) Technical Session 3
Computing and Information Technology Division (CIT)
15
10.18260/1-2--42347
https://peer.asee.org/42347
378
Jeff Erickson is a Sohaib and Sara Abbasi Professor in the Department of Computer Science. He received an BS in computer science and mathematical sciences from Rice University, an MS in information and computer science from UC Irvine, and an PhD in computer science from UC Berkeley. His past research has focused on computational geometry, computational topology, graph algorithms, and their applications; he is also the author a popular free algorithms textbook. His awards include a Sloan Research Fellowship, an NSF CAREER award, and numerous teaching and research awards from the University of Illinois.
Dr Gertner joined the Computer Science Department at the University of Illinois in 2020 as a Teaching Assistant Professor. She received her B.S. and MEng in Electrical Engineering and Computer Science from MIT, and Ph.D. in Computer and Information Science at the University of Pennsylvania. She was a Beckman Fellow at the University of Illinois Urbana-Champaign. Her current focus is on broadening participation in Computer Science and Computer Science Education She has been developing materials and teaching for iCAN, a new program for broadening participation in CS for students who have a bachelor’s degree in a field other than computer science.
This paper describes an ongoing effort to develop auto-graded scaffolding exercises to support an upper-division theoretical computer science class at a large Midwestern public university. The course covers a mixture of formal languages, automata theory, and design and analysis of algorithms. The course has a steady-state enrollment of 400 students per semester, almost all undergraduates majoring in computer science or computer engineering, for whom the course is required.
Most of our auto-graded exercises are organized as guided problem sets. Each guided problem set consists of a small number of multi-stage exercises, implemented as a sequence of questions that guide students through the process of solving a design or proof question. Our guided problem sets support multiple correct solutions, detect common mistakes, automatically provide counterexamples for incorrect answers, provide helpful narrative feedback, and award partial credit consistent with grading rubrics for written homeworks and exams. Some exercises incorporate new interactive elements that enable students to submit solutions similar to written homework. These elements allow drawing finite state machines, writing structured sentences that are auto-graded and provide feedback, and drag-and-drop blocks for writing proofs and pseudocode.
We report the results of a student survey to gauge the effectiveness of our scaffolding exercises to help students master the material, and just as importantly, to improve their confidence in that mastery.
Erickson, J., & Xia, J., & Robson, E. W., & Do, T., & Glickman, A. T., & Jia, Z., & Jin, E., & Lee, J., & Lin, P., & Pan, S., & Ruggerio, S., & Sakurayama, T., & Yin, A., & Gertner, Y., & Solomon, B. (2023, June), Auto-graded Scaffolding Exercises For Theoretical Computer Science Paper presented at 2023 ASEE Annual Conference & Exposition, Baltimore , Maryland. 10.18260/1-2--42347
ASEE holds the copyright on this document. It may be read by the public free of charge. Authors may archive their work on personal websites or in institutional repositories with the following citation: © 2023 American Society for Engineering Education. Other scholars may excerpt or quote from these materials with the same citation. When excerpting or quoting from Conference Proceedings, authors should, in addition to noting the ASEE copyright, list all the original authors and their institutions and name the host city of the conference. - Last updated April 1, 2015