1 / 29

Things are Clicking in MessageGrid

Things are Clicking in MessageGrid. Roy P. Pargas Computer Science Teaching with Technology Symposium May 9, 2006. Overview. MessageGrid : Web-based software tool to help promote interactivity in the classroom. Overview. MessageGrid :

olwen
Download Presentation

Things are Clicking in MessageGrid

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Things are Clicking in MessageGrid Roy P. Pargas Computer Science Teaching with Technology Symposium May 9, 2006

  2. Overview • MessageGrid: • Web-based software tool to help promote interactivity in the classroom Teaching with Technology Symposium May 4, 2006 Clemson University

  3. Overview • MessageGrid: • Web-based software tool to help promote interactivity in the classroom • Recent additions: Clickers and Ink • Acknowledgements Teaching with Technology Symposium May 4, 2006 Clemson University

  4. Software Clickers • Eric Mazur • Harvard University • Physics for non-majors • Hardware clickers • How to Become a Millionaire • Lifeline question to audience Teaching with Technology Symposium May 4, 2006 Clemson University

  5. Algorithm Analysis Question Analyze 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. Teaching with Technology Symposium May 4, 2006 Clemson University

  6. Algorithm Analysis Results Teaching with Technology Symposium May 4, 2006 Clemson University

  7. Algorithm Analysis Question Revisited after Peer-discussion Correct answer: 3 Teaching with Technology Symposium May 4, 2006 Clemson University

  8. 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. Teaching with Technology Symposium May 4, 2006 Clemson University

  9. Towers of Hanoi (Didn’t show these results until after 2nd question asked) Teaching with Technology Symposium May 4, 2006 Clemson University

  10. Towers of Hanoi (Revisited) Teaching with Technology Symposium May 4, 2006 Clemson University

  11. Mystery Recursion Question • What does the following recursive algorithm do? public static int Mystery(TreeNode t) { if (t == null) return 0; if ((t.left != null) || (t.right != null)) { return Mystery(t.left) + Mystery(t.right); else return 1; } // Mystery Teaching with Technology Symposium May 4, 2006 Clemson University

  12. Mystery Recursion Options • Options: • Counts total number of nodes in the tree, • Counts number of interior nodes, • Counts number of nodes with one child, • Adds the values of all nodes, • Adds the values of all interior nodes, • Adds the values of all leaves, • None of the above. Teaching with Technology Symposium May 4, 2006 Clemson University

  13. Mystery Recursion Algorithm Teaching with Technology Symposium May 4, 2006 Clemson University

  14. Mystery Recursion (Revisited) • Sensed palpable unease among students • When asked “Who would like to change their answer? And from what to what?” • Six raised their hands • Of whom • Four from #1 to #7 • Two from #2 to #7 Teaching with Technology Symposium May 4, 2006 Clemson University

  15. Mystery Algorithm Revisited - 4 = 24 - 2 = 1 + 6 = 17 Teaching with Technology Symposium May 4, 2006 Clemson University

  16. Clicker Setup Teaching with Technology Symposium May 4, 2006 Clemson University

  17. Clicker Setup Teaching with Technology Symposium May 4, 2006 Clemson University

  18. Clicker Setup Teaching with Technology Symposium May 4, 2006 Clemson University

  19. SIGCSE 2006, My Hotel RoomMarch 2, 2006 ~7:48 am CST Teaching with Technology Symposium May 4, 2006 Clemson University

  20. SIGCSE 2006, My Hotel RoomMarch 2, 2006 ~7:48 am CST Teaching with Technology Symposium May 4, 2006 Clemson University

  21. SIGCSE 2006, My Hotel RoomMarch 2, 2006 ~7:48 am CST Students Absent Teaching with Technology Symposium May 4, 2006 Clemson University

  22. MessageGrid Ink • Students with Tablet PCs can submit Ink answers to questions Teaching with Technology Symposium May 4, 2006 Clemson University

  23. MessageGrid Ink Teaching with Technology Symposium May 4, 2006 Clemson University

  24. MessageGrid Ink Teaching with Technology Symposium May 4, 2006 Clemson University

  25. MessageGrid Ink Teaching with Technology Symposium May 4, 2006 Clemson University

  26. Student Evaluation Agree Disagree N/A Teaching with Technology Symposium May 4, 2006 Clemson University

  27. Future Work • (Spring 2006) Alternative views of grid content • Tree-structured content, reflecting discussion threads • (Summer 2006) Standard Likert scales as answer options for clickers • (Summer 2006) Access by non-Clemson faculty • (Spring/Summer 2006) Interconnectivity with handheld devices Teaching with Technology Symposium May 4, 2006 Clemson University

  28. Acknowledgments 2003-2005 faculty fellowship from Clemson University ETS-OTEI Laptop Faculty Development Program 2003 Microsoft Content and Curriculum Development Grant (Tom Healy, Mgr.) 2005 Microsoft Research Tablet PC and Computing Curriculum Grant (Jane Prey, Mgr.) Teaching with Technology Symposium May 4, 2006 Clemson University

  29. Thank you for your kind attention. Teaching with Technology Symposium May 4, 2006 Clemson University

More Related