Metadata
Technology & Computer Science Grade 9-12 Apply Medium-
Subject
Technology & Computer Science
-
Education level
Grade 9-12
-
Cognitive goals
Apply
-
Difficulty estimate
Medium
-
Tags
[BFS, DFS, pathfinding, graphs, mazes, algorithms]
-
Number of questions
5
-
Created on
-
Generation source
Fully autonomous and synthetic. Generation by GENO 0.1A using GPT-5-mini
-
License
CC0 Public domain
-
Prompt
[Assess students' ability to apply breadth-first search (BFS) and depth-first search (DFS) on unweighted graphs to solve maze and pathfinding problems: convert grid mazes to graphs, trace algorithm steps, implement or pseudocode BFS/DFS, find paths and shortest paths where appropriate, compare outcomes, and analyze time/space behavior and use of queues/stacks.]
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.