欧美一级a免费放视频,欧美一级a免费放视频_丰满年轻岳欲乱中文字幕电影_欧美成人性一区二区三区_av不卡网站,99久久精品产品给合免费视频,色综合黑人无码另类字幕,特级免费黄片,看黃色录像片,色色资源站无码AV网址,暖暖 免费 日本 在线播放,欧美com

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

代寫CS536,、代做C/C++,,Java編程
代寫CS536,、代做C/C++,,Java編程

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



CS536 Assignment 3
Due: Feb 28th, 2025
Early Bird Due: Feb 26th, 2025
(Ethics: Any behavior on any homework or exam that could be considered copying or cheating will result in an immediate zero on the assignment 
for all parties involved. See the IIT Code of Academic Honesty,)
1. Remember that Σ is the collection of all well-formed states, and Σ⊥ = Σ ∪ {⊥}. Decide true or false for each of 
the following statements, justify your answers briefly.
a. If 𝜎(𝑝) =⊥, then ⊭ ¬𝑝. 
b. Let 𝜏 ∈ Σ⊥, then 𝜏 ⊨ 𝑝 or 𝜏 ⊨ ¬𝑝.
c. Let Σ0 ⊆ Σ and Σ0 ⊨ 𝑝, also let 𝜏 ⊨ 𝑝; then Σ0 ∪ {𝜏} ⊨ 𝑝.
d. ∅ ⊨ 𝑝 and ∅ ⊨ ¬𝑝 (∅ represents an empty collection of states).
e. Let Σ0 ⊂ Σ, then Σ0 ⊨ 𝑥 > 1 or Σ0 ⊨ 𝑥 ≤ 1.
2. Calculate denotational semantics for the following nondeterministic programs.
a. Let 𝐼𝐹 ≡ 𝐢𝐟 𝑥 > 𝑦 → 𝑥 ≔ 𝑥 − 1 ◻ 𝑥 > 𝑦 → 𝑦 ≔ 𝑦 + 1 ◻ 𝑥 + 𝑦 = 4 → 𝑥 ≔ 𝑦/𝑥 ◻ 𝑥 + 𝑦 = 4 → 𝑥 ≔
𝑥/𝑦 𝐟𝐢, and let 𝜎1 = {𝑥 = 3, 𝑦 = 1}. Calculate 𝑀(𝐼𝐹, 𝜎1) and show your work.
b. Let 𝐼𝐹 ≡ 𝐢𝐟 𝑥 > 𝑦 → 𝑥 ≔ 𝑥 − 1 ◻ 𝑥 > 𝑦 → 𝑦 ≔ 𝑦 + 1 ◻ 𝑥 + 𝑦 = 4 → 𝑥 ≔ 𝑦/𝑥 ◻ 𝑥 + 𝑦 = 4 → 𝑥 ≔
𝑥/𝑦 𝐟𝐢, and let 𝜎2
(𝑥) = 𝜎2
(𝑦) = 1. Calculate 𝑀(𝐼𝐹, 𝜎2) and show your work.
c. Let 𝐷𝑂 ≡ 𝐝𝐨 𝑥 > 𝑦 → 𝑥 ≔ 𝑥 − 1 ◻ 𝑥 > 𝑦 → 𝑦 ≔ 𝑦 + 1 ◻ 𝑥 + 𝑦 = 4 → 𝑥 ≔ 𝑦/𝑥 ◻ 𝑥 + 𝑦 = 4 → 𝑥 ≔
𝑥/𝑦 𝐨𝐝, and let 𝜎1 = {𝑥 = 3, 𝑦 = 1}. Calculate 𝑀(𝐷𝑂, 𝜎1) and show your work.
d. Let 𝐷𝑂 ≡ 𝐝𝐨 𝑥 > 𝑦 → 𝑥 ≔ 𝑥 − 1 ◻ 𝑥 > 𝑦 → 𝑦 ≔ 𝑦 + 1 ◻ 𝑥 + 𝑦 = 4 → 𝑥 ≔ 𝑦/𝑥 ◻ 𝑥 + 𝑦 = 4 → 𝑥 ≔
𝑥/𝑦 𝐨𝐝, and let 𝜎2
(𝑥) = 𝜎2
(𝑦) = 1. Calculate 𝑀(𝐷𝑂, 𝜎2) and show your work.
3. Let 𝑏 be an array of size 𝑛 ≥ 1, and ∀0 ≤ 𝑖 < 𝑛. 𝑏[𝑖] = 0 ∨ 𝑏[𝑖] = 1. Decide which number (0 𝑜𝑟 1) is the 
majority in 𝑏 without counting their quantities. 
Write a program named 𝑀𝐴𝐽𝑂𝑅𝐼𝑇𝑌 in our language that can solve the above problem and bind the majority 
among 0 and 1 to variable 𝑚𝑎𝑗𝑜𝑟. You can assume that 𝑏 is written in the memory state; and to simplify the 
question, we artificially define 𝑏[𝑛] = 100, so you don’t need to worry about a possible runtime error when the 
array index reaches 𝑛. Your program doesn’t have to be deterministic. Be careful of the grammar in our 
programming language. 
Here are some hints: 
1) We can use the following linear-search-like algorithm: scan the array 𝑏 to pair up each 0 with a 1. Once we 
have some 1′𝑠 left over, then 1 is the majority; once we have some 0′𝑠 left over, then 0 is the majority; if 
we can pair up all numbers, then either of them can be the majority. 
2) A student named Jason wrote a partial solution that could be useful to solve the above problem:
𝐽 ≡ 𝐝𝐨 𝑏[𝑘0
] = 1 → 𝑘0 ≔ 𝑘0 +1 ◻ 𝑏[𝑘1
] = 0 → 𝑘1 ≔ 𝑘1 + 1 𝐨𝐝 
Consider 𝑘0 and 𝑘1 as pointers for number 0 and 1 respectively. What program 𝐽 does is to find the next 
𝑘0 and 𝑘1
such that 𝑏[𝑘0
] = 0 and 𝑏[𝑘1
] = 1. You can use 𝐽 inside of your program. 
4. Decide true or false for each of the following statements, justify your answers briefly.
a. If 𝑀(𝑆, 𝜎) contains exactly one state, then 𝑆 is a deterministic statement.
b. If 𝜎 ⊭ {𝑝} 𝑆 {𝑞}, then 𝜎 ⊨ 𝑝.
c. If 𝜎 ⊨𝑡𝑜𝑡 {𝑝} 𝑆 {𝑞}, then 𝜎 ⊭ 𝑝.
d. If 𝜎 ⊨ {𝑝} 𝑆 {𝑞}, then 𝑀(𝑆, 𝜎) ⊨ 𝑞.
e. If 𝜎 ⊭ {𝑝} 𝑆 {𝑞}, then 𝜎 ⊭𝑡𝑜𝑡 {𝑝} 𝑆 {𝑞}.
5. Answer the following questions about possible values of variable 𝑥 in a state. Justify your answer briefly.
a. Let ⊥𝑒∉ 𝑀(𝑆, 𝜎), where 𝑆 ≡ 𝑥 ∶= 𝑠𝑞𝑟𝑡(𝑥) / 𝑏[𝑥] and 𝜎(𝑏) = (3, 0,−2, 4). What are the possible values 
of 𝜎(𝑥)?
b. Let 𝜎 ⊨ {𝑥 ≠ 0} 𝐰𝐡𝐢𝐥𝐞 𝑥 ≠ 0 𝐝𝐨 𝑥 ≔ 𝑥 −2 𝐨𝐝 {𝑥 < 0}, what are the possible values of 𝜎(𝑥)?
c. Let 𝜎 ⊨𝑡𝑜𝑡 {𝑥 ≠ 0} 𝐰𝐡𝐢𝐥𝐞 𝑥 ≠ 0 𝐝𝐨 𝑥 ≔ 𝑥 − 2 𝐨𝐝 {𝑥 < 0}, what are the possible values of 𝜎(𝑥)?
6. Let predicate function 𝑃(𝑘, 𝑠) ≡ 𝑠
2 ≤ 𝑘 ≤ (𝑠 + 1)
2
. For each of the following triples, decide whether it is valid 
under total correctness, justify your answer briefly. 
a. {𝑃(𝑘, 𝑠 +1)} 𝑠 ≔ 𝑠 + 1 {𝑃(𝑘, 𝑠)}
b. {𝑃(𝑘, 𝑠)} 𝑠 ≔ 𝑠 +1 {𝑃(𝑘, 𝑠 + 1)}
c. {𝑃(𝑘, 𝑠) ∧ 𝑠 < 0} 𝑠 ≔ 𝑠 + 1; 𝑘 ≔ 𝑘 + 1 {𝑃(𝑘, 𝑠)}
d. {𝑃(𝑘, 𝑠) ∧ 𝑠 = 𝑥} 𝑠 ≔ 𝑠 + 1 {𝑃(𝑘, 𝑥)}
e. {𝑃(𝑘 +1, 𝑠 + 1)} 𝑠 ≔ 𝑠 + 1; 𝑘 ≔ 𝑘 + 1 {𝑃(𝑘, 𝑠)}
7. Let 𝜎 ⊨ {𝑝1
} 𝑆 {𝑞1
} and 𝜎 ⊨ {𝑝2
} 𝑆 {𝑞2
}. Decide whether 𝜎 necessarily satisfies the following triples under 
partial correctness, justify your answer briefly.
a. {𝑝1 ∧ 𝑝2
} 𝑆 {𝑞1 ∧ 𝑞2
}
b. {𝑝1 ∨ 𝑝2
} 𝑆 {𝑞1 ∨ 𝑞2
}
c. {𝑝1 ∨ 𝑝2
} 𝑆 {𝑞1 ∧ 𝑞2
}
8. Let ⊨𝑡𝑜𝑡 {𝑝1
} 𝑆 {𝑞1
} and ⊨𝑡𝑜𝑡 {𝑝2
} 𝑆 {𝑞2
}. Decide whether the following triples are valid under total
correctness, justify your answer briefly. 
a. {𝑝1 ∧ 𝑝2
} 𝑆 {𝑞1 ∧ 𝑞2
}
b. {𝑝1 ∧ 𝑝2
} 𝑆 {𝑞1 ∨ 𝑞2
}
c. {𝑝2
} 𝑆 {𝑞1 → 𝑞2
}
Hints for questions 7 and 8:
1) Remember that 𝜎 ⊨ 𝑝 ∧ 𝑞 means “𝜎 ⊨ 𝑝 and 𝜎 ⊨ 𝑞”; 𝜎 ⊨ 𝑝 ∨ 𝑞 means “𝜎 ⊨ 𝑝 or 𝜎 ⊨ 𝑞”.
2) To prove 𝜎 ⊨ {𝑝} 𝑆 {𝑞}, you can prove that “if 𝜎 ⊨ 𝑝,then 𝑀(𝑆, 𝜎)−⊥ ⊨ 𝑞”.
3) To prove ⊨𝑡𝑜𝑡 {𝑝} 𝑆 {𝑞}, you can prove that “for any state 𝜎, if 𝜎 ⊨ 𝑝,then 𝑀(𝑆, 𝜎) ⊨ 𝑞”.

請(qǐng)加QQ:99515681  郵箱:[email protected]   WX:codinghelp



 

掃一掃在手機(jī)打開當(dāng)前頁
  • 上一篇:菜鳥錢包全國客服電話-菜鳥錢包24小時(shí)人工服務(wù)熱線
  • 下一篇:代寫CMSC 150,、代做Python設(shè)計(jì)程序
  • ·代寫COMP S311,、代做Java編程語言
  • ·代做COMP2012J,、java編程語言代寫
  • ·ITP4206代做,、代寫c/c++,Java編程
  • ·CS425FZ代做,、代寫Java編程設(shè)計(jì)
  • ·代寫COMP3013,、代做Java編程設(shè)計(jì)
  • ·代寫COMP 250、代做java編程語言
  • ·代寫6570USST、代做c/c++,,Java編程
  • ·PROG2004代寫、代做Java編程設(shè)計(jì)
  • ·代寫ISIT312 ,、代做Java編程語言
  • ·代寫INFO1113,、Java編程設(shè)計(jì)代做
  • 合肥生活資訊

    合肥圖文信息
    急尋熱仿真分析,?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
    急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
    出評(píng) 開團(tuán)工具
    出評(píng) 開團(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)線
  • 短信驗(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