Consider the following statements: 1) my program has a compile-time bug or a run-time bug or a logic bug. 2) my program compiles successfully if and only if my program does not have a compile-time bug. 3) my program has a run-time bug if and only if my program crashes. 4) my program compiles successfully and it did not crash. a) please create sentential variables that correspond to the atomic propositions in the above statements. b) translate these sentences one by one into 4 logical expressions. c) what can be concluded from these sentences if all were true. Explain?

Consider the following statements: 1) my program has a compile-time bug or a run-time bug or a logic bug. 2) my program compiles successfully if and only if my program does not have a compile-time bug. 3) my program has a run-time bug if and only if my program crashes. 4) my program compiles successfully and it did not crash. a) please create sentential variables that correspond to the atomic propositions in the above statements. b) translate these sentences one by one into 4 logical expressions. c) what can be concluded from these sentences if all were true. Explain?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Consider the following programming problem: The values of three integer variables—first, second, and third—must be placed in the three variables max, mid, and min, with the obvious meanings, without using arrays or user-defined or predefined subprograms. Write two solutions to this problem, one that uses nested selections and one that does not. Compare the complexity and expected reliability of the two.
c) Express each of these statements using quantifiers. Form the negation of each: (i) Some old dogs can learn new tricks. (ii) No rabbit knows calculus. (iii) Every bird can fly. (iv) There is no dog that can talk (v) There is no one in this class who knows French and Russian
Compute the weakest precondition for each of the following assignment statements and postconditions. x = 2 * y -5; y = x + 2; {y < 2}
:Create the logic for the dice game Pig, in which a player can compete with the computer. The objectof the game is to be the first to score 100 points. The user and computer take turns “rolling” a pair of dicefollowing these rules:• On a turn, each player rolls two dice. If no 1 appears, the dice values are added to a running total for theturn, and the player can choose whether to roll again or pass the turn to the other player. When a player passes,the accumulated turn total is added to the player’s game total.• If a 1 appears on one of the dice, the player’s turn total becomes 0; in other words, nothing more isadded to the player’s game total for that turn, and it becomes the other player’s turn.• If a 1 appears on both of the dice, not only is the player’s turn over, but the player’s entire accumulatedtotal is reset to 0.• When the computer does not roll a 1 and can choose whether to roll again, generate a random valuefrom 1 to 2. The computer then will decide to continue when the…
Specify true (T) or false (F) for each of the following statements.(a) In dynamically typed languages, a type error is unnoticed if the statement containing the error is neverexecuted.Answer: true false(b) In OCaml fold right is tail recursive while fold left is not.Answer: true false(c) Immutability fits the functional programming paradigm. Mutability fits the imperative programmingparadigm.Answer: true false(d) Higher order functions are the functions that run with higher than O(n) time complexity.Answer: tree false(e) In every programming language, code must be compiled before it is run.Answer: true false(f) Every language that is a regular language is also a context-free language.Answer: true false(g) Regular expression and finite state automaton are equivalently powerful.Answer: true false(h) Lambda calculus is Turing-complete.Answer: true false
For the following, compute the weakest precondition for the following assignment statement given the postcondition. y = 2y – 1 { y > 1}
Compute the weakest precondition for each of the following sequencesof assignment statements and their postconditions:1. a = 2 * b + 1;b = a - 3{b < 0}2. a = 3 * (2 * b + a);b = 2 * a - 1{b > 5}
Consider the following predicates:Student(x): x is a studentSmart(x): x is smartLoves(x, y): x loves yTakes(x, z): x takes zand the following domains:domain of x and y: {all UB students}domain of z: {the courses offered by UB CSE}Express each of the following statements using quantifiers, logical connectives, and the predicates givenabove. You may use variables, other than x and y, when/if needed.Note: Alice and Bob are UB students. CSE115 is a course offered by UB CSE.a) There exists a smart student.b) Every student loves some other student.c) There is a student who is loved by every other student.d) Alice doesn’t take CSE 115.e) No student loves Bob.
** **** Exercise: 3 stars, standard (swap_exercise) Write an Imp program [c] that swaps the values of [X] and [Y] and show that it satisfies the following specification: {{X <= Y}} c {{Y <= X}} Your proof should not need to use [unfold valid_hoare_triple]. Hints: - Remember that Imp commands need to be enclosed in <{...}> brackets. - Remember that the assignment rule works best when it's applied "back to front," from the postcondition to the precondition. So your proof will want to start at the end and work back to the beginning of your program. - Remember that [eapply] is your friend.) *) Definition swap_program : com (* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted. Theorem swap_exercise : {{X <= Y}} swap_program {{Y <= X}}.Proof. (* FILL IN HERE *) Admitted.(** [] *)From the book software Foundations Volume 2 coq proof
The output of the following program has to be as below: Output: 1. Parent process ID : 02. Child process ID: ....3. Grand Child process ID: ...4. Grand Child process ID: .... 5. Grand Child process ID: ... But when I run the code, the Grand Child processes are not displaying in sequential order as shown in the output. I am trying to write a C program such that the parent process will create one child process and 3 grandchild processes and print their IDs. The Grand Child processes must appear in order of 3,4 and 5. I am attaching my code below. Please tell me what should I change in the code to get the desired output. My Code: #include <stdio.h>#include <sys/types.h>#include <unistd.h>#include <sys/wait.h>int main() {printf("1. Parent process ID: %d\n", getpid());pid_t child;child = fork();if (child<0) {printf("error");}else if (child==0) {printf("2. Child process ID: %d\n", getpid());for (int i=3; i<=5; i++) {pid_t grandchild = fork();if…
Asymptotic function relationships. Verify each of the following statements by the definitions to see if they are true or false 1. If ?(?) = Θ(?), then ??(?) = Θ(?2 ) 2. If ?(?) = ?(?2 ) and ?(?) = Ω(?(?)), then ?(?) = ?(?2) 3. If ?(?) = ?(0. 5?2 ) and ?(?) = Ω(7?2 + ?????), then ?(?) = Θ(?2 ) 4. If ?(?) = ?(?3 ), then ?(?) = Ω(2?3 ) 5. If ?(?) = Θ(?3 ), then ?(?) = ?(2n )
Solve the following questions: a)Solve the following postfix expressions i)2 3 + 1 - ii)3 4 - 10 + 7 2 3 * - 9 * /a) Convert the following infix to postfix expressions i)2 * 3 - 5 / 2 + 4 ii)1 * 2 * 3 * 4