Please help me with this Principles of programming language homework question 3.18 Consider the following pseudocode:x: integerprocedure set_x(n: integer)x := nprocedure print_x()write integer (x)globalprocedure foo (S, P: function; n : integer)x : integer := 5if n in (1, 3)set_x (n)elseS (n)if n in {1, 2}print_x()elsePset_x (0); foo (set_x, print_x, 1); print_x()set_x(0); foo (set_x, print_x, 2); print_x()set_x(0); foo (set_x, print_x, 3); print_x()set_x(0); foo (set_x, print_x, 4); print_x()Assume that the language uses dynamic scoping. What does the program print if the languageuses shallow binding? What does it print with deep binding? Why?

This question comes from programming language which is a topic in computer science. In this question…

3.18 Consider the following pseudocode: x : integer procedure set_x(n: integer) x := n ➖➖➖➖ procedure print_x() global write integer (x) else procedure foo (S, P: function; n : integer) x: integer := 5 if n in (1, 3) set_x (n) else S(n) if n in {1, 2} print_x() P set_x(0); foo (set_x, print_x, 1); print_x() set_x(0); foo (set_x, print_x, 2); print_x() set_x(0); foo (set_x, print_x, 3); print_x() set_x(0); foo (set_x, print_x, 4); print_x() Assume that the language uses dynamic scoping. What does the program print if the language uses shallow binding? What does it print with deep binding? Why?

3.18 Consider the following pseudocode: x : integer procedure set_x(n: integer) x := n ➖➖➖➖ procedure print_x() global write integer (x) else procedure foo (S, P: function; n : integer) x: integer := 5 if n in (1, 3) set_x (n) else S(n) if n in {1, 2} print_x() P set_x(0); foo (set_x, print_x, 1); print_x() set_x(0); foo (set_x, print_x, 2); print_x() set_x(0); foo (set_x, print_x, 3); print_x() set_x(0); foo (set_x, print_x, 4); print_x() Assume that the language uses dynamic scoping. What does the program print if the language uses shallow binding? What does it print with deep binding? Why?

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 8SA

See similar textbooks

Similar questions

JAVA CODE PLEASE Functions With No Parameters and Return Values Quiz by CodeChum Admin Create a function named banner that prints “CodyChum” with a newline. In the main function, write a program that accepts an integer input which would serve as an inclusive stopping point of a loop iteration that starts at the value of 1. If the number that loops through the range is divisible by either 2 or 3, then call the banner function, otherwise just print the number. Input 1. One line containing an integer Output First line is the integer user input. Succeeding multiple lines containing an integer or “CodyChum” 10 1 CodyChum CodyChum CodyChum 5 CodyChum 7 CodyChum CodyChum CodyChum
def square(x): return x * X def halve(x): return x // 2 def twice(f,x): """Apply f to the result of applying f to x >>> twice (square,3) 81 >>> twice (square, 4) 256 >>> twice (halve, 32) 8 >>> twice (halve, 80) 20 *** YOUR CODE HERE ***"
/* * rotate4 - Rotate x to the left by 4 * Examples: rotate4(0x87654321) = 0x76543218 * Legal ops: ~ & ^ | + << >> ! * Max ops: 10 * Rating: 2 */int rotate4(int u) { return 2;} Do not use any control constructs such as if, do, while, for, switch, etc.
double tab1[5] = {2,3,4,5,6}; double tab2[5] = {6,5,4,3,2}; for(int i = 0;i<5;i++) { tab1[i] = tab1[i]*tab2[i]; cout<<tab1[i]<<" "; } 12 15 16 15 16 15 15 16 15 12 12 15 16 15 12 12 15 12 15 12
Write these in Pseudocode #1a – In pseudocode, write a call to a function that passes 1 Integer variable and 1 Integer array, and saves a Boolean value in return. #1b – In pseudocode, write the function that accepts 1 Integer and 1 Integer array and returns a Boolean. In the function, search the Integer array with a for-loop, and if the Integer parameter is found in the array, return false. If the Integer parameter is not found, return true. #2a – In pseudocode, write a call to a module that passes 1 Integer variable, 1 Real variable, 1 String constant, and 1 String literal as arguments. #2b – In pseudocode, write the module header that accepts 1 Integer, 1 Real, and 2 Strings as parameters. #3 – This pseudocode has multiple problems. Fix the calling statement and the definition below so that the routine accepts 3 grades as parameters and returns the average into a variable.…
GRADED ACTIVITY #6 (M8.1): REPETITION CONTROL STRUCTURE (WHILE, DO-WHILE) Instruction: A mathematician named Ulam proposed generating a sequence of numbers from any positive integer N greater than 1 using the following procedure: If N is 1, stop. If N is even, replace it with N/2. If N is odd, replace it with 3 * N + 1. Continue with this process until N reaches 1. Here are some examples of the Ulam sequence for the first few integers. 2, 1 3, 10, 5, 16, 8, 4, 2, 1 4, 2, 1 5, 16, 8, 4, 2, 1 6, 3, 10, 5, 16, 8, 4, 2, 1 Write a Java program using while/do-while that accepts as input an integer value N (assume N> 1) and prints out the Ulam sequence that begins with the input value N. Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are calculated and printed by the program): Input N: 14 Ulam Sequence: Input N: 5 Ulam Sequence: 5, 16, 8, 4, 2, 1 14, 7, 22, 11, 34, 17,…
Add an if branch to complete double_pennies()'s base case. Sample output with inputs: 1 10 Number of pennies after 10 days: 1024 Note: If the submitted code has an infinite loop, the system will stop running the code after a few seconds, and report "Program end never reached." The system doesn't print the test case that caused the reported message.
// Assume all libraries are included void QQ(int n); // int main () { // Random questions QQ (5) ; 3 4 6. 7 8. 9. 10 return 0; 11 } // void QQ(int n) 12 13 14 { if(n >= 1) { 15 16 17 cout << n; QQ (--n); } else 18 19 20 21 cout << n; 22 } // 23
#include <stdio.h> struct Single { int num; }; void printSingle(int f) { int binaryNum[33]; int i = 0; while(f>0) { binaryNum[i] = f % 2; f = f/2; i++; } for (int j=i-1; j>= 0; j--) { printf("%d",binaryNum[j]); } } int main() { struct Single single; single.num = 33; printf("Number: %d\n",single.num); printSingle(single.num); return 0; }
def tnr(tn, fp): # TODO 11.1 return defTEST_tnr(): tnr_score = tnr(tn=100, fp=40) todo_check([ (np.isclose(tnr_score,0.714285, rtol=.01),"tnr_score is incorrect") ]) TEST_tnr() garbage_collect(['TEST_tnr'])
3: The code on the right is supposed to be the ARM code for procA; however, there are problems with the ARM code. C code: int procA(int x, int y) { int perimeter = (x + y) * 2; I return perimeter; } ARM code: I procA: add rø, r1, r2 mov r1, rø lsl #1 bx lr push {lr} Give the corrected version of the ARM code for procA:
• R7.6Given the definitions double primes[] = { 2, 3, 5, 7, 11, 13 }; double* p = primes + 3; draw a diagram that explains the meanings of the following expressions: a.primes[1] b.primes + 1 c.*(primes + 1) d.p[1] e.p + 1