Have students decompose problems in a more structured way by acting as project managers who need to build teams (of methods and classes) and divide the work amongst them in a clearly organized manner. Like(139 Likes)
Use SRec, a recursion visualization tool, in your introductory Java courses to help students conceptualize the recursive algorithms they write. Like(159 Likes)
Run a pair programming contest in Python to motivate, challenge, and boost students’ self-confidence. Like(170 Likes)
Have students write a program that constructs an n x n Magic Square in Java so they gain practice working with bounds in 2D arrays. Like(169 Likes)
Use different methods of counting the stairs of the Eiffel Tower to explain how different algorithms affect Big-O runtime. Like(152 Likes)
Introduce Big-O using iteration rather than recursion to make this important concept easier for students to understand. Like(143 Likes)
Have students use lollipop sticks or toothpicks to represent each statement call in an N-ary recursive algorithm. Like(147 Likes)
Have students write pseudocode when developing algorithms to simplify the process of algorithm development and execution. Like(160 Likes)
Avoid taking shortcuts! Students will model your behavior and ultimately miss important fundamental concepts. Like(116 Likes)
When teaching introductory courses, teach students to use “top-down thinking” and “bottom-up implementation.” Like(95 Likes)
Often, intuitive examples trump overly-technical description for introductions to tricky concepts such as Big-O runtime. Like(89 Likes)
Use graphs, visualizations, and examples to help make seemingly ‘ill-defined’ topics like Big-O feel more concrete. Like(116 Likes)
Do not have students write code for common algorithms. Instead, incorporate common algorithms into your class in novel course-specific variants Like(116 Likes)
Students often get stuck because they start working on a problem without thinking about what they need to know and do in order to get a working solution. Like(109 Likes)
Even if students are developing useful strategies for problem solving, they can be easily discouraged if they don’t see immediate, good results. Like(105 Likes)
Remind students about steps of the problem-solving process as they develop algorithms to solve programming problems. Like(102 Likes)
To show that algorithm design is difficult, have students write algorithms, exchange their work, and then attempt to execute each others instructions. Like(40 Likes)
Have students work in small groups to solve logic puzzles so they develop algorithmic thinking and good problem-solving habits. Like(46 Likes)