..Microsoft Word - Assessment Brief DSAA-Assessment 4- T3 2020 ...

Question

..Microsoft Word - Assessment Brief DSAA-Assessment 4- T3 2020                                                                                                                                                      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 3                                       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. 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%    This is a final exam replacement assessment hence no extension is permitted.    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 3                                       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 (als_syd@kent.edu.au) or   in  Melbourne (als_mel@kent.edu.au). 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     32 marks Reflection 15  Outcome 2+3= 5                                                                                                                                                    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 3                                       TEQSA Provider Number: PRV12051  (Important concept learnt,  enhancement in knowledge)  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

Neha · Accepted Answer

Student Name
Student Number
Title
Contents
Introduction and Background	3
Content Analysis	3
Week 1	3
Week 2	4
Week 3	4
Week 4	5
Week 5	6
Week 6	6
Week 7	7
Week 8	7
Week 9	8
Week 10	8
Week 11	9
Conclusion	9
References	9
Introduction and Background
This report is the reflective general for the course of data structure and the algorithm. During this course I studied about different types of the data structures and right algorithms can be used for performing the sorting and other operations in the program. This is an 11-week course which help me to understand the basics for the data structures and algorithm as they are the most important part when we are in solving any problem with the help of program. 
We studied about different types of the algorithms and your requirement. This course was able to provide knowledge on different techniques or the algorithms which can be used during the program and how we can make the selection of the required algorithm based on the given program to get with the best solution at less complexity. the algorithm is an overly complex subject but with this course it was easier for us to understand. Every week there was a different technique and topic which was taught, and this report provides a brief reflection for whatever I have learned from this course.
Content Analysis
Week 1
In weeks 1 it was about the algorithms and the different data types like the stack and queue. and the algorithm can be defined as the method for solving the problem and data structure can be defined as the method for storing the information. It has the impact as broadened far reaching. Over the Internet the algorithm is used for web search, distributed file sharing and packet routing. It has utilization in different fields like physics commerce social networks, multimedia and computer graphics also. 
This can be used for the intellectual stimulation and also as the most important step to become the proficient programmer. The algorithms can be used to unlock different secrets of the life and of the universe. When we are using the fundamental data types then it allows us to have the collection of the objects in the form of values. We can perform different operations like insert, remove, iterate and also test if the data structures empty. 
We studied about the linked list, and it can be defined as the data structure in which the elements are not stored at the contiguous memory location. The linked list has the data field and the reference for the next node present in the list. The last topic was Dijkstra’s to stack algorithm in which we can push in the value stack, and it allows us the put on to the operator stack with the help of operator. We can ignore the (and for the) we can pop operator and two values, and the result will be pushed.
Week 2
The week 2 was about learning ques and the stack and the requirement. It shows information about how we can grow the array. If the array is full then we can create a new array which has twice the size and then copy all the items. The first try for shrinking the array is true double the size of array when it is full and half the size of the array when array is 1/2 full. But this method is too expensive in the worst case. 
Each operation will have time proportional for the elements. The efficient solution for shrinking array is two double the size of the array when it is full and half the size of the array when array is one quarter full. We can start from the empty data structure and the average runtime per operation for the worst-case sequence of the operation. For the proposition we can start with the empty stack and any sequence of the push and pop operation will take time proportional to the number of elements. The queue is used to maintain the pointer first to the first node present in the singly linked list and another pointer last to the last node. We also studied about the Java generics and the iterate. 
Week 3
In week 3 of all the actual requirement of the performance and the algorithm. For the programmer they have to develop a new working solution and hence they need the algorithm which is working properly. The client has to solve the different problem but inefficient manner. The student can also have to play these roles in someday. The theoretician tries to understand the algorithm in better detail. It can be defined as the framework which can predict the performance and then compare algorithms. 
The scientific method is used to observe the different features of the natural world and predict events with the help of hypothesis. We can hypothesises the model which is consistent with its observations.

Microsoft Word - Assessment Brief DSAA-Assessment 4- T3 2020 XXXXXXXXXXKent Institute Australia Pty. Ltd. Assessment Brief XXXXXXXXXXABN XXXXXXXXXXCRICOS Code: 00161E RTO Code: 90458 Version 2: 11th...

Answer To: Microsoft Word - Assessment Brief DSAA-Assessment 4- T3 2020 XXXXXXXXXXKent Institute Australia Pty....

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment