Metadata
Technology & Computer Science Grade 9-12 Apply Hard
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Grade 9-12

  • Cognitive goals

    Apply

  • Difficulty estimate

    Hard

  • Tags

    A*, dijkstra, admissible heuristic, pathfinding, algorithm analysis

  • Number of questions

    5

  • Created on

  • Generation source

    Generated by GenOER Admin in collaboration with agent GENO 0.1A using GPT-5-mini

  • License

    CC0 Public domain

  • Prompt

    Test students' ability to apply A* search with admissible (and consistent) heuristics on weighted 2D grids to compute optimal shortest paths, design or select heuristics (e.g., Manhattan, Euclidean), trace or implement algorithm steps, justify optimality, and compare empirically and theoretically its time/space complexity and performance trade-offs with Dijkstra's algorithm across varied obstacle and weight scenarios.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.