We speak of programs’ being “partially” correct and being “totally” correct. A program is totally correct just when it does what any reasonable person would expect from its specification: if started in a situation (“state” of the computer) where its pre-condition holds, then it eventually terminates in a case where its post condition has.Are these two partially and totally in terms of what they imply about the specification for the pre-condition and post-condition? If so, explain precisely what they mean in this regard. If not, explain what is different about what they imply.

We speak of programs’ being “partially” correct and being “totally” correct. A program is totally correct just when it does what any reasonable person would expect from its specification: if started in a situation (“state” of the computer) where its pre-condition holds, then it eventually terminates in a case where its post condition has.Are these two partially and totally in terms of what they imply about the specification for the pre-condition and post-condition? If so, explain precisely what they mean in this regard. If not, explain what is different about what they imply.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter5: Looping

Section: Chapter Questions

Problem 3GZ

See similar textbooks

Similar questions

The absence of error warnings throughout the translation of a computer code is necessary but not sufficient for acceptable (programmatic) correctness, as previously stated by computer scientists Richard Conway and David Gries.Substitute another word or words for "necessary" and "sufficient" that together have the same meaning. (If it makes more sense to break it up into two sentences, by all means do so.)
I agree with Clauderlyn that a computer cannot think. Take away the formal definition of the word, I consider it that act of formulating further thoughts by onself to cause an action or a result and/or to come to a conclusion on one's own. A computer processes information that has been effected/put in by the user and provides specific output/results based on how it is programmed.
Why don't we examine the many methods of programming that exist? That begs the question, "What gives rise to the multiple paradigms?" What is the utmost importance of having them? To avoid repetition, please express it in your own words.
Formal Methods are based on logic reasoning. Conceptually the two most common logics are propositional logic and Predicate Logic. An undergraduate student who took a course of discrete mathematics is inquiring as to how propositional and predicate logics can be used in software testing. You are asked to guide this student in this quest. One pointer may consist in presenting the characteristics and limitations of both logic as well as their use as a mean for software testing. Which Logic is most adequate for formal verification of software and how this should be implemented?
Judging rules can be difficult – even for an objective computer program. In football (orsoccer as some people call it), the official rules say that the referee can allow the playto continue ‘when the team against which an offence has been committed will benefitfrom such an advantage’ and penalize ‘the original offence if the anticipated advantagedoes not ensue at that time’ (Federation Internationale de Football Association 2003).How would you implement this rule? What difficulties are involved in it?
Correct and detailed answer will upvoted else downvoted . Skip if you don't know. Monocarp is the mentor of the Berland State University programming groups. He chose to form a problemset for an instructional meeting for his groups. Monocarp has n issues that none of his understudies have seen at this point. The I-th issue has a subject man-made intelligence (an integer from 1 to n) and a trouble bi (an integer from 1 to n). All issues are unique, that is, there are no two assignments that have a similar theme and trouble simultaneously. Monocarp chose to choose precisely 3 issues from n issues for the problemset. The issues ought to fulfill somewhere around one of two conditions (potentially, both): the subjects of each of the three chose issues are unique; the troubles of every one of the three chose issues are unique. Your errand is to decide the number of ways of choosing three issues for the problemset. Input :The primary line contains a solitary integer t (1≤t≤50000) — the…
1. The halting problem is described as impossibility to know if a program (based on any programming language) will halt or not after it starts running. How would you simulate or semi-simulate the halting problem? If a simulation is possible, provide a graph or a flow chart. Explain your reasoning. If a simulation is not possible, explain your reasoning.
Could you assist me with this issue along with its associated components? Kindly provide a step-by-step explanation with thorough details, including the answers. question that I need help:4.2 Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable.
Why don't we have a look at the many programming approaches that are currently at our disposal? There are numerous. The question that has to be posed in this situation is, "What factors contribute to the existence of a plethora of distinct paradigms?" Are you left with no other option than to have them? It would be helpful if you could describe it using your own words. I would appreciate that.
Summarize the arguments for and against side-effect-free programming.
Can you describe how the Structured Programming Theorem clarifies the GOTO ambiguity and convoluted code? Write an appropriate-length essay using only your own words.
Is it possible for a single operation that is in the midst of being carried out to get halted while it is still being carried out? It is expected that any remarks you give will be backed by rational justification in some way.