final_ques - EXAM III CS536: Science of Programming Spring...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
EXAM III CS536: Science of Programming Spring 2007 Semester Wednesday, May 2 nd , 2007 Time – 3:15 to 4:30 pm Last Name: _____________ First Name: ____________ ID: ____________ SITE: __________ Q1 a 5 Q1 b 10 Q1 c 5 Q2 a 5 Q2 b 5 Q2 c 5 Q2 d 5 Q2 e 10 Q2 f 5 Q2 g 10 Q2 h 5 Q2 i 5 Q3 a 10 Q3 b 5 Q4 a 10 Q4 b 5 Q4 c 10 Total 115
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Question1 For non deterministic program S and post condition R there are two main concerns: Does S TERMINATE? (Possible cases: always, sometimes, never) Des it terminate 1n R? (Possible cases: always, sometimes, never) 1a. List the seven different characterizations of a non deterministic program S with respect to these two concerns. ( 5 points)
Background image of page 2
1b. Represent each of the above graphically (10 points) 1c. Represent each of the above as a predicate over WP(S, TRUE), WLP(S, R) and WLP(S, ┐R). (5 points)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Earliest meeting time problem Assume that there are n users f1, f2, . . fn Let the symbol ¥ represent ‘for every’ ¥i 1<i<n: fi(t) represents the earliest meeting time fi can meet at or after time t. So fi(t)≥t
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/04/2011 for the course CS 536 taught by Professor Cs536 during the Spring '08 term at Illinois Tech.

Page1 / 11

final_ques - EXAM III CS536: Science of Programming Spring...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online