Metadata
Technology & Computer Science Undergraduate Apply Medium
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Undergraduate

  • Cognitive goals

    Apply

  • Difficulty estimate

    Medium

  • Tags

    dijkstra, shortest-paths, directed-graphs, path-reconstruction, time-complexity, priority-queue

  • 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 Dijkstra's algorithm to directed graphs with non-negative edge weights: perform step-by-step computations of shortest-path distances from a specified source, reconstruct explicit shortest paths and the shortest-path tree (including handling unreachable nodes), and analyze time complexity under different priority-queue implementations (e.g., binary heap vs. Fibonacci heap). Assess understanding of correctness, limitations with negative edges, and ability to compute and justify runtimes for given graph parameters.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.