algorithmic problem algorithmic problem
Diese Seite wurde seit 1 Jahr inhaltlich nicht mehr aktualisiert.
Unter Umständen ist sie nicht mehr aktuell.
BiblioMap
Definitionen
Algorithmic problems nach Jonassen sind Probleme, bei denen ein vorher erlernter Algorithmus angewendet werden kann/muss (es geht also nicht darum, einen Algorithmus für ein Problem zu entwickeln, sondern einen bekannten Algorithmus anzuwenden).
Von Beat Döbeli Honegger, erfasst im Biblionetz am 20.04.2015One of the most common problem types encountered in schools is the algorithm. Most common in mathematics courses, students are taught to solve problems such as long division or equation factoring using a finite and rigid set of procedures with limited, predictive decisions.
Von David H. Jonassen im Text Toward a Design Theory of Problem Solving (2000) One of the most common problem types encountered in schools is the algorithm. Most common in mathematics courses, students are taught to solve problems such as long division or equation factoring using a finite and rigid set of procedures with limited, predictive decisions.
Von Jane Howland, David H. Jonassen, Rose M. Marra, Joi Moore im Buch Learning to Solve Problems with Technology (2nd ed.) (2003) im Text Problem Solving Is Meaningful Learning auf Seite 21Bemerkungen
Over-reliance on algorithmic
problem representations often results in the absence of conceptual
understanding of the objects the algorithm is representing.
Von David H. Jonassen im Buch Learning to Solve Problems (2010) im Text How das Problem Solving Vary? Many researchers, such as Smith (1991), argue that algorithms (repeating a series of steps) are, by nature, not problems but rather procedures. When learners are required to select and perhaps modify an algorithm for use in an exercise, it may become problem solving. Therefore, for purposes of this book, algorithms will not be considered further.
Von David H. Jonassen im Buch Learning to Solve Problems (2010) im Text How das Problem Solving Vary? The primary limitation of algorithmic approaches is the overreliance on procedurally-oriented knowledge structures and the lack or absence of conceptual understanding of the objects of the algorithm and the procedures engaged. Content that is learned only as a procedure can rarely be transferred because of a lack of conceptual understanding of the underlying processes.
Von Jane Howland, David H. Jonassen, Rose M. Marra, Joi Moore im Buch Learning to Solve Problems with Technology (2nd ed.) (2003) im Text Problem Solving Is Meaningful Learning auf Seite 21Content that is learned only as an algorithmic procedure can rarely be
transferred because of a lack of conceptual understanding of the underlying
processes. Stated more assertively, purely algorithmic teaching
does damage, because it inhibits later learning and self-sufficient
learning or adaptation. This is a common complaint about learning statistics, where professors focus on the algorithms and miss the purpose of studying the statistical analysis. It is pandemic in mathematics
courses, where students learn to perform complex process, such as derivations and integrations without understanding the purpose of either.
Von David H. Jonassen im Buch Learning to Solve Problems (2010) im Text How das Problem Solving Vary? The primary limitation of algorithmic approaches is the over-reliance on procedurally-oriented knowledge structures and the lack or absence of conceptual understanding of the objects of the algorithm and the procedures engaged. Content that is learned only as a procedure can rarely be transferred because of a lack of conceptual understanding of the underlying processes. This is a common complaint about learning statistics, where professors focus on the
algorithms and miss the purpose of studying the statistical analysis. Learners who are adept at abstract reasoning can learn increasingly complex algorithms, such as those encountered in calculus, trigonometry, and other mathematics domains. Global reasoning learners are limited in their ability to create such abstract representations of procedures, so they encounter problems.
Von David H. Jonassen im Text Toward a Design Theory of Problem Solving (2000) Verwandte Objeke
Verwandte Begriffe (co-word occurance) | designs problemdesigns problem(0.25), strategic performance problemstrategic performance problem(0.2), diagnosis-solution problemdiagnosis-solution problem(0.16), rule-using problemrule-using problem(0.16), troubleshooting problemtroubleshooting problem(0.12), decision making problemdecision making problem(0.11), case analysis problemcase analysis problem(0.09), logical problemlogical problem(0.09), story problemstory problem(0.07) |
Häufig erwähnende Personen
Statistisches Begriffsnetz
Zitationsgraph
8 Erwähnungen
- Toward a Design Theory of Problem Solving (David H. Jonassen) (2000)
- Learning to Solve Problems with Technology (2nd ed.) - A Constructivist Perspective (David H. Jonassen, Jane Howland, Joi Moore, Rose M. Marra) (2003)
- 2. Problem Solving Is Meaningful Learning (Jane Howland, David H. Jonassen, Rose M. Marra, Joi Moore)
- Learning to Solve Problems - An Instructional Design Guide (David H. Jonassen) (2004)
- Interactive Computation - The New Paradigm (Dina Q. Goldin, Scott A. Smolka, Peter Wegner) (2006)
- 18. Interaction, Computation, and Education (Lynn Stein)
- Learning to Solve Problems - A Handbook for Designing Problem-Solving Learning Environments (David H. Jonassen) (2010)
- Informatics in Schools - Sustainable Informatics Education for Pupils of all Ages - 6th International Conference on Informatics in Schools: Situation, Evolution, and Perspectives, ISSEP 2013, Oldenburg, Germany, February 26 - March 2, 2013. (Ira Diethelm, Roland T. Mittermeir) (2013)
- 6. Blind Pupils Begin to Solve Algorithmic Problems (L’udmila Jašková)
- Proceedings of the 14th Workshop in Primary and Secondary Computing Education, WiPSCE 2019, Glasgow, Scotland, UK, October 23-25, 2019 (2019)
- Analyzing students' recontextualization strategies for algorithmic concepts (Jacqueline Nijenhuis-Voogt, Durdane Bayram-Jacobs, Paulien C. Meijer, Erik Barendsen) (2019)
- AlphaCode and «data-driven» programming - Is ignoring everything that is known about code the best way to write programs? (J. Zico Kolter) (2022)