合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

        CHC5223代做、java語(yǔ)言編程代寫(xiě)

        時(shí)間:2024-04-04  來(lái)源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯(cuò)



        CHC5223 Data Structures and Algorithms 2023–2024 Semester 2
        1 of 4
        Assignment 1
        Value 40% of Coursework
        Individual work
        Learning outcomes
        Students will be able to understand:
        1.1 Data structures
        1.2 The applications of data structures
        1.3 Object-oriented programming concepts
        1.4 Methods for program testing
        Students will have acquired skills in:
        2.1 Data abstraction
        2.2 The use of data structures
        2.3 Programming at a more advanced level in a high-level object-oriented language
        2.4 Program testing and documentation
        Students will have acquired skills in:
        3.1 Self-management
        3.2 Learning
        3.3 Communication
        3.4 Problem solving
        3.5 Information technology
        Submission requirements
        The assignment submitted should be compressed into a .zip file, the following files should be
        contained in the compressed file:
        • a report as a Microsoft Word document containing the code of all your classes.
        filename format: student ID+CHC5223_CW1_Report.docx
        • a .zip file containing the project: the runnable jar file (if available) and all the program’s
        source code (.java).
        filename format: student ID+CHC5223_ CW1_Files.zip
        General requirements
        All your programming must conform to “Java Conventions and Programming Guidelines” – see
        module Moodle site.
        You must paste the key source code of your implementation into your report, as text or as
        screenshots.
        Introduction
        The topics of this assignment are array, linked list, and hash table. The objective of this
        assignment is to develop a hash table data structure utilizing a double-linked list as the
        underlying mechanism.
        Requirements
        Basic rules
        You must create one executable project after completing all tasks.
        One Java class should be defined in one .java file respectively.
        CHC5223 Data Structures and Algorithms 2023–2024 Semester 2
        2 of 4
        In the report, the source code of each task, together with the corresponding explanation, should
        be presented separately.
        Failure to comply with these rules will result in zero marks.
        Task 1
        You must design and implement a doubly linked list without using any existing implementation
        in Java.
        ➢ The double-linked list should be a generic data structure that can store elements of string
        data type.
        ➢ You must create a Node class that represents each element in the doubled-linked list.
        ➢ You must create a LinkedList class that represents a doubly linked list which should include
        methods for inserting, deleting, accessing specific elements, checking empty, returning size,
        and other operations you want to implement.
        ➢ The insertion operation should be done at the front of the list.
        ➢ The implementation should include error handling to handle errors such as deleting
        elements from an empty list and accessing out-of-bounds.
         5 marks
        You must give clear rationales and detailed explanations of your design and implementation in
        the report.
        5 marks
        Task 2
        You must design and implement a hash table based on a Java array (not any array list or existing
        implementation from the Java library) and achieve the collision solution by using the linear
        probing way.
        ➢ You must create a LinearProbingHashTable class that represents a hash table by using the
        linear probing way for collision resolution. The initial capacity of the array should not
        exceed 20.
        ➢ You must devise a hash function that can work well for string-type data. The hash function
        devised should minimize the occurrence of collisions. You must not use the Java built-in
        hashCode method, though you can experiment with it.
        ➢ The implementation can handle errors such as null keys or keys with unexpected formats.
        ➢ The implementation should include methods for inserting, searching, deleting, and
        accessing key-value pairs.
        ➢ The implementation of the inserting operation can resize the table efficiently according to
        the strategy you design if the hash table is too full.
        ➢ The implementation of the deleting operation can handle the situation when the key is not
        found.
        ➢ The implementation can keep track of the load factor of the hash table and display it after
        each insertion or deletion.
        ➢ The implementation of the searching operation can search for the key and return the
        corresponding value if the key is found.
        5 marks
        You must give clear rationales and detailed explanations of your design and implementation in
        the report.
        CHC5223 Data Structures and Algorithms 2023–2024 Semester 2
        3 of 4
        5 marks
        Task 3
        You must design and implement a hash table based on the linked list and achieve the collision
        solution by using the separate chaining way.
        ➢ You must create a ChainingHashTable class that represents a hash table by using the
        separate chaining way for collision resolution.
        ➢ You must use the doubly linked list devised in task 1 to implement the separate chaining
        way. The capacity of the linked list of separate chaining should not exceed 8.
        ➢ You must devise a hash function that can work well for string-type data. The hashing
        strategy of the hash function should be designed differently from that of task 2 and should
        minimize the occurrence of collisions. You must not use the Java built-in hashCode method,
        though you can experiment with it.
        ➢ The implementation can handle errors such as null keys or keys with unexpected formats.
        ➢ The implementation should include methods for inserting, searching, deleting, and
        accessing key-value pairs, as well as determining load factor.
        ➢ The implementation of the inserting operation can resize the table efficiently if the hash
        table is too full.
        ➢ The implementation of the deleting operation can handle the situation when the key is not
        found.
        ➢ The implementation can keep track of the load factor of the hash table and display it after
        each insertion or deletion.
        ➢ The implementation of the searching operation can search for the key and return the
        corresponding value if the key is found.
        ➢ The implementation of the hash table can resize the table capacity according to the
        strategy you designed.
        5 marks
        You must give clear rationales and detailed explanations of your design and implementation in
        the report.
        5 marks
        Task 4
        You must implement a main program that engages objects of both the LinearProbingHashTable
        class and the ChainingHashTable class.
        ➢ You must design a set of test cases to evaluate the functionality and correctness of two
        different hash tables.
        • Set the capacity of the hash table to a small value so that collisions are easy to occur.
        • Verify that each of the hash functions is working well.
        • Verify that each of the implemented methods is working correctly.
        • Verify that the implementations of the Linear Probing way and Separate Chaining way
        for collision solutions are working effectively.
        ➢ The inner structure of the generated hash tables should be clearly illustrated as the
        executed result of the program.
        4 marks
        CHC5223 Data Structures and Algorithms 2023–2024 Semester 2
        4 of 4
        You must give clear rationales and detailed explanations of your design and implementation in
        the report.
        ➢ Demonstrate the executed result of the program, including the generated hash table and
        corresponding test data.
        ➢ Contrast and analyze the two hash tables generated based on the same set of test cases
        given.
        ➢ Contrast and analyze the difference between the two hash functions you devised based on
        the same set of test cases given.
        ➢ Give a rationale and detailed analysis of the effects of two different strategies of collision
        solution.
        6 marks
        total 40 marks
        Relevant quotation
        “There are two ways of constructing a software design: One way is to make it so simple that
        there are obviously no deficiencies, and the other way is to make it so complicated that there are
        no obvious deficiencies. The first method is far more difficult.”
        Professor Sir Tony Hoare
        1980 Turing Award Lecture; Communications of the ACM 24 (2), (February 1981): pp. 75-83
        Please try to do this the first way.
        Obtaining help
        It is encouraged to request further clarification on what is required for this assignment. Please
        try to do this during normal contact time and avoid asking for such help in the last week before
        the deadline.
        You can discuss the requirements and the material covered in the assignment with others but
        what you create must be all your own work. Be careful to avoid collusion.
        Declare in your report any help you have received other than that from the module teaching
        team.
        Feedback
        In addition to the written feedback that we aim to provide within the normal interval, you will be
        able to obtain fast, brief, verbal formative feedback and help on correcting your work at your
        practical classes. 

        請(qǐng)加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp

















         

        掃一掃在手機(jī)打開(kāi)當(dāng)前頁(yè)
      1. 上一篇:菲律賓大使館可以辦簽證嗎 大使館在哪
      2. 下一篇:菲律賓PWP臨時(shí)工簽辦理需要多久  好辦理嗎
      3. 無(wú)相關(guān)信息
        合肥生活資訊

        合肥圖文信息
        急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
        急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
        出評(píng) 開(kāi)團(tuán)工具
        出評(píng) 開(kāi)團(tuán)工具
        挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
        挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
        海信羅馬假日洗衣機(jī)亮相AWE  復(fù)古美學(xué)與現(xiàn)代科技完美結(jié)合
        海信羅馬假日洗衣機(jī)亮相AWE 復(fù)古美學(xué)與現(xiàn)代
        合肥機(jī)場(chǎng)巴士4號(hào)線
        合肥機(jī)場(chǎng)巴士4號(hào)線
        合肥機(jī)場(chǎng)巴士3號(hào)線
        合肥機(jī)場(chǎng)巴士3號(hào)線
        合肥機(jī)場(chǎng)巴士2號(hào)線
        合肥機(jī)場(chǎng)巴士2號(hào)線
        合肥機(jī)場(chǎng)巴士1號(hào)線
        合肥機(jī)場(chǎng)巴士1號(hào)線
      4. 短信驗(yàn)證碼 酒店vi設(shè)計(jì) NBA直播 幣安下載

        關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網(wǎng) 版權(quán)所有
        ICP備06013414號(hào)-3 公安備 42010502001045

        6一12呦女精品| 国产在线视精品麻豆| 久久久久人妻精品一区蜜桃| 国产精品 视频一区 二区三区| 亚洲日韩一区精品射精| 日韩精品电影一区亚洲| 日韩一区二区a片免费观看| 国产精品视频无圣光一区| …久久精品99久久香蕉国产| 中文字幕日韩专区精品系列| 九九热视频精品在线| 欧美日韩精品一区二区在线观看| 国产成人啪精品午夜在线播放| 精品韩国亚洲av无码不卡区| 国产精品中文久久久久久久| 亚洲精品福利你懂| 久久精品国产亚洲AV蜜臀色欲| 精品性影院一区二区三区内射| 奇米精品视频一区二区三区| 无码人妻精品一区二区在线视频| 日产国产精品亚洲系列| 亚洲日韩区在线电影| 国产精品日韩深夜福利久久| 国产福利精品视频| 国产精品jizz在线观看免费| 国产精品自在线拍国产手青青机版| 午夜精品视频任你躁| 久久精品国产精品亚洲毛片| 久久国产三级精品| 久久这里只有精品66| 久久99精品视免费看| 日韩精品久久无码中文字幕| 99精品视频在线观看免费专区| 99热精品在线免费观看| 久久国产免费观看精品3| 精品一区二区三区东京热| 91精品国产91久久| 91精品国产色综久久| 香蕉久久夜色精品国产尤物| 亚洲国产成人综合精品| 97超碰精品成人国产|