亚洲天堂免费在线,丰满人妻在公车被猛烈进入电影,国产又黄又潮娇喘视频在线观看 ,久久黄色大片,国产女人伦码一区二区三区不卡,校花娇荡吟喘上课,亚洲区中文字幕在线不卡电影,亚洲黄色网页

合肥生活安徽新聞合肥交通合肥房產(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

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

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

    合肥圖文信息
    仿真分析咨詢外包服務(wù)-結(jié)構(gòu) / 熱 / CFD流體 / 電磁 / 光學(xué)CAE代做
    仿真分析咨詢外包服務(wù)-結(jié)構(gòu) / 熱 / CFD流體
    流體仿真外包多少錢_專業(yè)CFD分析代做_友商科技CAE仿真
    流體仿真外包多少錢_專業(yè)CFD分析代做_友商科
    CAE仿真分析代做公司 CFD流體仿真服務(wù) 管路流場仿真外包
    CAE仿真分析代做公司 CFD流體仿真服務(wù) 管路
    流體CFD仿真分析_代做咨詢服務(wù)_Fluent 仿真技術(shù)服務(wù)
    流體CFD仿真分析_代做咨詢服務(wù)_Fluent 仿真
    結(jié)構(gòu)仿真分析服務(wù)_CAE代做咨詢外包_剛強(qiáng)度疲勞振動(dòng)
    結(jié)構(gòu)仿真分析服務(wù)_CAE代做咨詢外包_剛強(qiáng)度疲
    流體cfd仿真分析服務(wù) 7類仿真分析代做服務(wù)40個(gè)行業(yè)
    流體cfd仿真分析服務(wù) 7類仿真分析代做服務(wù)4
    超全面的拼多多電商運(yùn)營技巧,多多開團(tuán)助手,多多出評(píng)軟件徽y1698861
    超全面的拼多多電商運(yùn)營技巧,多多開團(tuán)助手
    CAE有限元仿真分析團(tuán)隊(duì),2026仿真代做咨詢服務(wù)平臺(tái)
    CAE有限元仿真分析團(tuán)隊(duì),2026仿真代做咨詢服
  • 豆包網(wǎng)頁版入口 Trae 目錄網(wǎng) 排行網(wǎng)

    關(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