Reducing Lecture and Increasing Student Activity in Computer Science Courses Roy P. Pargas Clemson University ITiCSE 2006, Bologna, Italy June 26, 2006

Reducing Lecture and Reducing Lecture and Increasing Student Activity in Increasing Student Activity in Computer Science CoursesComputer Science Courses

Roy P. PargasRoy P. PargasClemson UniversityClemson University

ITiCSE 2006, Bologna, ItalyITiCSE 2006, Bologna, ItalyJune 26, 2006June 26, 2006

R.P Pargas, Clemson UnivR.P Pargas, Clemson Univ ITiCSE 2006 June 26 Bologna, ItalyITiCSE 2006 June 26 Bologna, Italy 22

OverviewOverview MessageGridMessageGrid: :

• Web-based software tool to help Web-based software tool to help promote interactivity in the classroom promote interactivity in the classroom


OverviewOverview MessageGridMessageGrid: :

• Web-based software tool to help promote Web-based software tool to help promote interactivity in the classroom interactivity in the classroom

Clemson laptop mandateClemson laptop mandate The problemThe problem Our solution: MessageGrid with Clickers and Our solution: MessageGrid with Clickers and

InkInk Lexes (Lecture Exercises)Lexes (Lecture Exercises) Current and Future WorkCurrent and Future Work AcknowledgementsAcknowledgements


Very Few People Seem to Know Very Few People Seem to Know ……


Where in the World isWhere in the World isClemson University?Clemson University?


We are here! Where in the World isWhere in the World isClemson University?Clemson University?


Clemson Laptop MandateClemson Laptop Mandate

Every student is required to have a Every student is required to have a laptop computer with wireless access laptop computer with wireless access to the Internetto the Internet


The ProblemThe Problem

How can instructors use the laptop How can instructors use the laptop computers to advantage in and out computers to advantage in and out of the classroom?of the classroom?


Our Proposed SolutionOur Proposed Solution

MessageGridMessageGrid MessageGrid ClickersMessageGrid Clickers MessageGrid MessageGrid InkInk


MessageGridMessageGrid

Web-basedWeb-based Rows and columnsRows and columns Instructor designs gridInstructor designs grid Students post original submissions or Students post original submissions or

replies to submissionsreplies to submissions Anything displayed by a browserAnything displayed by a browser

• Text, image, audio, video, animation, Text, image, audio, video, animation, PowerPoint, …PowerPoint, …


Student 1Student 1

Student 1

Student 2

Student 2 Student 2


Pre-Lecture Reading AssignmentPre-Lecture Reading Assignment


MessageGrid ClickersMessageGrid Clickers

Eric MazurEric Mazur• Harvard UniversityHarvard University• Physics for non-majorsPhysics for non-majors• Hardware clickersHardware clickers

How to Become a MillionaireHow to Become a Millionaire• Lifeline question to audienceLifeline question to audience


Algorithm Analysis ResultsAlgorithm Analysis Results


MessageGrid MessageGrid InkInk

Students with Tablet PCs can submit Students with Tablet PCs can submit Ink Ink answers to questionsanswers to questions


MessageGrid InkMessageGrid InkITiCSE


EvolutionEvolution

Every semester since January

2004, more instructors use MessageGrid

At semester’s end, instructors discuss possible improvements

Suggestions with most instructor

support are implemented


Focus of this Paper: Focus of this Paper: Teaching GoalsTeaching Goals

Reduced lecture

Greater student participation


Sample Lex FormatsSample Lex Formats

Lex 1. Team Discussions, Individual Responses

Lex 2. Ask, Discuss, then Ask Again

Lex 3. Animate, Abstract, and Predict

Lex 4. Trace Code, Verify with Animation


Lex 1. Individual Work or Lex 1. Individual Work or Team Discussion, Team Discussion,

Individual Responses Individual Responses


Student 1Student 1

Student 1

Student 2

Student 2 Student 2

Lex 2. Ask, Lex 2. Ask, then Ask Againthen Ask Again


Algorithm Analysis QuestionAlgorithm Analysis QuestionAnalyze algorithms below and select among: (1) A is O(n log n) and B is O(n), (2) A is O(log n) and B is O(n2), (3) A is O(n log n) and B is O(n2), (4) A is O(n) and B is O(log n), (5) A is O(log log n) and B is O(n2), (6) None of the above.


Algorithm Analysis ResultsAlgorithm Analysis Results


Algorithm Analysis Question Algorithm Analysis Question Revisited after Peer-discussionRevisited after Peer-discussion

Correct answer: 3


Towers of Hanoi (Question)Towers of Hanoi (Question)

Brief applet demonstration of the solution to the problem for sizes n=3 and n=4

Question: How many moves does it take to solve the general n-disk problem?

Options: (1) 2n−1, (2) 2n−1−1, (3) 2n−1+1, (4) 2n+1, (5) 2n+1−1, (6) 2n+1+1, (7) 2n, (8) 2n−1, (9) 2n+1, (10) None of the above.


Towers of Hanoi Towers of Hanoi (Didn’t show these results until (Didn’t show these results until

after 2after 2ndnd question asked) question asked)


Towers of Hanoi (Revisited)Towers of Hanoi (Revisited)


Mystery Recursion QuestionMystery Recursion Question What does the following recursive algorithm do? What does the following recursive algorithm do? public static int Mystery(TreeNode t) {public static int Mystery(TreeNode t) { if (t == null)if (t == null) return 0;return 0; if ((t.left != null) || (t.right != null)) {if ((t.left != null) || (t.right != null)) { return Mystery(t.left) + Mystery(t.right);return Mystery(t.left) + Mystery(t.right); elseelse return 1;return 1;} // Mystery} // Mystery


Mystery Recursion OptionsMystery Recursion Options

Options: Options: 1.1. Counts total number of nodes in the tree, Counts total number of nodes in the tree,

2.2. Counts number of interior nodes, Counts number of interior nodes,

3.3. Counts number of nodes with one child, Counts number of nodes with one child,

4.4. Adds the values of all nodes, Adds the values of all nodes,

5.5. Adds the values of all interior nodes, Adds the values of all interior nodes,

6.6. Adds the values of all leaves,Adds the values of all leaves,

7.7. None of the above. None of the above.


Mystery Recursion AlgorithmMystery Recursion Algorithm


Mystery Recursion (Revisited)Mystery Recursion (Revisited)

Sensed palpable unease among Sensed palpable unease among studentsstudents

When asked “Who would like to When asked “Who would like to change their answer? And from what change their answer? And from what to what?”to what?”• Six raised their handsSix raised their hands• Of whom Of whom

Four from #1 to #7Four from #1 to #7 Two from #2 to #7Two from #2 to #7


Mystery Algorithm RevisitedMystery Algorithm Revisited

+ 6 = 17

- 2 = 1

- 4 = 24

Lex 3. Animate, Abstract, Lex 3. Animate, Abstract, PredictPredict

Lex 4. Trace Code, Verify Lex 4. Trace Code, Verify with Animationwith Animation


Adam GoodbarAdam GoodbarFinite State AutomataFinite State Automata


Adam GoodbarAdam GoodbarFinite State AutomataFinite State Automata


Jerry StasulisJerry StasulisGraph AlgorithmsGraph Algorithms






Shameless Self-PromotionShameless Self-Promotion

Poster: Poster: A Targeted Tablet PC A Targeted Tablet PC Software Development CourseSoftware Development Course • Demo of Tablet PC Student ProjectsDemo of Tablet PC Student Projects

Time: Time: Wednesday, June 28, 2006Wednesday, June 28, 2006• 3:40 PM - 4:10 PM 3:40 PM - 4:10 PM

Room: Room: Patio of the Ranzani BuildingPatio of the Ranzani Building


Clemson Laptop MandateClemson Laptop Mandate

Every student is required to have a laptop Every student is required to have a laptop computer with wireless access to the Internetcomputer with wireless access to the Internet

Fall 2006, Tablet Fall 2006, Tablet

PC among university PC among university

recommended unitsrecommended units


Current Work: MessageGrid Current Work: MessageGrid InkInk


Current Work: MessageGrid Current Work: MessageGrid InkInk


Student EvaluationStudent Evaluation

Student Assessment Results (a) (b) (c) (d) (e) (f) (g)

1. Clickers helps me learn the course material 8 23 12 1 1 0 0

2. Posting questions helps me recognize what is difficult in the reading

2 15 18 6 2 0 3

3. Peer-discussion in class helps me better understand the course material

15 20 10 1 0 0 0

4. Peer-discussion outside of class helps me better understand the course material

10 9 11 0 1 0 13

5. Working alone during class helps me learn better than working with seatmates

0 2 5 19 9 11 0

6. Clickers help me to focus on weaknesses in my understanding of the course material

14 19 11 1 1 0 0

7. MessageGrid is easy-to-use 10 14 16 4 2 0 0

Agree Disagree N/A


Current/Future WorkCurrent/Future Work

Summer/Fall 2006Summer/Fall 2006• Continued development of Continued development of InkInk

capabilitiescapabilities• Interconnectivity with handheld devicesInterconnectivity with handheld devices

Fall 2006, Spring 2006Fall 2006, Spring 2006• Access by non-Clemson faculty and Access by non-Clemson faculty and

studentsstudents• Formal AssessmentFormal Assessment


AcknowledgmentsAcknowledgments

2003-2005 faculty fellowship from Clemson 2003-2005 faculty fellowship from Clemson University ETS-OTEI Laptop Faculty Development University ETS-OTEI Laptop Faculty Development Program Program

2003 Microsoft Content and Curriculum 2003 Microsoft Content and Curriculum Development Grant (Tom Healy, Mgr.)Development Grant (Tom Healy, Mgr.)

2005 Microsoft Research Tablet PC and 2005 Microsoft Research Tablet PC and Computing Curriculum Grant (Jane Prey, Mgr.)Computing Curriculum Grant (Jane Prey, Mgr.)


Thank you Thank you for your kind attention.for your kind attention.

Documents

Reducing Lecture and Increasing Student Activity in Computer Science Courses Roy P. Pargas Clemson University ITiCSE 2006, Bologna, Italy June 26, 2006