Scribd
Upload
14 views4 pages

Daa IV t257 Project Proposal

The project titled 'Sortify' aims to create an interactive sorting visualizer to help users understand sorting algorithms through visual and interactive means. The team, Tech Tide, plans to develop this tool by improving upon existing visualizers, allowing users to manipulate inputs and observe algorithms in action. The final deliverable will include a functional application, a comprehensive report, and a user manual.

Uploaded by

ARYA BHAGAT
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
14 views4 pages

Daa IV t257 Project Proposal

The project titled 'Sortify' aims to create an interactive sorting visualizer to help users understand sorting algorithms through visual and interactive means. The team, Tech Tide, plans to develop this tool by improving upon existing visualizers, allowing users to manipulate inputs and observe algorithms in action. The final deliverable will include a functional application, a comprehensive report, and a user manual.

Uploaded by

ARYA BHAGAT
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
You are on page 1/ 4

Btech CSE DAA-IV-T257 PROJECT PROPOSAL

PROJECT AND TEAM INFORMATION

Project Title
Sortify

Student / Team Information


Team Name: Tech Tide
Team # DAA-IV-T257

Arya Bhagat
Student id: 23021076
aryabhagat1980@gmail.com

Vanshika Aggarwal
Student id: 23022784
vanshikaaggarwal896@gmail.com

Amritanshu Raj
Student id: 23151640
amritanshuraj001@gmail.com

Page 1
Btech CSE DAA-IV-T257 PROJECT PROPOSAL

PROPOSAL DESCRIPTION (10 pts)

Motivation (1 pt)
We've all been there — staring at lines of code trying to wrap our heads around how a sorting algorithm really
works. Bubble sort, quick sort, merge sort... they all sound simple enough until you're lost in the logic and can't quite
picture what's happening behind the scenes. That’s where the idea for a Sorting Visualizer came from. We wanted
to build something that makes these abstract processes come to life — something visual, interactive, and intuitive.
Instead of just reading or memorizing steps, users will see the algorithm in action, understand how data moves, and
get that “aha!” moment. For us, this project is a way to not only strengthen our own skills in data structures and
algorithms, but also to create a tool that can genuinely help others who are learning the same things.

State of the Art / Current solution (1 pt)


There are already a few sorting visualizers out there — some websites and tools that show how algorithms like
Bubble Sort or Quick Sort work through simple animations. They’re pretty helpful, especially when you’re just
starting out and need a visual push to understand what’s going on. But we’ve noticed that many of them feel kind of
outdated or not very interactive. You click a button, watch some bars move, and that’s about it. There’s often no way
to slow it down, tweak the input, or really explore what’s happening step by step.
That’s where we think there’s room for something better. We want to build a tool that doesn’t just show you the
process but lets you play with it — change the speed, input your own numbers, pause and rewind, maybe even
compare two algorithms side by side. Instead of just watching sorting happen, users should feel like they’re part of
it. That’s the experience we’re aiming for.

Project Goals and Milestones (2 pts)


General Goal:
To develop an interactive travel planner that models cities and routes as a graph, enabling users to input locations
and compute the most efficient travel path based on distance, time, or custom parameters.
Key Milestones:
• ✅ Week 1–2: Gather requirements, research graph theory fundamentals, and finalize development
stack.
• ✅ Week 3–4: Implement graph data structures (adjacency list/matrix) to represent cities and routes.
• ✅ Week 5–6: Develop core algorithms: Dijkstra’s for shortest path, BFS/DFS for traversal.
• ✅ Week 7: Design and integrate a user interface (CLI/GUI) for interaction and visualization.
• ✅ Week 8: Perform testing with various datasets, edge cases, and performance metrics.
• ✅ Week 9: Finalize documentation, polish UI, and compile the project report for submission.

Project Approach (3 pts)


Our project approach combines theoretical graph algorithms with practical implementation through the following
structured steps:
1. Graph Representation
• Cities will be modeled as nodes in a graph.

Page 2
Btech CSE DAA-IV-T257 PROJECT PROPOSAL

• Routes between cities will be represented as weighted edges, with weights based on distance or travel
time.
• An Adjacency List will be used for efficient memory usage and easy traversal.
2. Algorithm Implementation
• Dijkstra’s Algorithm will be implemented to compute the shortest path between any two cities.
• Breadth-First Search (BFS) and Depth-First Search (DFS) will be utilized for exploring all reachable cities
from a given source.
• All algorithms will be tested on graphs of varying sizes to validate both correctness and performance.
3. Programming Platform
• Language: Python – chosen for its simplicity, readability, and rich ecosystem.
• Libraries:
◦ NetworkX – for creating and manipulating graph structures.
◦ Tkinter or a Text-based CLI – for building the user interface.
◦ Matplotlib – for optional route/path visualization.
4. User Interface
• Users will input a starting city and a destination city.
• Users can select an optimization preference:
◦ Shortest path
◦ Fewest stops
◦ Fastest route
• The output will include:
◦ The computed travel path
◦ Total distance or travel time
◦ A list of intermediate stops

System Architecture (High Level Diagram)(2 pts)

Project Outcome / Deliverables (1 pts)


At the end of the project, we aim to deliver:
Page 3
Btech CSE DAA-IV-T257 PROJECT PROPOSAL

• A fully functional travel planner application that integrates routing algorithms like Dijkstra, BFS, and DFS.
• Support for custom input graphs as well as preset city maps to simulate real-world scenarios.
• Detailed route information, including total distance or time, the sequence of cities, and optional visualization of the
path.
• A comprehensive project report covering system design, implementation, testing results, and potential areas for
future improvement.
• A user manual to guide users on how to install, run, and interact with the application through the interface.

Assumptions
• The travel network is static and does not factor in real-time traffic or dynamic route changes.
• All user-entered data (cities, paths, and distances) are assumed to be valid and correctly formatted.
• Distance and travel time are considered proportional by default, unless explicitly specified otherwise.

References
• Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms.
• NetworkX Documentation – https://networkx.org/documentation/stable/
• GeeksforGeeks: Graph Algorithms – https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/
• TutorialsPoint – Dijkstra’s Algorithm – https://www.tutorialspoint.com/dijkstra-s-algorithm
• Python Official Documentation – https://docs.python.org

Page 4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy