合肥生活安徽新聞合肥交通合肥房產生活服務合肥教育合肥招聘合肥旅游文化藝術合肥美食合肥地圖合肥社保合肥醫院企業服務合肥法律

        代寫COP3503、代做Java程序設計
        代寫COP3503、代做Java程序設計

        時間:2025-03-18  來源:合肥網hfw.cc  作者:hfw.cc 我要糾錯



        Programming Assignment 3
        COP3503
        A sense of the Future
        In the year 2200, a futuristic city relies on autonomous delivery robots to transport packages 
        across different buildings. Each robot has a limited travel range before it must return to the 
        charging station. Each building is located at a certain distance from the robot dispatch center, and 
        a robot can only serve a building if it has enough travel capacity to reach it.
        Your task is to develop a greedy algorithm that efficiently assigns robots to buildings, ensuring 
        that the maximum number of deliveries are completed before the robots run out of travel 
        distance. Each robot can deliver to multiple buildings as long as it still has enough energy. You 
        do not need to worry about reserving extra energy for the robot to return to the charging station; 
        it has a reserved energy supply for that purpose.
        Your program will read from two text files that define the available robots and the buildings they 
        need to deliver to.
        For this assignment, you must follow these requirements.
        1. You must create your solution inside a class called GreedyRobots.
        2. You have been provided with 5 text files in a zip folder called "InputTextFiles.zip".
        • Each text file contains numerical values representing distances.
        • Files named robots represent the maximum travel range of each robot.
        • Files named buildings represent the distance of each building from the dispatch 
        center.
        • The number in the filename corresponds to a test case.
        o Example: robots1.txt and buildings1.txt represent test case 1.
        3. Your class should have the following attributes:
        • An integer array that stores the maximum travel range of each robot.
        • An integer array that stores the distance of each building from the dispatch center.
        • An integer representing the number of buildings that successfully received deliveries.
        • An integer representing the number of buildings that were left unserved.
        4. The GreedyRobots class has an overloaded constructor with four parameters:
        • The first parameter represents the number of available robots.
        • The second parameter represents the number of buildings that need deliveries.
        • The third parameter represents the name of the text file containing the maximum 
        travel range of each robot.
        • The forth parameter represents the name of the text file containing the distances of 
        each building.
        5. The GreedyRobots class, has a public non static method named readFiles()
        • It reads the respective text files (robotsX.txt and buildingsX.txt).
        • It stores the values in their respective arrays.
        6. The GreedyRobots class, has a public non static method named assignDeliveries() this method 
        will solve the problem of this assignment and it must:
        • Implements a greedy algorithm to maximize the number of deliveries.
        • The method must run in O(RM) time complexity, where R represents the number of
        robots and M represents the number of buildings.
        • Your solution must follow greedy techniques covered in the lecture.
        7. The GreedyRobots class, has a public non static method named displayResults(). This 
        method will display the results computed by assignDeliveries(). Simply, you will display the 
        number of successful and unserved deliveries. Each result should be displayed on a 
        separate line.
        Example Output:
        Successful Deliveries: 8
        Unserved Buildings: 2
        Assumption you can make about this program:
        • If a robot delivers to Building 1 and still has enough energy to reach Building 2, it can 
        proceed with the delivery to Building 2 without considering the distance between Building 1 
        and Building 2. The only constraint is that the robot must have sufficient remaining energy to 
        reach the next building from the dispatch center
        Submission Guidelines
        1. Submit your Java file (GreedyRobots.java) to Canvas
        2. Your code must follow the coding style provided with the assignment.
        3. Your code must work on Eustis
        4. All text files must be in the same directory as your driver file and solution file. DO 
        NOT create subfolders! Placing files in subdirectories will prevent our batch grader from 
        running your code correctly, which will result in point deductions that cannot be 
        disputed. You can assume that all moves in the text files are valid and that there are no 
        invalid characters.
        5. Ensure that your comment header follows the correct format, similar to the Styling 
        Guide, and is placed at the very top of your file. Failure to do so, including misplacing 
        the header or formatting it incorrectly, will result in point deductions as outlined in the 
        rubric.

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

        掃一掃在手機打開當前頁
      1. 上一篇:代寫COMP 315、代做Java編程設計
      2. 下一篇:FIN41920代做、代寫R程序語言
      3. 無相關信息
        合肥生活資訊

        合肥圖文信息
        急尋熱仿真分析?代做熱仿真服務+熱設計優化
        急尋熱仿真分析?代做熱仿真服務+熱設計優化
        出評 開團工具
        出評 開團工具
        挖掘機濾芯提升發動機性能
        挖掘機濾芯提升發動機性能
        海信羅馬假日洗衣機亮相AWE  復古美學與現代科技完美結合
        海信羅馬假日洗衣機亮相AWE 復古美學與現代
        合肥機場巴士4號線
        合肥機場巴士4號線
        合肥機場巴士3號線
        合肥機場巴士3號線
        合肥機場巴士2號線
        合肥機場巴士2號線
        合肥機場巴士1號線
        合肥機場巴士1號線
      4. 短信驗證碼 酒店vi設計 NBA直播 幣安下載

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

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網 版權所有
        ICP備06013414號-3 公安備 42010502001045

        亚洲国产精品丝袜在线观看| 久久久无码精品亚洲日韩蜜桃| 久久777国产线看观看精品卜| 精品无人区无码乱码毛片国产| 日韩GAY小鲜肉啪啪18禁| 精品熟女少妇AV免费观看| 精品人妻无码区二区三区| 99在线视频精品| 久久国产精品萌白酱免费| 久久久久国产精品| 色妞www精品视频| 精品国产爽爽AV| 亚洲国产精品自产在线播放| 欧日韩不卡在线视频| 日韩制服国产精品一区| 国产精品福利久久| 无码人妻精品一区二区三区不卡| 国产手机精品一区二区| 99精品国产在热久久无毒不卡| 91久久精品国产成人久久| 99视频有精品视频免费观看| 久久九九精品国产综合喷水| 久久国产精品久久久| 亚洲精品国产精品乱码在线观看| 九九热这里只有国产精品| 国产A√精品区二区三区四区| 日韩精品无码免费专区午夜| 亚洲午夜精品一级在线播放放| 欧美日韩精品一区二区在线视频| 四库影院永久在线精品| 国产亚洲蜜芽精品久久| 国产精品JIZZ在线观看无码| 国产精品第100页| 国产剧情AV麻豆香蕉精品| 内射一区二区精品视频在线观看 | 午夜精品视频在线| 午夜精品免费在线观看| 精品无码人妻夜人多侵犯18| 91在线亚洲精品专区| 精品一区二区三区在线成人| 久久精品国产亚洲av麻豆小说|