MINIPROJECT – ASSIGMENT 2
DATA STRUCTURE
The Mini Project serves as an essential part of understanding and applying the concepts of Data
Structures in solving real-world problems. It provides an opportunity for students to bridge the
gap between theoretical knowledge and practical implementation. By working on this project,
students will gain hands-on experience in implementing core data structures, enhancing their
problem-solving skills, and applying these concepts to address real-life challenges.
Objective
The primary objective of the mini-project is to enable students to:
1. Understand and implement various data structures such as Stacks, Queues, Linked
Lists, Trees, Graphs, and Hashing.
2. Apply these data structures in designing solutions for real-world problem statements.
3. Develop modular and reusable code with proper error handling and memory
management.
4. Enhance teamwork, collaboration, and technical documentation skills through group
work and reporting.
Learning Outcomes
Upon successful completion of the mini-project, students will be able to:
1. Analyze and choose the appropriate data structure for solving a given problem.
2. Design and implement menu-driven programs in C for complex problem-solving.
3. Handle edge cases such as overflows, underflows, invalid inputs, and memory
management errors.
4. Document algorithms, flowcharts, and test cases for technical validation.
1. Project Scope
The project must demonstrate the practical application of Data Structures.
Strictly use data structures such as Stacks, Queues, Linked Lists, Trees, Graphs,
Hashing, Searching, Sorting, or Priority Queues.
The project must address a real-world problem statement (e.g., Railway Reservation
System, Inventory Management, Pathfinding in Graphs, etc.).
2. Project Team
Students must form teams of 1 to 5 members.
Team members should share equal responsibilities in coding and documentation.
Project Titles Must be updated in the give Google sheet
3. Project Requirements
The project must be implemented using C Programming.
A Menu-Driven Interface must be included to allow users to interact with the project
functionalities.
The implementation must involve at least one major data structure, such as Trees,
Graphs, Stacks, or Queues.
Error Handling (e.g., invalid inputs, overflows, underflows) and proper memory
management (e.g., using malloc and free) are mandatory.
Code modularity is required, with functions performing specific tasks like insertion,
deletion, traversal, or processing.
4. Documentation and Submission
Students must submit a detailed project report containing the following:
1. Title of the Project (must reflect the real-world problem being addressed).
2. Problem Statement.
3. Algorithm and Flowchart.
4. Explanation of the Data Structures used.
5. Input, Output, and Test Cases.
6. Screenshots of Execution.
7. Conclusion and Scope for Future Enhancement.
The project code must be well-documented with meaningful comments.
Submission Format:
o Soft Copy: Code and report in a zip file.(GROUP NO_USN must be the file
Name, Ex: 01_4MW16CS024)
5. Evaluation Criteria
The project will be evaluated based on the following criteria:
Criteria Weightage
Originality and Creativity 10%
Relevance to Data Structures 20%
Technical Implementation 30%
Error Handling and Testing 20%
Documentation 20%
6. Plagiarism Policy
Projects must be original. Copying from online sources, peers, or prior submissions is
strictly prohibited.
It must consist of real-world problem statements and demonstrate independent thought
and practical application.
Any plagiarized project will receive zero marks.
7. Suggested Mini-Project Ideas
Here are some ideas for reference. All projects must strictly use data structures like Stacks,
Queues, Linked Lists, Trees, Graphs, etc.
1. Library Management System using linked lists for book and member records.
2. Pathfinding Algorithm using graphs (e.g., BFS, DFS).
3. Railway Reservation System using priority queues for ticket booking.
4. Inventory Management System using binary search trees for efficient product search
and retrieval.
5. Expression Evaluation using stacks and queues for infix-to-postfix conversion and
evaluation.
6. Student Records Management using doubly linked lists for storing and sorting records.
7. Network Routing Simulator using Dijkstra's or Kruskal's algorithm for shortest path.
8. Job Scheduling System using heaps or priority queues for efficient task prioritization.
9. Hospital Patient Management System using queues for patient records and scheduling.
10. Polynomial Operations using singly linked lists for addition, multiplication, and
differentiation.
11. Maze Solver using stacks or queues to find a path through a grid-based maze.
12. Banking System using a queue for customer service and priority queue for VIP
customers.
13. File Directory Representation using tree structures for hierarchical organization.
14. Social Network Graph representation using adjacency lists or matrices.
15. Gaming Leaderboard using heaps or binary search trees for ranking players.
LAST DATE OF SUBMISSION: 19 December 2024
