Answered: Write a SUB PROCEDURE LoadSquared()… | bartleby

Programming Logic & Design Comprehensive

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Related questions

Question

Write a SUB PROCEDURE LoadSquared()
that receives an empty array of integers and
fills each element with the square of its
subscript (index).
If the array to pass to the procedure is called
intTest6Example, after the call
LoadSquared(intTest6Example),
intTest6Example(3) will contain 9, for
example.

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

Write a program to ask the user for the number of arrays he wants to maintain and then populate eacharray by taking elements from the user. Merge all these arrays in another array and finally remove duplicateelements from the merged array.
Given an array, find the next greater element for each element in the array, ifavailable. If not available, print the element itself. The next greater element y for anelement x in the array is the first element that is greater than x and occurs on its rightside. The next greater element of the right most element in an array is the elementitself.Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]
An array having a character subscript can be indexed using a computer language, as in CHR_ARRAY['A':'D']. In this scenario, the characters' ordinal numbers (ORDs), such as ORD('A') = 1, ORD('B') = 2, ORD('Z') = 26 and so on, are used to designate the array's elements, CHR_ARRAY['A'], CHR_ARRAY['B'], and so on. Beginning at position 500, two arrays called TEMP[1:5, -1:2] and CODE['A':'Z', 1:2] are now kept in the RAM. Furthermore, CODE outperforms TEMP in storage. Determine the locations of the following addresses: (i) TEMP[5, -1], (ii) CODE['N',2], and (iii) CODE['Z',1].
Retrieving a value using its associated key can be accomplished using anindexer, which works just like an indexer for an array. A key is passed in asthe index value, and the value associated with the key is returned, unless thekey doesn’t exist, in which a null is returned.Write short code segment demonstrates how this technique works:
The editTemperatures() method takes in two parameters: integer array tempData and integer numMore. Complete editTemperatures() to create a new array called arrayCopy with the same elements as tempData, and the size increased by numMore. Ex: If the input is: 10 48 49 18 3 then the output is: 10 48 49 18 0 0 0 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 Scannerscnr=newScanner(System.in); int[] degreesFahrenheit=newint[4]; intinput; inti; for (i=0; i<degreesFahrenheit.length; ++i) { degreesFahrenheit[i] =scnr.nextInt(); } // Read number of values to increase array size by input=scnr.nextInt(); degreesFahrenheit=editTemperatures(degreesFahrenheit, input); for (i=0; i<degreesFahrenheit.length; ++i) { System.out.print(degreesFahrenheit[i] +" "); } } }
Implement the buildDistributionArray function to take an array of scores, built by parseScores, as an argument. A grade distribution array of length 5 is returned. Loop through the scores array and tally up the number of A, B, C, D, and F scores using the standard scoring system (90 and above = A, 80‐89 = B, 70‐79 = C, etc.). Store these totals in a distribution array where the number of As is the first number, number of Bs is the second number, etc. Ex: ["45","78","98","83","86","99","59"] → [2, 2, 1, 0, 2] buildDistributionArray returns [0, 0, 0, 0, 0] when the scoresArray argument is empty.
Write method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example:(in java) Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {
given an array of integer values , return true if 6 appears as either the first or last element in the array. firstLast6([1,2,36]) true firstLast([6,1,2,3]) true firstLast([13,6,1,2,3]) false
Create a procedure bfree (p, n) that will insert an arbitrary block p of n characters into the free list kept by mal10c and free. A user can add a static or external array to the free list at any moment by calling bfree.
Implement a mergeUniqueValues(arr1, arr2) method. When passed two arrays of strings, it will return an array containing the strings that appear in either or both arrays in sorted order. And the returned array should have no duplicates. For example, if you have two string arrays: arr1: {“Bear”, “Elephant”,”Fox”}arr2: {“Panda”, “Elephant”,”Eagle”} Calling mergeUniqueValues(arr1, arr2) should return a merged and sorted array like: Bear, Eagle, Elephant, Fox, Panda
Implement a shellsort variant where the increment sequence is stored in an array rather than being computed.
Please keep the simulation neat and well organized. It is a request. Perform MergeSort on the given array. You need to show the whole simulation. A = [10,3,9,18,21,26,30,8,15,6,17].

SEE MORE QUESTIONS

Recommended textbooks for you

Programming Logic & Design Comprehensive

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

Programming Logic & Design Comprehensive

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

SEE MORE TEXTBOOKS