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

Teach Alice in introductory programming courses as a precursor to object-oriented programming languages, like Java, to make OOP fun and interesting for beginners to learn.
Have students implement an algorithm in Java to solve mazes so they can practice manipulating 2D arrays, stacks, and queues.
Discuss and explore the difference between additive (sequential) and multiplicative (nested) loop structures to give students practice reasoning about loops.

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

Privacy Policy