Project 170
College of Computing and Informatics Project Deadline: Monday13/5/2024 @ 23:59 [Total Mark is 14] Student Details: CRN: Name: Name: Name: ID: ID: ID: Instructions: • 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. Description and Instructions Pg. 01 Description and Instructions 1. Objectives The main objective of this project is to get familiar with designing and developing an algorithmic problem solution using data structures concepts. 2. Introduction On this project each group of students will solve a problem to assess their understanding of data structure. Students will work in groups of 2-3 students then collect their work in one report to be submitted with the other project materials. 3. Required work Choose an algorithmic problem related to the concepts of data structures (one that has been covered in class) and write a problem statement on it. Examples of projects topics: Problem Name 1. Train Schedule Manager 2. Student Course Scheduler 3. Social Network Connections 4. Shopping Cart 5. Flight Reservation System 6. Shortest Path Finder 7. Music Streaming Playlist Suggested Data Structure Doubly Link list 2D- Array Graph Singly Link list 2D-Array Graph Circular Link list Description and Instructions Pg. 02 a. Select one of the projects Name in the table above. It is also possible to suggest new project (must be approved by course instructor). b. Understand the problem. c. Implement at least two solutions of the problem using data structures. d. You must use at least one data structure in your solution. e. Analysis the Algorithm complexity of your solutions 4. What to submit? 1. Project Report a) Describe the Problem. b) Describe the Algorithm used to solve the problem. c) Analysis the Algorithm complexity of your solutions. 2. Source Code Write the program in Java code to solve the problem. Marking Criteria Pg. 03 Marking Criteria # Criteria Marks 1 Project Report 6 1.1 Describe the Problem 1 1.2 Describe the Algorithm used to solve the problem (solution 1) 1 Describe the Algorithm used to solve the problem (solution 2) 1.4 Analysis the Algorithm complexity of your solution 1 1 1.5 1.5 1.5 1.3 Analysis the Algorithm complexity of your solution 2 2 Source Code 8 2.1 Java code to solve the problem. (Solution 1) 4 2.1 Java code to solve the problem. (Solution 2) 4 Total 14
Collepals.com Plagiarism Free Papers
Are you looking for custom essay writing service or even dissertation writing services? Just request for our write my paper service, and we'll match you with the best essay writer in your subject! With an exceptional team of professional academic experts in a wide range of subjects, we can guarantee you an unrivaled quality of custom-written papers.
Get ZERO PLAGIARISM, HUMAN WRITTEN ESSAYS
Why Hire Collepals.com writers to do your paper?
Quality- We are experienced and have access to ample research materials.
We write plagiarism Free Content
Confidential- We never share or sell your personal information to third parties.
Support-Chat with us today! We are always waiting to answer all your questions.
