Structure and constraints in interactive exploratory algorithm learning

DOI10.1007/3-540-45875-1_17MaRDI QIDQ4471650zbMATH OpenFDO

Authors Nils Faltin

Publication date 30 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2269/22690213.htm

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Computing methodologies and applications (68U99) Technological tools, calculators (aspects of mathematics education) (97U70)

Recommendations

• Understanding algorithms by means of visualized path testing
• Algorithm animation for teaching
• An experimental method for the active learning of greedy algorithms
• scientific article; zbMATH DE number 1872988
• Recent Developments in Algorithmic Teaching

Cited in

(3)

• An interactive learning algorithm for acquisition of concepts represented as CFL
• scientific article; zbMATH DE number 7238293 (Why is no real title available?)
• An experimental method for the active learning of greedy algorithms

This page was built for publication: Structure and constraints in interactive exploratory algorithm learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471650)