active learning - dcs presentation

18
Oh HELLO there (intro slide: what? how? why?)

Upload: jjlumagbas

Post on 20-May-2015

198 views

Category:

Education


2 download

DESCRIPTION

We teachers need to think about learning goals, how we assess our students, and how we teach. Or rather, how we encourage our students to learn. Active learning is a possible answer. It invites the student to participate in classes, instead of just passively listening. But do they work? Some Computer Science researches have evaluated a couple of active learning methodologies, claiming that these significantly improve learning outcomes. There might be drawback to these methods, but they are definitely worth a try.

TRANSCRIPT

  • 1. OhHELLO there(intro slide: what? how? why?)

2. What do studentsGAIN from our subject? 3. How do weASSESS these skills? 4. How do weDELIVER these skills? 5. How do we?these skills? 6. How do weNURTURE INSTILL ENCOURAGE PROMOTE ELICIT INSTIGATE INSTANTIATE these skills? 7. TEACHING 8. OBJECTIVISM 9. ACTIVE learning 10. TriggerACTIVE Activitylearning Discussion Summary 11. ACTIVE learning for CS 12. P RO BL EM CA SE ProblemTABLE I S AN D TH EI R LE AR NI NG GO AL S .TopicCase 0 Case 1Problem based learningMorse alphabet Basic concepts Problem solving company Mod elling problems, their difculty an d solvability Case 2 Search for mail addresses and a precompiler for a programming lan guage Regular Case 3 expressions Coffee automato n Deterministic nite automata Case 4 Nondeterministic editor Nondete rministic nite automata an d determinization Case 5 Roman checking exams Finite au tomata vs. regular expressio ns, -automata Case 6 Grandmas rhyme Pumping Lemm Case 7 a L-systems Idea of grammars Case 8 Parentheses parsi ng Pushdown automaton Case 9 Arithmetic calcu lator LL(1)-gram mars, recursive parser Case 10 General parser The CYK-algorith m and Chomsky normal form Extra Attribute gramma r and parser tools Case 11 Summing machine Basics of Turin Case 12 g machines Library functions for TMs Deep er practice on Turing machine s Case 13 Programming co mpetition Unive rsal machines and universal lan guages, solvability Case 14 proofs Philosophical co nsiderations Ch urch-Turing theses, limits of computation. Case 1 Problem solving company again Overview revisited of the principles learnt C LA SS IFI CATI ONProblem 0 Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6N UM BE RS OF TR AD IT IO NA L (T TH E PROB LE M - BATABLE IIOF TH E PROB LE M SE TT IN G , GOAL S AN D ME TH OD S AS OP EN o OR CL OS ED c.Problemthe course to the tradi from the c based learn approach w 50%. 55 stu and seven s students, and The exact n It is rem dropped from had seen wh dropouts of t staffs resour problem-base of it. In the tra usually much we can conclu to a problem-bSetting c o o/c c o/c o/c oGoal c o c c o/c c o/cMethods o o o c o oProblem-based learning of theoretical computer science (Hamalainen 2004)md f mfa fe mpa fem 13. Success in Introductory Programming: What Works? (Guzdial, McDowell, and Simon 2013)Peer instruction 14. TheRobots GameThe Robots Game (Wray 2013) 15. What are the DOWNSIDES? 16. WhatsNEXT? Guide to Teaching Computer Science: An Activity-Based Approach(Hazzan, Lapidot, and Ragonis 2011) Reflections on the Teaching of Programming: Methods and Implementations(ed. Bennedsen, Caspersen, and Klling 2008)