Scribd
Upload
4 views

ADSA Project Titles List

Uploaded by

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

ADSA Project Titles List

Uploaded by

janus341268
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Department of Computer Science and Engineering

Advanced Data Structures and Algorithms


M.Tech. I Year I Term

ADSA Project Titles

1. Smart Task Scheduler using Priority Queues

Description: Develop a smart task scheduling system that prioritizes tasks based on urgency,
deadlines, and dependencies using Priority Queues.
What Students Can Do:

 Implement different priority queue variations (min


(min-heap, max-heap).
 Compare performance using different scheduling algorithms.
 Add a GUI to visualize task prioritization.

2. Graph-Based
Based Route Optimization for Delivery Services

Description: Build a system that finds the shor


shortest delivery route using Graph Algorithms like
Dijkstra’s and Floyd-Warshall
Warshall.
What Students Can Do:

 Implement graph traversal algorithms (BFS, DFS) to explore paths.


 Use Dijkstra’s Algorithm for shortest path finding.
 Compare efficiency with A Algorithm*.

3. Secure Password Management System using Hashing

Description: Develop a password manager that securely stores passwords using Hashing
techniques with salting and collision resolution
resolution.
What Students Can Do:

 Implement HashTable ADT with a custom hash function.


 Use SHA-256 or bcrypt for cryptographic hashing.
 Ensure security using salting and collision handling (chaining, probing).

4. Plagiarism Detector using String Matching Algorithms

Description: Build a plagiarism detection system that checks for similar content in documents
using Knuth-Morris-Pratt and Boyer-Moore algorithms.
What Students Can Do:

 Implement Pattern Matching algorithms to compare text.


 Optimize the detection process using suffix trees.
 Develop a UI to visualize plagiarism percentage.

5. AI-Based Chatbot with Dynamic Data Structure Handling

Description: Create a chatbot that dynamically manages user inputs and responses using Trie,
Stack, and Queue structures.
What Students Can Do:

 Implement Trie Data Structure for quick phrase matching.


 Use Queues to manage chatbot history and responses.
 Optimize memory usage with Linked Lists.

6. Spell Checker and Auto-Correct System using Tries

Description: Develop an auto-correct and spell-checker tool that suggests words based on Trie
Data Structure.
What Students Can Do:

 Implement Trie for word storage and prefix-based searching.


 Optimize for fast lookups using Ternary Search Trees.
 Add real-time word suggestion features.

7. E-Commerce Price Comparison System using Sorting Strategies

Description: Design a system that fetches product prices from different sources and sorts them
using Multi-way Merge Sort, Heap Sort, and Shell Sort.
What Students Can Do:
 Scrape product prices using APIs or web scraping techniques.
 Implement different sorting algorithms to compare efficiency.
 Use data visualization to display price trends.

8. Dynamic Flight Ticket Pricing using Dynamic Programming

Description: Build a system that predicts ticket prices using 0/1 Knapsack and Matrix Chain
Multiplication.
What Students Can Do:

 Implement Knapsack algorithm to optimize pricing based on demand.


 Use Dynamic Programming techniques to minimize price fluctuations.
 Develop a price forecasting dashboard.

9. Efficient Image Processing using Strassen’s Matrix Multiplication

Description: Optimize image scaling and filtering using Strassen’s Divide & Conquer
Algorithm for matrix multiplication.
What Students Can Do:

 Implement Strassen’s algorithm to perform matrix-based image transformations.


 Compare performance with standard matrix multiplication.
 Apply optimization techniques for real-time processing.

10. Social Network Friend Recommendation System using Graph Theory

Description: Create a friend recommendation system using Graph-based algorithms like


PageRank, BFS, and Minimum Spanning Tree.
What Students Can Do:

 Represent users as graph nodes and relationships as edges.


 Implement BFS/DFS traversal for friend suggestions.
 Use Minimum Spanning Tree (MST) for community detection.

*****

You might also like