Scribd
Upload
2 views2 pages

04 Computer Science Shuttle Routing

The assignment focuses on developing a campus shuttle routing algorithm using graph theory, aimed at reducing wait times while maintaining understandable routes. Students are required to model a graph with specific parameters, write pseudocode for a routing strategy, and analyze algorithmic tradeoffs. The final submission includes a technical memo, a graph diagram, and a complexity analysis, with a grading rubric emphasizing problem modeling, algorithm design, testing, tradeoff analysis, and presentation quality.

Uploaded by

ttburner25
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views2 pages

04 Computer Science Shuttle Routing

The assignment focuses on developing a campus shuttle routing algorithm using graph theory, aimed at reducing wait times while maintaining understandable routes. Students are required to model a graph with specific parameters, write pseudocode for a routing strategy, and analyze algorithmic tradeoffs. The final submission includes a technical memo, a graph diagram, and a complexity analysis, with a grading rubric emphasizing problem modeling, algorithm design, testing, tradeoff analysis, and presentation quality.

Uploaded by

ttburner25
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Fictional Sample Assignment - for practice/material design only

Sample Assignment 4: Campus Shuttle Routing Algorithm


Course area Computer Science / Data Structures
Suggested level Introductory university or advanced high school
Due date Instructor/TBD

Overview
A campus transportation office wants to reduce shuttle wait times while keeping routes
understandable. You will model the campus as a graph and compare two routing strategies
using pseudocode and complexity analysis.

Learning objectives
 Represent a practical problem using graph terminology.
 Write clear pseudocode for a search or shortest-path algorithm.
 Compare algorithmic tradeoffs using time complexity and real-world constraints.

Assignment tasks
1. Define a graph with at least eight stops and twelve weighted edges. Weights may represent
travel time, distance, or passenger demand.
2. Write pseudocode for one routing approach, such as Dijkstra's algorithm, breadth-first
search on unweighted edges, or a greedy nearest-stop method.
3. Test your approach on two fictional passenger requests and show the selected route.
4. Compare your approach to one alternative and explain when your algorithm might perform
poorly.
5. Submit a 1,000-1,200 word technical memo with diagrams or tables as needed.

Submission requirements
 Technical memo, 1,000-1,200 words.
 Graph diagram or adjacency table.
 Pseudocode block and brief complexity analysis.

Generated sample prompt | No real due date, instructor, or institution


Fictional Sample Assignment - for practice/material design only

Grading rubric
Category Weight What strong work shows
Problem modeling 25% Graph representation is complete
and appropriate.
Algorithm design 30% Pseudocode is logical, readable,
and connected to the graph.
Testing and explanation 20% Examples demonstrate how
routes are chosen.
Tradeoff analysis 15% Complexity and real-world
constraints are discussed
thoughtfully.
Presentation quality 10% Memo is professional and easy to
follow.

Additional notes
 No working code is required unless your instructor adds that requirement.
 You may assume all edge weights are positive.

Reminder: This is a fictional sample assignment prompt. Replace course policies, deadlines,
citation style, and accessibility instructions before using it in a real class.

Generated sample prompt | No real due date, instructor, or institution

You might also like