Description and Instructions
1. Objective
The primary objective of this project is to gain proficiency in the design and development of algorithmic solutions through the application of data structures concepts.
2. Introduction
In this project, student groups will collaboratively solve a problem designed to assess their comprehension of data structures. Each group, consisting of three to four students, will consolidate their work into a single report, which will be submitted alongside the other project materials.
3. Required work
Select an algorithmic problem pertaining to data structure concepts (specifically one covered during class lectures) and formulate a comprehensive problem statement addressing it.
Examples of project topics:
|
Problem Name |
Problem Description |
|
Task Scheduling System |
Schedule tasks while respecting priorities or arrival orders. |
|
Route Planning System |
Determine the optimal route between two locations on a given map. |
|
Dictionary Word Lookup |
Check whether words exist in a dictionary (set of sample words) and suggest corrections. |
|
Book Inquiry System |
Organize, search, and retrieve book names. |
- Choose a project from the table provided above or propose an original project idea.
- Analyze and comprehend the selected problem thoroughly.
- Implement at least two different solutions to the problem using data structures.
- At least one data structure must be incorporated into each proposed solution.
- Solutions must be implemented in separate methods, and they should be demonstrated and tested in a main method.
- Provide a comprehensive analysis of the algorithmic complexity for both implemented solutions.
Note: You may choose a project from the table above or propose an original idea. If you propose your own topic, you must receive confirmation from your instructor before proceeding.
4. What to submit?
1.Project Report
a)Describe the problem.
b)Describe the algorithm used to solve the problem.
c)Analyze the algorithmic complexity of your solutions.
d)Screenshots showing the output produced during program execution.
2.Source Code
A complete, executable Java program.
The source code must be well documented.
Marking Criteria
|
# |
Criteria |
Marks |
|
1 |
Project Report |
6 |
|
1.1 |
Description of the problem |
1 |
|
1.2 |
Description of the algorithm used in solution 1 |
1 |
|
1.3 |
Description of the algorithm used in solution 2 |
1 |
|
1.4 |
Analysis of the algorithm complexity of your solution 1 |
1 |
|
1.5 |
Analysis of the algorithm complexity of your solution 2 |
1 |
|
1.6 |
Screenshots |
1 |
|
2 |
Source Code |
8 |
|
2.1 |
Java code to solve the problem. (Solution 1) |
3 |
|
2.2 |
Java code to solve the problem. (Solution 2) |
3 |
|
2.3 |
A main method to demonstrate and test the solutions. |
2 |
|
Total |
14 |
|
Leave a Reply
You must be logged in to post a comment.