日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

CMT219代寫、代做Java程序語言

時間:2024-05-11  來源:  作者: 我要糾錯



Cardiff School of Computer Science and Informatics
Coursework Assessment Pro-forma

Module Code: CMT219
Module Title: Algorithms, Data Structures & Programming

If you have been granted an extension for Extenuating Circumstances, then the submission deadline and return date will be later than that stated above. You will be advised of your revised submission deadline when/if your extension is approved.

If you defer an Autumn or Spring semester assessment, you may fail a module and have to resit the failed or deferred components.

If you have been granted a deferral for Extenuating Circumstances, then you will be assessed in the next scheduled assessment period in which assessment for this module is carried out.  

If you have deferred an Autumn or Spring assessment and are eligible to undertake summer resits, you will complete the deferred assessment in the summer resit period.  

If you are required to repeat the year or have deferred an assessment in the resit period, you will complete the assessment in the next academic year.

As a general rule, students can only resit 60 failed credits in the summer assessment period (see section 3.4 of the academic regulations).  Those with more than 60 failed credits (and no more than 100 credits for undergraduate programmes and 105 credits for postgraduate programmes) will be required to repeat the year.  There are some exceptions to this rule and they are applied on a case-by-case basis at the exam board.

If you are an MSc student, please note that deferring assessments may impact the start date of your dissertation.  This is because you must pass all taught modules before you can begin your dissertation.  If you are an overseas student, any delay may have consequences for your visa, especially if it is your intention to apply for a post study work visa after the completion of your programme.

NOTE: The summer resit period is short and support from staff will be minimal. Therefore, if the number of assessments is high, this can be an intense period of work.

This assignment is worth 50% of the total marks available for this module. If coursework is submitted late (and where there are no extenuating circumstances):

1    If the assessment is submitted no later than 24 hours after the deadline, the mark for the assessment will be capped at the minimum pass mark;
2    If the assessment is submitted more than 24 hours after the deadline, a mark of 0 will be given for the assessment.

Extensions to the coursework submission date can only be requested using the Extenuating Circumstances procedure. Only students with approved extenuating circumstances may use the extenuating circumstances submission deadline. Any coursework submitted after the initial submission deadline without *approved* extenuating circumstances will be treated as late.

More information on the extenuating circumstances procedure and academic regulations can be found on the Student Intranet: 

By submitting this assignment you are accepting the terms of the following declaration:

I hereby declare that my submission (or my contribution to it in the case of group submissions) is all my own work, that it has not previously been submitted for assessment and that I have not knowingly allowed it to be copied by another student. I declare that I have not made use of AI chatbots or tools to complete this work.  I understand that deceiving or attempting to deceive examiners by passing off the work of another writer, as one’s own is plagiarism. I also understand that plagiarising another’s work or knowingly allowing another student to plagiarise from my work is against the University regulations and that doing so will result in loss of marks and possible disciplinary proceedings[ https://intranet.cardiff.ac.uk/students/study/exams-and-assessment/academic-integrity/cheating-and-academic-misconduct]. 


Assignment

PART 1: ALGORITHMS

In this individual work, you will implement sorting algorithms and then test their performance. This part of the assignment consists of not just coding, but also testing your code and providing evidence. Note that when your code is complete, you still have a reasonable amount of work to do -- so start early!

Storing and Sorting Items
Consider a manufacturing company, XYZ that runs 24 hours and 7 days operational. The company produces a very large number of items per week. In a week from Monday to Sunday, it produces 1000, 5000, 10000, 50000, 75000, 100000 and 500000 items, respectively. Each item has a random integer identifier.

You are expected to create an Integer ArrayList and store the item IDs for each day of the week – so you will have 7 different ArrayList storing items accordingly. Now, you are required to randomly generate the appropriate number of item IDs for each day as stated above. (These IDs do not need to be unique – it does not matter if the ArrayLists contain a few duplicate IDs).

Now think about the logic of applying the Quicksort algorithm and first write its pseudocode. Once you’re done, convert your pseudocode into a Java code and run your code successfully.

Efficiency Testing
Once you have implemented your algorithm, you need to test it to see how long your sorting algorithm takes to run. You should test the speed of the algorithm on all three: random, sorted and reverse-sorted lists. You are expected to use System.currentTimeMillis() to estimate the execution time. Using currentTimeMillis only gives an accurate time estimate if the function takes a long time to run (at least a couple of seconds). Run your code a number of times and compute the average time, print the output screenshot and discuss in the report -- reflect how many iterations are sufficient to provide an accurate time of the algorithm.

Developing a Better Sorting Algorithm
Quicksort is faster when the number of items to be sorted in a list is large. But when lists are small enough, quicksort runs slower than some of the Θ(n2) algorithms. 

If you carefully notice, each time the quicksort method is recursively called, the sublist to be sorted could be either small or large. The time to sort one small sublist with a faster algorithm can be negligible. However, sorting such hundreds of small sublists can make a difference in the overall efficiency of the sort.  

Here, you will combine Quicksort with another sorting algorithm to create the fastest possible sorting algorithm. We call this “hybrid Quicksort”. You have several options --  
Use Quicksort until the sublist gets “small enough”, and then use selection sort to sort the small lists.
Use Quicksort until the sublist gets “small enough”, and then use insertion sort to sort the small lists.
Use Quicksort to "mostly" sort the list, i.e., use the Quicksort to sort any sublists larger than a cut-off size, and then stop. The list will now be mostly sorted, and you can use selection sort on the entire list to quickly complete the sorting. 
Use Quicksort to "mostly" sort the list, i.e., use the Quicksort to sort any sublists larger than a cut-off size, and then stop. The list will now be mostly sorted, and you can use insertion sort on the entire list to quickly complete the sorting. 
Use some other method of your own devising.
What does “small enough” mean?  You can try a percentage of the list (say, 5% or 10%), or an absolute number (8, 10, 15, 100 elements, etc.), or something else of your choice. 

What does “mostly” sort mean? A cut-off size of the items to be sorted in the list.

You should test your choices to ensure that you have the most efficient algorithm possible. You should also be sure that your hybrid Quicksort has reasonable performance on all lists: sorted and inverse sorted lists as well as random lists. Try various methods for choosing the pivot element, to try to get the best possible behaviour.

You need to complete the following tasks and submit electronically:  

Q1-A. Source code for sorting all items in the ArrayLists for the week using Quicksort. [10 marks]

Q1-B. Source code for efficiency testing. [10 marks]

Q1-C. Source code for your hybrid sorting algorithm. [10 marks]

Q1-D. Write a 500-word (maximum) explanation of how you developed your hybrid sorting algorithm. What combinations of the algorithms/approaches you tried, what different parameters you chose, and how much of a difference these changes made to the efficiency of your algorithm, including the run time complexity. [20 marks]

Create a single report .pdf file containing the following: 
(i) Screenshot of the output from Q1-A for all list sizes. Also, provide a pseudocode of your Quicksort algorithm.
(ii) Screenshot of the output from Q1-B. Make sure to include sorted and inverse sorted lists as well as random lists for each list size in these tests.  
(iii) Your explanation for Q1-D above.
(iv) Screenshot of the final output from Q1-C. Make sure your hybrid quicksort has reasonable performance on all lists, sorted and inverse sorted lists as well as random lists for each list size. 

Important Note: All source code files must be submitted as a single .zip file. 

It is okay for you to discuss solutions to Part-1 with your classmates. However, no collaboration should ever involve looking at one of your classmate's source codes. It is usually fairly easy to determine that someone has copied a code, even when the individual copying the code has changed identifier names and comments.

PART 2: DESIGN PATTERNS & MULTITHREADING

Parts a-c of this question can be started after you are taught the Observer pattern, in the Design Patterns sessions. Based on content you are taught in Design Patterns, your solution to part (a) is likely to change the colour of some, but not all balls. The Multithreading session will cover additional material needed to achieve a fully working code for part a, and to answer part d.

Download and unzip BouncingBalls.zip, which contains three java source files for a small app:

BouncingBalls.java
ColorPublisher.java
ColorSubscriber.java

Build and run the application, which launches a window containing a large number of bouncing balls. Two buttons are also present which are intended to change the colour and size of the balls, however, the buttons intentionally do not work in the app you have just downloaded: it will be your task to implement this functionality.

Note also that BouncingBalls.java contains Graphical User Interface (GUI) code which has not been covered in this course. Its purpose is explained in the comments, however you are not expected to understand the GUI code in any detail. The comments alone give sufficient detail on how the GUI works for you to complete your part of the app.

BouncingBalls.java makes use of an Observer pattern to communicate colour changes to each of the balls, when the buttons are clicked. This pattern is currently incomplete. Add code to ColorPublisher.java to complete the pattern, (i) allowing each ball to subscribe to the ColorPublisher when it calls the addSubscriber() method, (ii) allowing buttons to publish colour changes to all subscribed balls, by calling ColorPublisher’s publish() method.

DO NOT change the code in BouncingBalls.java or ColorSubscriber.java. You should, however, read the code of BouncingBalls.java to understand how the ColorPublisher class is used there, and also ColorSubscriber.java which is used in both of the other files.
DO test your changes by running the app.

Now write a report answering the following questions:

(a)Paste the contents of your completed ColorPublisher.java file into the report [12 marks for correct code].
(b)Which classes make use of the ColorSubscriber interface? What do they use it for? [12 marks, max 80 words].
(c)The Observer pattern is actually a bad choice for communicating colour changes between threads in this particular application. Explain why this is so, and how the same functionality could be implemented more simply [14 marks, max 300 words].
(d)The app uses a separate thread to process the movement of each ball. Is this a good choice of approach? Why? [12 marks, max 150 words].

Learning Outcomes Assessed

This assignment particularly addresses the following module learning outcomes: 
Write code in a given programming paradigm (for example Object-Oriented) using a high-level programming language
Reflect upon the relationship between system and code design and implementation in the given programming paradigm
Critically evaluate design patterns and their applicability to different scenarios
Select and use appropriate algorithms and data structures to provide best performance in a given scenario

Criteria for assessment

Credit will be awarded against the following criteria. 

PART 1:

Distinction (70-100%) –[Q1-A, B, C] Fully working codes that demonstrate excellent understanding of the assignment problem and scenarios using a relevant Java approach. Excellent formatting of input/output, catch exception handling, the application deals well with invalid user input and doesn’t crash for any data. Excellent and consistent code layout. Appropriate use of comments. [Q1-D] All required outputs. Clear and appropriate write-up with all justified choices. 
Merit (60-69%) – [Q1-A, B, C] All required functionalities of the codes are met (with no runtime error) demonstrating good understanding of the assignment problem and scenarios using a relevant Java approach. Good formatting of input/output, catch exception handling, the application may have a few errors with invalid user input. Good and consistent code layout. Good use of comments. [Q1-D] Most of the required outputs are presented. Clear and suitable write-up with mostly justified choices. 
Pass (50-59%) –[Q1-A, B, C] Some required functionalities of the codes are met (with only minor errors) demonstrating some understanding of the assignment problem and scenarios using a relevant Java approach. Some formatting of input/output, catch exception handling, the application may have some errors with invalid user input. Some and partially consistent code layout. Some use of comments. [Q1-D] Only some required outputs. Some write-up with partially justified choices.
Fail (0-49%) - [Q1-A, B, C] Faulty codes with wrong implementation, poorly demonstrating the understanding of the assignment problem and scenarios using a relevant Java approach. Bad formatting of input/output, catch exception handling, the application has major errors with invalid user input, and crashes with most data. Poor and inconsistent code layout. No/poor use of comments. [Q1-D] No or only a few required outputs. Unclear and poor write-up with no/bad justified choices.


PART 2:
2a: 100% for fully correct, thread safe code. 50% for mostly correct code with some bugs (e.g. some, but not all balls change colour correctly). 0% for non working code. 

2b-2d: 80% of the marks are allocated for correct answers covering all key points, with lower marks awarded if e.g. some points are missed. 20% of marks remain for quality of  writing/communication.

Indicative levels of attainment for the MSc programme are as follows:
Distinction (70-100%)
Merit (60-69%)
Pass (50-59%)
Fail (0-50)


Feedback and suggestion for future learning

Feedback on your coursework will address the above criteria. Feedback and marks will be returned on 29th May 2024 via Learning Central. 

Feedback from this assignment will be useful for other programming and data structure and algorithms related modules.


Submission Instructions


Description    Type    Name
Q1    Compulsory    One PDF (.pdf) file for Q1-D    Q1_[student number].pdf
    Compulsory    One zip file containing the source code (.java files) for all parts of question 1    Q1_[student number].zip
Q2    Compulsory    One PDF (.pdf) file containing your report    Q2_[student number].pdf
    Compulsory    One zip (.zip) file containing the source code for your app (BouncingBalls.java, ColorPublisher.java, ColorSubscriber.java)    Q2_[student number].zip

Any code submitted will be run on a system equivalent to the university provided Windows/Linux laptops and must be submitted as stipulated in the instructions above. 

Any deviation from the submission instructions above (including the number and types of files submitted) may result in a mark of zero for the assessment or question part.

Staff reserve the right to invite students to a meeting to discuss coursework submissions


Support for assessment

Questions about the assessment can be asked during weekly lab classes, and on the departmental StackOverflow (StackOverflow questions must be tagged cmt-219). 

請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp





 

標簽:

掃一掃在手機打開當前頁
  • 上一篇:代做MATH1033、代寫c/c++,Java程序語言
  • 下一篇:代做COMP30023、代寫C/C++編程設計
  • 無相關信息
    昆明生活資訊

    昆明圖文信息
    蝴蝶泉(4A)-大理旅游
    蝴蝶泉(4A)-大理旅游
    油炸竹蟲
    油炸竹蟲
    酸筍煮魚(雞)
    酸筍煮魚(雞)
    竹筒飯
    竹筒飯
    香茅草烤魚
    香茅草烤魚
    檸檬烤魚
    檸檬烤魚
    昆明西山國家級風景名勝區
    昆明西山國家級風景名勝區
    昆明旅游索道攻略
    昆明旅游索道攻略
  • NBA直播 短信驗證碼平臺 幣安官網下載 歐冠直播 WPS下載

    關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 kmw.cc Inc. All Rights Reserved. 昆明網 版權所有
    ICP備06013414號-3 公安備 42010502001045

    日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

              国产亚洲毛片在线| 欧美三级不卡| 国产精品99久久久久久人| 国产精品毛片a∨一区二区三区| 久久久久久久成人| 一本久道久久综合婷婷鲸鱼| 激情综合视频| 国产美女扒开尿口久久久| 欧美日韩专区在线| 欧美激情bt| 久热综合在线亚洲精品| 欧美一级在线视频| 亚洲一区二区免费视频| 亚洲精品日韩久久| 91久久综合| 极品av少妇一区二区| 国产日韩欧美综合| 国产伦精品一区| 国产精品久久久久久久9999 | 亚洲美女诱惑| 亚洲高清在线观看| 亚洲国产精品成人va在线观看| 国产欧美日韩视频在线观看| 国产精品嫩草影院一区二区| 国产精品第三页| 国产精品福利在线观看| 国产精品扒开腿做爽爽爽视频| 欧美精品在线播放| 欧美日韩一区二区三区在线视频| 欧美高清视频www夜色资源网| 欧美国产成人在线| 欧美成人在线影院| 欧美刺激午夜性久久久久久久| 欧美成人久久| 欧美日韩精品综合在线| 国产精品对白刺激久久久| 国产精品乱码人人做人人爱| 国产欧美日韩免费| 韩国三级电影一区二区| 亚洲国产精品一区二区第一页| 亚洲日本欧美天堂| 亚洲一级电影| 久久都是精品| 欧美激情一区| 国产伦精品一区二区三区| 国产一区二区三区免费在线观看 | 噜噜噜在线观看免费视频日韩| 久久亚洲综合色| 欧美日韩黄色大片| 国产一区二区无遮挡| 亚洲国产精品久久久久秋霞影院 | 亚洲欧美日韩另类| 久久青青草综合| 欧美日韩在线播放| 国产又爽又黄的激情精品视频| 亚洲欧洲日产国产综合网| 亚洲一区二区久久| 久热精品视频在线免费观看 | 亚洲深夜福利网站| 欧美一区二区三区啪啪| 欧美成人一品| 国产亚洲综合性久久久影院| 亚洲国内在线| 久久精品91久久久久久再现| 欧美日韩国产在线播放| 在线观看91精品国产入口| 午夜久久电影网| 欧美精品久久久久a| 国产日韩成人精品| 在线一区二区三区四区| 久久一区视频| 国产热re99久久6国产精品| 一本大道久久a久久精二百| 久久婷婷国产综合精品青草| 国产精品美女久久久免费| 99国产精品私拍| 免费不卡在线视频| 激情欧美一区二区| 久久成人综合网| 国产女主播视频一区二区| 一本色道久久综合| 欧美激情综合色综合啪啪| 一区二区在线视频播放| 久久经典综合| 国产日韩欧美精品在线| 亚洲欧美中文日韩v在线观看| 欧美日韩美女| 一区二区三区高清在线| 欧美日韩精品一本二本三本| 亚洲日本电影在线| 欧美成人一二三| 亚洲精品国精品久久99热| 蜜桃av一区| 在线观看一区欧美| 免费在线观看成人av| 亚洲国产成人av| 欧美aⅴ一区二区三区视频| 亚洲高清在线| 欧美岛国激情| 99在线热播精品免费99热| 欧美日韩亚洲综合在线| 一区二区三区.www| 欧美日韩综合在线免费观看| 亚洲四色影视在线观看| 国产精品欧美精品| 久久久国产一区二区三区| 在线国产日韩| 欧美激情第3页| 亚洲在线视频免费观看| 国产日韩高清一区二区三区在线| 欧美一区二区啪啪| 一区二区亚洲精品国产| 欧美岛国激情| 午夜精品亚洲| 在线日韩电影| 欧美性开放视频| 欧美一区二区三区在线免费观看| 狠狠色丁香婷婷综合影院| 欧美福利电影在线观看| 亚洲网在线观看| 激情久久久久久久| 欧美区视频在线观看| 亚洲欧美日韩国产成人| 伊人久久亚洲影院| 国产精品久久久久9999高清| 久久久久久香蕉网| 一区二区电影免费观看| 国外成人在线视频网站| 欧美激情久久久| 久久精品日产第一区二区三区| 亚洲精品乱码久久久久久黑人| 国产精品视屏| 欧美精品三级日韩久久| 欧美一级黄色录像| 99国产精品视频免费观看一公开| 国内精品久久久久影院优| 欧美日韩成人| 狂野欧美一区| 欧美一级黄色网| 国产精品一区二区女厕厕| 亚洲综合大片69999| 亚洲国产精品热久久| 久久高清福利视频| 久久免费黄色| 亚洲欧美电影在线观看| 亚洲欧洲视频在线| 狠狠色丁香婷婷综合久久片| 欧美亚洲第一区| 免费成人av| 久热re这里精品视频在线6| 久久gogo国模啪啪人体图| 9人人澡人人爽人人精品| 亚洲国产精品va在线看黑人| 国产亚洲精品一区二555| 国产精品国码视频| 欧美色道久久88综合亚洲精品| 免费不卡在线视频| 免费观看成人| 免费欧美日韩| 欧美国产日韩a欧美在线观看| 久久综合九色99| 久久久亚洲一区| 久久久五月婷婷| 久久天堂av综合合色| 久久久免费精品视频| 久色婷婷小香蕉久久| 久久综合一区| 欧美成人在线影院| 欧美日本免费一区二区三区| 欧美高清日韩| 欧美欧美午夜aⅴ在线观看| 欧美精品三级在线观看| 欧美日韩精品免费观看视频完整| 欧美美女喷水视频| 国产精品日韩欧美大师| 国产欧美日韩不卡免费| 红桃视频欧美| 亚洲人成毛片在线播放| 99精品久久久| 亚洲私人影院| 久久久www免费人成黑人精品| 久久午夜精品| 欧美人体xx| 国产伦精品一区二区三| 1024亚洲| 一区二区激情| 久久精视频免费在线久久完整在线看| 久久久精品国产免费观看同学| 欧美成人综合网站| 欧美网站在线| 狠狠色综合色综合网络| 亚洲欧洲视频在线| 亚洲永久在线观看| 久久婷婷成人综合色| 欧美日韩精品一区二区天天拍小说 | 久久久蜜桃精品| 欧美日韩国产123| 国产有码在线一区二区视频| 亚洲黄色一区| 久久国产精品黑丝|