Skip to main content
CS Teaching Tips

Main navigation

  • Browse All Tips
  • Tags
  • 3D
  • About
  • Rate Tips
  • Tip Sheets

Have students design an anagram solver in Prolog or Java to introduce recursive backtracking.

  • The final product is fun for students to play around with and demonstrates how powerful a short program can be.
    • Note from the CS Teaching Tips Team: visit the Wikipedia entry on recursive backtracking for more information.
  • For the full assignment, visit Stanford’s nifty assignment page.

More about this tip

Tags

  • Java
  • Other Programming Language
  • CS 2
  • Programming Concepts
External Source
Stanford's Nifty Assignment by Stuart Reges
Other Tips By
Other Tips By Stuart Reges

Similar tips

Use the playful phrasing “bracket thief” when students get a common Java error for forgetting to use a closing bracket to remind students of this error in a non-threatening way.
Misconception: students struggle with the onMousePress method (and other mouse interaction methods) in the Java objectdraw Library from Williams College; they need help understanding it’s called even when don’t explicitly call it.
Create a programmatic contract, a document that states students will break an assignment into smaller components, for a large programming project to give students experience with modular design.

For more information or to report a bug, contact us at admin@csteachingtips.org. Built with Bootstrap. Powered by Drupal.

Privacy Policy