This assessment is an individual report about the design of an OOP system using Data Structures and Algorithms. The report should follow the following structure 1. Title Page 2. Executive Summary 3....

1 answer below »
This assessment is an individual report about the design of an OOP system using Data Structures and Algorithms. The report should follow the following structure 1. Title Page 2. Executive Summary 3. Introduction 4. Background 5. Case Study and the Design 5.1 Variables, Ranges and Keys 5.2 Operations and the Justification 5.3 Algorithms and the Justification 6. Conclusion 7. References Case Study: You are required to design a library system for Kent Institute. Assume that there are: two campuses – Sydney and Melbourne 300 VET level students 400 Higher Education students 20 professional staff and 40 academic staff You need to decide how many books, journals, DVDs or other media the library holds Your system design will consist of a number of different variables, each of which will have one or more keys and a range of values. Specify all of these. Then specify the range of operations which will be needed for the library system. For each of these operations, discuss the most suitable sorting or searching method and why your chosen algorithm for each operation is the most appropriate. A nearby University wants to use your system. They have: One campus 25000 undergraduate students 10000 postgraduate students 5000 research students 2000 professional staff 4000 academic staff What changes, if any, would you make to your system for the University to be able to use it effectively and efficiently?


Kent Institute Australia Pty. Ltd. Assessment Brief ABN 49 003 577 302 CRICOS Code: 00161E RTO Code: 90458 Version 2: 11th October, 2019 Page 1 of 4 TEQSA Provider Number: PRV12051 ASSESSMENT BRIEF COURSE: Bachelor of IT Unit Code: DSAA204 Unit Title: Data Structure and Algorithms Type of Assessment: Task 3- Individual Report Length/Duration: Word limit- 2000 words Unit Learning Outcomes addressed: a) Evaluate the efficiency and effectiveness of data structures and algorithms; b) Demonstrate reasoning about efficiency of algorithms; c) Assess and apply suitable recursive data structures and algorithms to IT systems and applications. Submission Date: To be submitted in week 11 Assessment Task: The assessment is about a design of a system using OOP. Total Mark: 20 Marks Weighting: 20% Students are advised that submission of an Assessment Task past the due date without a formally signed approved Assignment Extension Form (Kent Website MyKent Student Link> FORM – Assignment Extension Application Form – Student Login Required) or previously approved application for other extenuating circumstances impacting course of study, incurs a 5% penalty per calendar day, calculated by deduction from the total mark. For example. An Assessment Task marked out of 40 will incur a 2 mark penalty for each calendar day. More information, please refer to (Kent Website MyKent Student Link> POLICY – Assessment Policy & Procedures – Student Login Required) https://kentinstituteaustralia.sharepoint.com/sites/Policies%26Forms/SitePages/Home.aspx?RootFolder=%2Fsites%2FPolicies%26Forms%2FPolicies%20and%20Forms%2FStudent&FolderCTID=0x012000E6C01ECDB12ACE448B94EB84A9F93758&View=%7B148054E0%2D0936%2D4517%2D8B3E%2DD0CCDC7CD88F%7D https://kentinstituteaustralia.sharepoint.com/sites/Policies%26Forms/SitePages/Home.aspx?RootFolder=%2Fsites%2FPolicies%26Forms%2FPolicies%20and%20Forms%2FStudent&FolderCTID=0x012000E6C01ECDB12ACE448B94EB84A9F93758&View=%7B148054E0%2D0936%2D4517%2D8B3E%2DD0CCDC7CD88F%7D Kent Institute Australia Pty. Ltd. Assessment Brief ABN 49 003 577 302 CRICOS Code: 00161E RTO Code: 90458 Version 2: 11th October, 2019 Page 2 of 4 TEQSA Provider Number: PRV12051 ASSESSMENT DESCRIPTION: This assessment is an individual report about the design of an OOP system using Data Structures and Algorithms. The report should follow the following structure 1. Title Page 2. Executive Summary 3. Introduction 4. Background 5. Case Study and the Design 5.1 Variables, Ranges and Keys 5.2 Operations and the Justification 5.3 Algorithms and the Justification 6. Conclusion 7. References Case Study: You are required to design a library system for Kent Institute. Assume that there are: two campuses – Sydney and Melbourne 300 VET level students 400 Higher Education students 20 professional staff and 40 academic staff You need to decide how many books, journals, DVDs or other media the library holds Your system design will consist of a number of different variables, each of which will have one or more keys and a range of values. Specify all of these. Then specify the range of operations which will be needed for the library system. For each of these operations, discuss the most suitable sorting or searching method and why your chosen algorithm for each operation is the most appropriate. A nearby University wants to use your system. They have: One campus 25000 undergraduate students 10000 postgraduate students 5000 research students 2000 professional staff 4000 academic staff What changes, if any, would you make to your system for the University to be able to use it effectively and efficiently? ASSESSMENT SUBMISSION: Kent Institute Australia Pty. Ltd. Assessment Brief ABN 49 003 577 302 CRICOS Code: 00161E RTO Code: 90458 Version 2: 11th October, 2019 Page 3 of 4 TEQSA Provider Number: PRV12051 The assignment must be submitted online in Moodle. All materials MUST be submitted electronically in Microsoft Word format. Other formats (e.g., pdf or MAC file) may not be readable by markers. Please be aware that any assessments submitted in other formats will be considered LATE and will lose marks until it is presented in MS Word. No paper based or hardcopy submission will be accepted. MARKING GUIDE (RUBRIC): Marking Criteria Lecturer Expectation Marks Comments Choice of Variables, Keys and ranges The understanding of various data types and importance of choosing the right variables and ranges 2 Justification of Variables, Keys and Ranges choice 2 Specification of Operations Identifying operations that are required by the system to function properly. The choice of appropriate algorithm so that data can be efficiently searched and sorted. 4 Choice of Algorithms for every Operation 5 Justification of Algorithms 3 Any modifications required How making systems scalable needs changes in the choice of variables and algorithms so that efficiency is not compromised 4 Total 20 GENERAL NOTES FOR ASSESSMENT TASKS Content for Assessment Task papers should incorporate a formal introduction, main points and conclusion. Appropriate academic writing and referencing are inevitable academic skills that you must develop and demonstrate in work being presented for assessment. The content of high quality work presented by a student must be fully referenced within-text citations and a Reference List at the end. Kent strongly recommends you refer to the Academic Learning Support Workshop materials available on the Kent Learning Management System (Moodle). For details please click the link http://moodle.kent.edu.au/kentmoodle/mod/folder/view.php?id=3606 and download the file titled “Harvard Referencing Workbook”. This Moodle Site is the location for Workbooks and information that are presented to Kent Students in the ALS Workshops conducted at the beginning of
Answered Same DayMay 16, 2021

Answer To: This assessment is an individual report about the design of an OOP system using Data Structures and...

Arun Shankar answered on May 30 2021
152 Votes
Bachelor of IT
DSAA04
Data Structure and Algorithms
Task 3
Name:
Roll number:
1. Executive Summary
We are designing a library system for the KENT university which has two campuses – one at Sydney, and another at Melbourne. The university has 300 VET level students, 400 Higher Ed
ucation students, 20 professional staff, and 40 academic staff. This document specifies the design of the system - the variables, their keys and ranges. The report also describes the various operations which will be needed for the system. A nearby university with a much larger number of students also want to use the same system. The report describes the adaptations to the original system so as to render it usable to the university.
2. Introduction
The KENT university has two campuses - one at Sydney, and one at Melbourne. There are 300 VET level students, 400 Higher Education students, 20 professional staff, and 40 academic staff. The library holds 2000 books, 200 journals, 400 DVDs, and 300 other media. As any other library management system, the users of the library need to be able to borrow/return books, DVDs and journals. The users will also need to be able to search for specific items. For instance, a user might want to find out all books related to organic chemistry in the library. Or, she might want to search all books by a specific author. Therefore, the library management system must be able to support search operations based on one or more criteria.
The system must also be easily scalable. Another university, with a much larger number of students, wants to use KENT’s library system. The KENT’s library system must be scalable. The design must ensure this.
3. Background
Data can be stored using several data structures. The easiest is to store all of it in a file. For instance, all the book names can be stored in a file. When the user searches for a particular book name, the file can be opened, and the book names can be read one by one until a match is found. However, this is very slow, and the time complexity is linear.
Different data structures entail different time complexities to do the same operation. For instance, if we were to store all the book names in an array, searching will still take linear time. If we maintain all the book names in a sorted array, searching can then be accomplished in logarithmic time, however adding a new book to the database will become complicated.
Therefore one will have to address the tradeoff between speed, scale, and complexity while deciding which data structure to use. Our library system stores the books as a binary search tree. The reason for choosing a binary search tree is described in detail in the next section.
The library system provides support for searching based on the title of the book, topic or author. The details are described in detail in the next section.
4....
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here