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

  • Subject

    Technology & Computer Science

  • Education level

    Grade 9-12

  • Cognitive goals

    Apply

  • Difficulty estimate

    Medium

  • Tags

    BFS, DFS, graphs, shortest path, cycles, connected components

  • 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 BFS and DFS on small directed and undirected graphs to (1) find shortest paths in unweighted graphs using BFS, (2) detect cycles using DFS (identify back edges) and discuss cycle detection with BFS where relevant, and (3) identify connected components (and note strongly connected components for directed graphs); require hand-tracing, clear algorithm steps, and time-complexity justification (O(V+E)), plus explanation of when to prefer BFS vs DFS.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.