You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on Blackboard via the allocated folder. These files must not be in compressed format.
It is your responsibility to check and make sure that you have uploaded both the correct files.
Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between words, hide characters, use different character sets, convert text into image or languages other than English or any kind of manipulation).
Email submission will not be accepted.
You are advised to make your work clear and well-presented. This includes filling your information on the cover page.
You must use this template, failing which will result in zero mark.
You MUST show all your work, and text must not be converted into an image, unless specified otherwise by the question.
Late submission will result in ZERO mark.
The work should be your own, copying from students or other resources will result in ZERO mark.
Use Times New Roman font for all your answers.
|
CLO6: Illustrate data structure problems and their designed solutions in the form of a group project. |
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 |
|
Get this or a similar paper done in as fast as 4 hours, 24/7.
NB: We do not sell prewritten papers. All essays are written from scratch according to specific needs and instructions
Leave a Reply
You must be logged in to post a comment.