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

Create boolean variables to use as the condition when introducing if statement to highlight for students that the condition is any expression that evaluates to true or false.
Have students make a multiplication table to practice working with 2D arrays, nested loops, and abstraction using a data construct they’re already familiar with.
Misconception: Students have trouble understanding the difference between Get, Post, Put/Patch, and Delete in Ruby on Rails Routing.

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

Privacy Policy