Kent Institute Australia Pty. Ltd. Assessment Brief ABN XXXXXXXXXXCRICOS Code: 00161E RTO Code: 90458 Version 2: 11th October, 2019 Page 1 of 4 TEQSA Provider Number: PRV12051 ASSESSMENT BRIEF COURSE:...

1 answer below »
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: Assessment 4- Content Analysis (Reflective Journal) Length/Duration: 2500 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. a) Submission Date: Week 14 Assessment Task: Students are required to analyse the lecture materials of Weeks 1 to 11 and create concise content analysis. This will include summaries of the theoretical concepts contained in the course lecture slides, covering definitions, analysis and examples. Total Mark: 40 Marks Weighting: 40% 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) 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: Students are required to analyse the weekly lecture material of weeks 1 to 11 and create concise content analysis summaries of the theoretical concepts contained in the course lecture slides. Where the lab content or information contained in technical articles from the Internet or books helps to fully describe the lecture slide content, discussion of such theoretical articles or discussion of the lab material should be included in the content analysis. The document structure is as follows (2500 Words): 1. Title Page 2. Introduction and Background (150 words) 3. Content analysis (reflective journals) for each week from 1 to 11 (2300 words; around 210 words per week): a. Theoretical Discussion i. Topics Covered ii. Definitions and/or basic plans for Data Structure/Algorithm learnt in the lecture. iii. Mathematical Analysis b. Reflection on the Contents i. Demonstrate understanding of the data structure/algorithm learnt in the lecture by applying it on one of your own examples. c. Outcome i. What was the most important concept learnt? ii. How that concept (data structure/ algorithm) improves your knowledge in relation the concepts learnt in the earlier lectures. 4. Conclusion (50 words) Your report must include:  At least five references, out of which, three references must be from academic resources.  Harvard Australian referencing for any sources you use.  Refer to the Academic Learning Skills student guide on Referencing. ASSESSMENT SUBMISSION: This assignment should be submitted online in Moodle through Turnitin. The assignment MUST be submitted electronically in Microsoft Word format. Other formats 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 Word. For assistance please speak to our Academic Learning Skills Coordinators, in Sydney ([email protected]) or in Melbourne ([email protected]). They can help you with understanding the task, draft checking, structure, referencing and other assignment-related matters. MARKING GUIDE (RUBRIC): Students will be awarded marks based on following criteria Marking Criteria Marks Theoretical Discussion (Topics, definitions, analysis) Content precisely presented based on references 3+6+3=12 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 Reflection 15 32 marks Outcome (Important concept learnt, enhancement in knowledge) 2+3= 5 Presentation (Layout, no grammatical errors, reads well, etc.) 4 Marks Cited references 4 Marks Total marks for content analysis assignment 40 Marks 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 each Trimester. Kent recommends a minimum of FIVE (5) references in work being presented for assessment. Unless otherwise specifically instructed by your Lecturer or as detailed in the Unit Outline for the specific Assessment Task, any paper with lessthan five (5) references may be deemed not meeting a satisfactory standard and possibly be failed. Content in Assessment tasks that includes sources that are not properly referenced according to the “Harvard Referencing Workbook” will be penalised. Marks will be deducted for failure to adhere to the word count if this is specifically stated for the Assessment Task in the Unit Outline. As a general rule there is an allowable discretionary variance to the word count in that it is generally accepted that a student may go over or under by 10% than the stated length. GENERAL NOTES FOR REFERENCING References are assessed for their quality. Students should draw on quality academic sources, such as books, chapters from edited books, journals etc. The textbook for the Unit of study can be used as a reference, but not the Lecturer Notes. The Assessor will want to see evidence that a student is capable of conducting their own research. Also, in order to help Assessors determine a student’s understanding of the work they cite, all in-text references (not just direct quotes) must include the specific page number(s) if shown in the original. Before preparing your Assessment Task or own contribution, please review this ‘YouTube’ video (Avoiding Plagiarism through Referencing) by clicking on the following link: link: http://moodle.kent.edu.au/kentmoodle/mod/folder/view.php?id=3606 A search for peer-reviewed journal articles may also assist students. These type of journal articles can be located in the online journal databases and can be accessed from the Kent Library homepage. Wikipedia, online dictionaries and online encyclopaedias are acceptable as a starting point to gain knowledge about a topic, but should not be over-used – these should constitute no more than 10% of your total list of references/sources. Additional information and literature can be used where these are produced by legitimate sources, such as government departments, research institutes such as the National Health and Medical Research Council (NHMRC), or international organisations such as the World Health Organisation (WHO). Legitimate organisations and government departments produce peer reviewed reports and articles and are therefore very useful and mostly Kent Institute Australia Pty. Ltd. Assessment Brief ABN 49 003 577 302 CRICOS Code: 00161E RTO Code: 90458 Version 2: 11th October, 2019 Page 4 of 4 TEQSA Provider Number: PRV12051 very current. The content of the following link explains why it is not acceptable to use non-peer reviewed websites (Why can't I just Google?): https://www.youtube.com/watch?v=N39mnu1Pkgw (thank you to La Trobe University for access to this video).
Answered Same DayOct 16, 2021DSAA204

Answer To: Kent Institute Australia Pty. Ltd. Assessment Brief ABN XXXXXXXXXXCRICOS Code: 00161E RTO Code:...

Neha answered on Oct 18 2021
146 Votes
Introduction and background
In this report we will discuss about all the course material which was taught to me in 11 week course restore in this report we will discuss about different algorithm techniques which can be used to perform sorting over the arrays and different types of data structures in which we can store arrays in the program. We were also discussed about the quick sort, merge sort, heap sort and few other techniques also which can be used in different sce
narios on the basis of their time complexity. The whole report is based on the analysing different techniques for performing sorting over the data structures in the program. It also includes few graphs which can be used to understand the time complexity of the sorting algorithm. In the last week we started about the sorting of string in different techniques.
Week 1
In week one the discussion was about the stack and queues and their importance in the algorithms. The stack is used when we want to examine the item which is added recently into the list. Queue data type is used when we want to examine the item which is least recently added into the list. There are different benefits for implementing the stack and queue data types. Client is not aware about the details of implementation and the client has different types of implementation from which he can select one. Implementation cannot know the details of requirement from the client side. It allows the clients to reuse the same implementation in different parts of the code. These data types allow us to create code in a modular format and reuse the libraries. We can optimize the implementation wherever it is required to enhance the performance of the overall program. A linked list can be defined as a data structure in which each element is not stored at a proper contiguous memory location. The linked list consists of modes in which each node contains address of the next note. It contains a data field and a reference link which is linked with the next node present in the list. It is used to maintain the monitor for the first node in a singly linked list. We can push new item before first and pop item before first. There are conditions like overflow and underflow.
Week 2
In Week 2 we had a question to find out different methods which can be helpful to provide capacity for the clients which cannot be implemented in the current API. The major question was to find out how we can grow or shrink the declared are. Weekend try push to increase the size of the array by one every time and pop method to decrease the size of the array by one. But this method is very expensive as we need to copy all the items of the existing array to a new array to perform every operation and array can access for inserting first and items in the list. Currently the challenge was to make sure that the resize of an array can be done frequently. How we can shrink the array was the question which needs to be solved. We can use push method which will double the size of array whenever the arrays full or pop method which will reduce the size of the array by half whenever the carry is full. This method is also expensive when we have worst case.
Week 3
In week 3 we learned about the analysis of algorithm and why it is important. The overall structure was to understand how algorithm can be helpful for us and what type of algorithm should be selected to solve any problem. A framework was created to predict the performance of the algorithms and compare different types of algorithms to solve a single problem. It is used as the scientific method which can be helpful for observing different features of the natural world. It is a method of creating a model which is consistent with the different observations.
It helps to predict the events with the help of hypothesis we can verify all the predictions by making further observations. It also helps to validate the algorithms by repeating the steps until the observations agree. We also learned about the principles of algorithm. It is important that the hypothesis is falsifiable, and experiments should always be reproducible. The cost of the program mainly depends over the compiler or the machine. The frequency of the program depends on the algorithm and input data. The total memory used by the program depends over the data type value for example the primitive data type will use 8 bytes for int or 8 bytes for double and so on, object reference will use it bites, array will use 24 bytes and memory for array entry.
Week 4
In week 4 the course material was to cover different types of sorting algorithms which can be used to sort different types of list in the program. These sorting techniques are different from each other in terms of method and...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here