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

        代做CMPT 477、Java/Python程序代寫
        代做CMPT 477、Java/Python程序代寫

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



        CMPT **7/777 Formal Verification
        Programming Assignment 3
        This assignment is due by 11:59pm PT on Friday Nov 15, 2024. Please submit it to Canvas.
        Late policy:
        Suppose you can get n (out of 100) points based on your code and report
        • If you submit before the deadline, you can get all n points.
        • If you submit between 11:59pm PT Nov 15 and 11:59pm PT Nov 16, you get n − 10 points.
        • If you submit between 11:59pm PT Nov 16 and 11:59pm PT Nov 17, you get n − 20 points.
        • If you submit after 11:59pm PT Nov 17, you get 0 points.
        1. (20 points) Verify the program in Algorithm 1. Note that you cannot change the existing implementation.
        Algorithm 1 Find an element in the array
        method Find(a : array⟨int⟩, v : int) returns (index : int)
        ensures index ≥ 0 → index < a.Length ∧ a[index] = v
        ensures index < 0 → ∀k. 0 ≤ k < a.Length → a[k] = v
        1: var i : int := 0;
        2: while i < a.Length do
        3: if a[i] = v then
        4: return i;
        5: i := i + 1;
        6: return −1;
        2. (20 points) Verify the program in Algorithm 2. Note that you cannot change the existing implementation.
        Algorithm 2 Sum of 10n + 10(n − 1) + . . . + 10
        method Sum(n : int) returns (sum : int)
        requires n > 0
        ensures sum = 5n × (n + 1)
        1: sum := 0;
        2: var i : int := n;
        3: while i > 0 do
        4: var k : int := 0;
        5: var j : int := i;
        6: while j > 0 do
        7: k := k + 10;
        8: j := j − 1;
        9: sum := sum + k;
        10: i := i − 1;
        1
        3. (30 points) Given a non-empty array of integers, write a method called ArrayMin that finds the minimum
        value min in the array. Verify the method can ensure
        • min is less than or equal to all elements in the array
        • min is equal to some element in the array
        4. (30 points) Given an array of coins showing either Front or Back side on top, write a program with a
        SortCoins method that sorts the coins. Verify it can ensure
        • All coins showing the Front side occur before those showing Back
        • The sorted array is a permutation of the original array
        Deliverable
        A zip file called P3 SFUID.zip that contains at least the followings:
        • A file called P3 SFUID.dfy that contains Dafny programs for the above four questions.
        • A report called P3 SFUID.pdf that explains the design choices, features, issues (if any), and anything
        else that you want to explain about your programs.
        2

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

        掃一掃在手機(jī)打開當(dāng)前頁
      1. 上一篇:程序File Recovery代寫、代做C/C++編程設(shè)計(jì)
      2. 下一篇:ENGG1110代做、代寫c/c++語言編程
      3. 無相關(guān)信息
        合肥生活資訊

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

        国产精品美女网站在线看| 无码专区国产精品视频| 国语精品一区二区三区| 一区二区日韩国产精品| 日韩福利视频导航| 久久精品国产72国产精| 精品9E精品视频在线观看| 久热这里只有精品12| 亚洲国产精品无码久久久秋霞2| 久久精品国产亚洲Aⅴ香蕉| 亚洲精品美女久久久久99小说| 亚洲国产日韩在线成人蜜芽| 国产在线精品一区二区在线看 | 乱码精品一区二区三区| 久久九九亚洲精品| 99在线精品视频| 国产亚洲精品不卡在线| 国产精品1024在线永久免费| 日韩精品一区二三区中文 | 精品一区二区在线观看| 国内精品伊人久久久久网站| 国产精品青草视频免费播放| 男女男精品网站免费观看 | 2019天堂精品视频在线观看 | 日韩精品人妻系列无码av东京| 中文字幕乱码亚洲精品一区 | 日韩在线视频一区| 日韩精品久久久久久免费| 日韩精品无码永久免费网站| 国产精品成人一区无码| 国产成人精品福利色多多| 国产精品自在在线午夜出白浆| 精品国产一区二区三区在线| 成人国产精品秘片多多| 视频久re精品在线观看| MM1313亚洲精品无码久久| 国产精品无码一区二区在线| 国产精品你懂的在线播放| 午夜精品视频任你躁| 国产精品高清尿小便嘘嘘| 国产精品成人va在线观看入口|