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

        代做COMP2013、代寫(xiě) c++/java,Python 編程

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



        COMP2013 Data Structures and Algorithms
        Programming Assignment 1 Deadline: 10:00am, 25th March, 2024
        Instructions
         Submit the soft-copy of your program to Learn@PolyU
         You can only submit one program file (either C++ or Java or Python),
         and the filename must follow the format below.
           Language
        C++
        Java Python
        Problem
        Filename format mainStudentID.cpp mainStudentID.java mainStudentID.py
        Filename example
        main10987654d.cpp main10987654d.java main10987654d.py
                       Section 1:
        Input: Output:
        An array A[0..n–1] (of comparable elements)
        The total number of pairs (i, j) such that i < j and A[i] > A[j].
         In this problem, the input can be an array of integers or an array of strings.
        (1.1) Comparisonforstrings
        We use the lexicographical order to compare strings. Let s[x] denote the x-th letter of the string s.
        Given two strings s[0..sL–1] and r[0..rL–1], s>r holdsif
        • risaprefixofs(i.e.,rL<sLand∀p=0..rL-1s[p]=r[p]) OR • there exists a position k such that s[k]>r[k] and ∀p=0..k-1 s[p]=r[p]
         Examples:
        • charge > balance • balance > bal
        • bbbbbb > bbbbba
        (1.2) Examplesfortheproblem Input
        Output Explanation
        5 5 pairs satisfy the requirement:
        (0,1), (2,3), (2,5), (3,5), (4,5).
        5 5 pairs satisfy the requirement: (0,1), (2,3), (2,5), (3,5), (4,5).
                 Example for an array of integers Example for an array of strings
        A[0..6] =
        | 31 | 24 | 85 | 76 | 93 | 50 | 93 |
        A[0..6] =
        | “charge” | “balance” | “wind” | “thunder” | “zoo” | “mile” | “zoo” |
                p. 1

        Section 2: Input and Output Format
         Here are samples of the input file and the output of your program.
        Sample input file “file1.txt” The output on screen (stdout)
             integer
        7
        31
        24
        85 76 93 50 93
           5
           Sample input file “file2.txt” The output on screen (stdout)
           string
        7
        charge
        balance
        wind
        thunder
        zoo
        mile
        zoo
           5
         The format of the input file is as follows:
         the 1st line shows the type (either integer or string),  the 2nd line shows the number of elements,
         each subsequent line shows an element.
        The number of elements is in the range 1.. 10000000.
        For integers, the elements are in the range 1..10000000.
        For strings, the elements have length at most 20 and contain lower-case letters only.
        We will run your program by a command line like:
          Language
        C++ (after compilation) Java (after compilation) Python
        Command line
        ./mainStudentID input123.txt
        java mainStudentID input123.txt python mainStudentID.py input123.txt
                   where the argument “input123.txt” is an example of the input filename. Your program should only output the result number.
        Please follow the above output format and DO NOT print any extra information.
        p. 2

        Section 3: Hints
         (3.1) Comparisonsforstrings
        You are allowed to use operator or standard library function (e.g., in C++, Java, Python) to perform lexicographic comparison for string. Examples:
        • C++: https://cplusplus.com/reference/string/string/compare/
        • Java: https://docs.oracle.com/javase/tutorial/java/data/comparestrings.html
        • Python: https://docs.python.org/3/library/stdtypes.html#comparisons Please test them before using them in your program.
        (3.2) Hintsforprogramming
        • Use a large enough integer type (e.g., long) to prevent “integer overflow” in counting.
        • A simple program is to use nested for-loops. Its time complexity is O(n2). It is acceptable for
        small input file but too slow for large input file.
        • If you wish to obtain higher marks, try to use the “divide-and-conquer” approach in your
        program. It is possible to achieve the time complexity O(n log n) time.
        • Some programming tricks can be used to speedup your program by a constant factor.
             p. 3

        Section 4: Grading Criteria
         (4.1) Namingconventions,compilationandexecutioncommands
          Before submission, rename your program to mainStudentID.cpp,
        OR mainStudentID.java, OR mainStudentID.py,
        e.g., main10987654d.cpp e.g., main10987654d.java e.g., main10987654d.py
            [C++ and Java only] Make sure that you can compile your program using the command: g++ mainStudentID.cpp -o mainStudentID
        OR javac mainStudentID.java
        o No marks will be given if your program cannot be compiled.
         We will run your program by a command line like: ./mainStudentID input123.txt
        OR java mainStudentID input123.txt
        OR python mainStudentID.py input123.txt where the argument “input123.txt” is an example of the input filename.
        Make sure that you can execute the above commands on the COMP apollo server successfully. Otherwise, no marks will be given. The current versions on apollo are as follows:
        g++ (GCC) 4.8.5, javac 1.8.0_20, Python 2.7.5
        (4.2) Testfilesforgrading
        Total marks: 100%
        Your program will be graded by using 10 test files.
        • 5 test files for integers
        • 5 test files for strings
        The running time of your program will be measured on the COMP apollo server.
        For each test file,
        if your program can produce the correct output within 1 minute, then you get +10 marks.
               p. 4

        Appendix
         (1) How to activate your COMP account?
        Please click the following link to activate your COMP account:
         https://acct.comp.polyu.edu.hk/ https://acct.comp.polyu.edu.hk/files/COMPStudentAccountSelfActivation.pdf
        (2) How to login the COMP apollo server?
         according to the instructions in:
             [Step 1]
        Use PuTTY (or any SSH client program)
        Enter the host name
        csdoor.comp.polyu.edu.hk
        Click the “Open” button.
        If you see the message “The host key is not cached for this server...”,
        just accept to continue.
             p. 5

           [Step 2]
        Enter your COMP account username and password.
        Note that, when you are entering the password, it is not displayed in PuTTY.
               [Step 3]
        Enter the hostname apollo
        Then enter your COMP account password (the same as in Step 2).
              [Step 4]
        Use WinSCP (or any SFTP client program).
        Enter the host name csdoor.comp.polyu.edu.hk Enter your COMP account username and password. Upload your program to the server.
        請(qǐng)加QQ:99515681  郵箱:99515681@qq.com   WX:codehelp

        掃一掃在手機(jī)打開(kāi)當(dāng)前頁(yè)
      1. 上一篇:COMP9315 代做、SQL 語(yǔ)言編程代寫(xiě)
      2. 下一篇:代做RISC-V、代寫(xiě) C++編程語(yǔ)言
      3. 無(wú)相關(guān)信息
        合肥生活資訊

        合肥圖文信息
        出評(píng) 開(kāi)團(tuán)工具
        出評(píng) 開(kāi)團(tuán)工具
        挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
        挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
        戴納斯帝壁掛爐全國(guó)售后服務(wù)電話(huà)24小時(shí)官網(wǎng)400(全國(guó)服務(wù)熱線(xiàn))
        戴納斯帝壁掛爐全國(guó)售后服務(wù)電話(huà)24小時(shí)官網(wǎng)
        菲斯曼壁掛爐全國(guó)統(tǒng)一400售后維修服務(wù)電話(huà)24小時(shí)服務(wù)熱線(xiàn)
        菲斯曼壁掛爐全國(guó)統(tǒng)一400售后維修服務(wù)電話(huà)2
        美的熱水器售后服務(wù)技術(shù)咨詢(xún)電話(huà)全國(guó)24小時(shí)客服熱線(xiàn)
        美的熱水器售后服務(wù)技術(shù)咨詢(xún)電話(huà)全國(guó)24小時(shí)
        海信羅馬假日洗衣機(jī)亮相AWE  復(fù)古美學(xué)與現(xiàn)代科技完美結(jié)合
        海信羅馬假日洗衣機(jī)亮相AWE 復(fù)古美學(xué)與現(xiàn)代
        合肥機(jī)場(chǎng)巴士4號(hào)線(xiàn)
        合肥機(jī)場(chǎng)巴士4號(hào)線(xiàn)
        合肥機(jī)場(chǎng)巴士3號(hào)線(xiàn)
        合肥機(jī)場(chǎng)巴士3號(hào)線(xiàn)
      4. 上海廠(chǎng)房出租 短信驗(yàn)證碼 酒店vi設(shè)計(jì)

        主站蜘蛛池模板: 国产精品一区二区久久| 亚洲国产韩国一区二区| 后入内射国产一区二区| 国产精品免费大片一区二区| 国产精品亚洲一区二区在线观看| 中文字幕乱码一区久久麻豆樱花| 亚洲一区二区三区免费在线观看| 精品国产aⅴ无码一区二区| 无码乱码av天堂一区二区| 亚洲国产欧美日韩精品一区二区三区| 亚欧在线精品免费观看一区| 亚洲国产AV无码一区二区三区| 午夜视频一区二区三区| 狠狠综合久久av一区二区| 亚洲AV无码一区二三区| 亚洲韩国精品无码一区二区三区| 日本伊人精品一区二区三区| 亚洲日韩国产一区二区三区在线| 国产一区二区三区视频在线观看 | 国产精品av一区二区三区不卡蜜| 日韩免费一区二区三区| 国产免费伦精品一区二区三区| 国产福利视频一区二区| 久久无码人妻一区二区三区| 中文字幕日韩欧美一区二区三区| 国产91一区二区在线播放不卡| 性无码一区二区三区在线观看| 91精品福利一区二区| 亚洲一区二区三区免费| 亚洲一区二区三区深夜天堂| 国产伦精品一区二区三区视频小说| 久久一区二区免费播放| 国产一区二区久久久| 久久久不卡国产精品一区二区| 蜜臀AV免费一区二区三区| 黑人一区二区三区中文字幕| 日韩精品区一区二区三VR| 麻豆一区二区三区蜜桃免费| 国产精品自拍一区| 国产精品被窝福利一区 | 无码日本电影一区二区网站|