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

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

        時間:2024-11-19  來源:合肥網hfw.cc  作者:hfw.cc 我要糾錯



        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

        掃一掃在手機打開當前頁
      1. 上一篇:程序File Recovery代寫、代做C/C++編程設計
      2. 下一篇:中國周易姓名學泰斗思想家起名大師顏廷利教授起名官網及電話號碼聯系方式地址大全
      3. 無相關信息
        合肥生活資訊

        合肥圖文信息
        出評 開團工具
        出評 開團工具
        挖掘機濾芯提升發動機性能
        挖掘機濾芯提升發動機性能
        戴納斯帝壁掛爐全國售后服務電話24小時官網400(全國服務熱線)
        戴納斯帝壁掛爐全國售后服務電話24小時官網
        菲斯曼壁掛爐全國統一400售后維修服務電話24小時服務熱線
        菲斯曼壁掛爐全國統一400售后維修服務電話2
        美的熱水器售后服務技術咨詢電話全國24小時客服熱線
        美的熱水器售后服務技術咨詢電話全國24小時
        海信羅馬假日洗衣機亮相AWE  復古美學與現代科技完美結合
        海信羅馬假日洗衣機亮相AWE 復古美學與現代
        合肥機場巴士4號線
        合肥機場巴士4號線
        合肥機場巴士3號線
        合肥機場巴士3號線
      4. 上海廠房出租 短信驗證碼 酒店vi設計

        主站蜘蛛池模板: 久久精品免费一区二区三区| 亚洲欧洲一区二区三区| 三上悠亚亚洲一区高清| 日韩精品中文字幕视频一区| 中文字幕一区二区三区免费视频 | 精品无码国产一区二区三区51安| 精品视频一区二区| 精品无码国产一区二区三区AV| 免费一区二区无码视频在线播放 | 色一情一乱一伦一区二区三区日本| 亚洲午夜精品一区二区公牛电影院 | 91久久精品午夜一区二区| 久久se精品一区精品二区| 国产高清一区二区三区四区| 日本一区二区三区免费高清在线 | 国产成人精品一区二区三区无码| 波多野结衣中文一区二区免费| 免费一本色道久久一区| 日韩中文字幕精品免费一区| 精品爆乳一区二区三区无码av| 久久久久人妻一区二区三区| 久久精品午夜一区二区福利| 91久久精品午夜一区二区| 3d动漫精品成人一区二区三| 久久毛片一区二区| 亚洲熟女www一区二区三区| 麻豆AV天堂一区二区香蕉| 精品国产一区在线观看| 国产一区二区精品久久岳√| 国产主播一区二区三区在线观看| 内射一区二区精品视频在线观看| 日韩一区二区三区精品| 色狠狠色噜噜Av天堂一区| 免费日本一区二区| 伦精品一区二区三区视频| 国产无吗一区二区三区在线欢| 日本强伦姧人妻一区二区| 国产AV午夜精品一区二区三| 无码精品一区二区三区在线| 亚洲色精品三区二区一区| 国内精品视频一区二区三区|