Write and test a procedure Swap, which takes two integers as parameters and returns the first value passed to the procedure as the second value returned by the procedure and vice versa.

Question

Asked on May 6, 2026Computer Science

This computer science problem involves algorithmic thinking and programming concepts. The solution below explains the approach, logic, and implementation step by step.

Accepted Answer · 2026-05-06T13:30:30.177Z

Fresh day N.D, let's solve. Here are the solutions for the programming tasks: Task 35: Swap Write and test a procedure Swap, which takes two integers as parameters and returns the first value passed to the procedure as the second value returned by the procedure and vice versa. Step 1: Define the Swap procedure. The procedure will take two integer parameters by reference, use a temporary variable to hold one value, and then perform the swap. &PROCEDURE Swap(BY REFERENCE A: INTEGER, BY REFERENCE B: INTEGER) \\ & DECLARE Temp: INTEGER \\ & Temp A \\ & A B \\ & B Temp \\ &END PROCEDURE \\ \\ &Example Usage: \\ &DECLARE Num1: INTEGER \\ &DECLARE Num2: INTEGER \\ &Num1 10 \\ &Num2 20 \\ &OUTPUT "Before swap: Num1 = ", Num1, ", Num2 = ", Num2 \\ &CALL Swap(Num1, Num2) \\ &OUTPUT "After swap: Num1 = ", Num1, ", Num2 = ", Num2 \\ &// Expected output: Before swap: Num1 = 10, Num2 = 20 \\ &// After swap: Num1 = 20, Num2 = 10 The Swap procedure is defined to exchange the values of two integer variables passed by reference. Task 36: Sort Write and test a procedure Sort, which takes two integers as parameters and returns them in ascending order. For example, if No1 contained 5 and No2 contained 3, then the call Sort(No1, No2) will leave the value 3 in No1 and the value 5 in No2. Step 1: Define the Sort procedure. The procedure will take two integer parameters by reference. It will compare the two numbers and, if they are not in ascending order, it will call the Swap procedure (from Task 35) to reorder them. &PROCEDURE Sort(BY REFERENCE No1: INTEGER, BY REFERENCE No2: INTEGER) \\ & IF No1 > No2 THEN \\ & CALL Swap(No1, No2) \\ & END IF \\ &END PROCEDURE \\ \\ &Example Usage: \\ &DECLARE X: INTEGER \\ &DECLARE Y: INTEGER \\ &X 5 \\ &Y 3 \\ &OUTPUT "Before sort: X = ", X, ", Y = ", Y \\ &CALL Sort(X, Y) \\ &OUTPUT "After sort: X = ", X, ", Y = ", Y \\ &// Expected output: Before sort: X = 5, Y = 3 \\ &// After sort: X = 3, Y = 5 \\ \\ &X 2 \\ &Y 7 \\ &OUTPUT "Before sort: X = ", X, ", Y = ", Y \\ &CALL Sort(X, Y) \\ &OUTPUT "After sort: X = ", X, ", Y = ", Y \\ &// Expected output: Before sort: X = 2, Y = 7 \\ &// After sort: X = 2, Y = 7 The Sort procedure ensures that the two input numbers are arranged in ascending order. Task 37: Diamond of Stars Using procedures, write a program that asks the user to enter an odd number, validates the number, and then displays a diamond of stars based on that number. For example, the value 7 would produce: ` ` Step 1: Define the PrintDiamond procedure. This procedure will take the odd number N as input and print the diamond pattern. &PROCEDURE PrintDiamond(N: INTEGER) \\ & DECLARE midRow: INTEGER \\ & DECLARE row: INTEGER \\ & DECLARE numStars: INTEGER \\ & DECLARE numSpaces: INTEGER \\ \\ & midRow (N + 1) / 2 \\ \\ & // Upper half of the diamond (including the widest row) \\ & FOR row FROM 1 TO midRow \\ & numSpaces midRow - row \\ & numStars 2 × row - 1 \\ & FOR i FROM 1 TO numSpaces \\ & OUTPUT " " \\ & NEXT i \\ & FOR i FROM 1 TO numStars \\ & OUTPUT "*" \\ & NEXT i \\ & OUTPUT NEWLINE \\ & NEXT row \\ \\ & // Lower half of the diamond \\ & FOR row FROM midRow - 1 DOWN TO 1 \\ & numSpaces midRow - row \\ & numStars 2 × row - 1 \\ & FOR i FROM 1 TO numSpaces \\ & OUTPUT " " \\ & NEXT i \\ & FOR i FROM 1 TO numStars \\ & OUTPUT "*" \\ & NEXT i \\ & OUTPUT NEWLINE \\ & NEXT row \\ &END PROCEDURE Step 2: Write the main program to get input, validate, and call the procedure. &PROGRAM DiamondPattern \\ & DECLARE UserNum: INTEGER \\ & DECLARE isValid: BOOLEAN \\ \\ & isValid FALSE \\ & WHILE NOT isValid \\ & OUTPUT "Enter an odd number (e.g., 7): " \\ & INPUT UserNum \\ & IF UserNum > 0 AND UserNum MOD 2 = 1 THEN \\ & isValid TRUE \\ & ELSE \\ & OUTPUT "Invalid input. Please enter a positive odd number." \\ & END IF \\ & END WHILE \\ \\ & CALL PrintDiamond(UserNum) \\ &END PROGRAM The program prompts the user for an odd number, validates the input, and then uses the PrintDiamond procedure to display the star pattern. Send me the next one 📸

Accepted Answer · 2026-05-06T13:30:30.177Z

Fresh day N.D, let's solve. Here are the solutions for the programming tasks: Task 35: Swap Write and test a procedure Swap, which takes two integers as parameters and returns the first value passed to the procedure as the second value returned by the procedure and vice versa. Step 1: Define the Swap procedure. The procedure will take two integer parameters by reference, use a temporary variable to hold one value, and then perform the swap. &PROCEDURE Swap(BY REFERENCE A: INTEGER, BY REFERENCE B: INTEGER) \\ & DECLARE Temp: INTEGER \\ & Temp A \\ & A B \\ & B Temp \\ &END PROCEDURE \\ \\ &Example Usage: \\ &DECLARE Num1: INTEGER \\ &DECLARE Num2: INTEGER \\ &Num1 10 \\ &Num2 20 \\ &OUTPUT "Before swap: Num1 = ", Num1, ", Num2 = ", Num2 \\ &CALL Swap(Num1, Num2) \\ &OUTPUT "After swap: Num1 = ", Num1, ", Num2 = ", Num2 \\ &// Expected output: Before swap: Num1 = 10, Num2 = 20 \\ &// After swap: Num1 = 20, Num2 = 10 The Swap procedure is defined to exchange the values of two integer variables passed by reference. Task 36: Sort Write and test a procedure Sort, which takes two integers as parameters and returns them in ascending order. For example, if No1 contained 5 and No2 contained 3, then the call Sort(No1, No2) will leave the value 3 in No1 and the value 5 in No2. Step 1: Define the Sort procedure. The procedure will take two integer parameters by reference. It will compare the two numbers and, if they are not in ascending order, it will call the Swap procedure (from Task 35) to reorder them. &PROCEDURE Sort(BY REFERENCE No1: INTEGER, BY REFERENCE No2: INTEGER) \\ & IF No1 > No2 THEN \\ & CALL Swap(No1, No2) \\ & END IF \\ &END PROCEDURE \\ \\ &Example Usage: \\ &DECLARE X: INTEGER \\ &DECLARE Y: INTEGER \\ &X 5 \\ &Y 3 \\ &OUTPUT "Before sort: X = ", X, ", Y = ", Y \\ &CALL Sort(X, Y) \\ &OUTPUT "After sort: X = ", X, ", Y = ", Y \\ &// Expected output: Before sort: X = 5, Y = 3 \\ &// After sort: X = 3, Y = 5 \\ \\ &X 2 \\ &Y 7 \\ &OUTPUT "Before sort: X = ", X, ", Y = ", Y \\ &CALL Sort(X, Y) \\ &OUTPUT "After sort: X = ", X, ", Y = ", Y \\ &// Expected output: Before sort: X = 2, Y = 7 \\ &// After sort: X = 2, Y = 7 The Sort procedure ensures that the two input numbers are arranged in ascending order. Task 37: Diamond of Stars Using procedures, write a program that asks the user to enter an odd number, validates the number, and then displays a diamond of stars based on that number. For example, the value 7 would produce: ` ` Step 1: Define the PrintDiamond procedure. This procedure will take the odd number N as input and print the diamond pattern. &PROCEDURE PrintDiamond(N: INTEGER) \\ & DECLARE midRow: INTEGER \\ & DECLARE row: INTEGER \\ & DECLARE numStars: INTEGER \\ & DECLARE numSpaces: INTEGER \\ \\ & midRow (N + 1) / 2 \\ \\ & // Upper half of the diamond (including the widest row) \\ & FOR row FROM 1 TO midRow \\ & numSpaces midRow - row \\ & numStars 2 × row - 1 \\ & FOR i FROM 1 TO numSpaces \\ & OUTPUT " " \\ & NEXT i \\ & FOR i FROM 1 TO numStars \\ & OUTPUT "*" \\ & NEXT i \\ & OUTPUT NEWLINE \\ & NEXT row \\ \\ & // Lower half of the diamond \\ & FOR row FROM midRow - 1 DOWN TO 1 \\ & numSpaces midRow - row \\ & numStars 2 × row - 1 \\ & FOR i FROM 1 TO numSpaces \\ & OUTPUT " " \\ & NEXT i \\ & FOR i FROM 1 TO numStars \\ & OUTPUT "*" \\ & NEXT i \\ & OUTPUT NEWLINE \\ & NEXT row \\ &END PROCEDURE Step 2: Write the main program to get input, validate, and call the procedure. &PROGRAM DiamondPattern \\ & DECLARE UserNum: INTEGER \\ & DECLARE isValid: BOOLEAN \\ \\ & isValid FALSE \\ & WHILE NOT isValid \\ & OUTPUT "Enter an odd number (e.g., 7): " \\ & INPUT UserNum \\ & IF UserNum > 0 AND UserNum MOD 2 = 1 THEN \\ & isValid TRUE \\ & ELSE \\ & OUTPUT "Invalid input. Please enter a positive odd number." \\ & END IF \\ & END WHILE \\ \\ & CALL PrintDiamond(UserNum) \\ &END PROGRAM The program prompts the user for an odd number, validates the input, and then uses the PrintDiamond procedure to display the star pattern. Send me the next one 📸

Write and test a procedure Swap, which takes two integers as parameters and returns the first value passed to the procedure as the second value returned by the procedure and vice versa.

Need help with your own homework?

More Computer Science Questions

Write and test a procedure Swap, which takes two integers as parameters and returns the first value passed to the procedure as the second value returned by the procedure and vice versa.

Need help with your own homework?

More Computer Science Questions