Given an ordered array of n elements, partition the elements into two arrays such that the elements that are <= median of the set is one subset and the elements > median of the set in the other subset The subsets should be created with the exact number of elements (use dynamic memory allocation techniques). Hint: The median is the number that falls in the middle position once the data has been organized. Organized data means the numbers are arranged from smallest to largest or from largest to smallest The median for an odd number of data values is the value that divides the data into two halves.

Given an ordered array of n elements, partition the elements into two arrays such that the elements that are <= median of the set is one subset and the elements > median of the set in the other subset The subsets should be created with the exact number of elements (use dynamic memory allocation techniques). Hint: The median is the number that falls in the middle position once the data has been organized. Organized data means the numbers are arranged from smallest to largest or from largest to smallest The median for an odd number of data values is the value that divides the data into two halves.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 13RQ: How is an array stored in main memory? How is a linked list stored in main memory? What are their...

See similar textbooks

Similar questions

How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.
In C program language, You are to read 10 numbers from a data file into an array named List. Create another 10 element array named Reverse that is to contain the same items as List but in reverse order. For example, the first element in List will be placed in the last position of Reverse, the second element in List will be placed in the second-to-last position in Reverse, etc. After Reverse has been created, output the contents of both arrays.
Best Partition You are given an array of positive numbers of size N and an integer K. You need to partition the array into K continuous segments. For each segment, the sum of its elements needs to be calculated. The segment with the minimum sum is called the bestSegment and the sum of the elements of the bestSegment is called the bestSum. For all possible combinations of partitions of the array when divided into K segments, their bestSum needs to be calculated and the one among them with maximum value needs to be returned. Input Specification: input1: an array of N positive numbers input2: an integer N denoting the length of the array input3: an integer K Output Specification: Return an integer denoting the maximum value of all possible bestSum. Example 1: input1: (1,2,3,4} input2: 4 input3: 2 Output: 4 Explanation: You can partition the given array into 2 continuous segments in the following manner- • 123 14- the sum of individual segments is (6,4) and the bestSum is 4 • 12134- the…
An array is a collection of similar data elements stored at contiguous memory locations. It is the simplest data structure where each data element can be accessed directly by only using its index number. The following is an array of unsorted numbers called NumArr. NumArr: 24 56 78 79 34 75 2 23
In C language please. You are to read 10 numbers from a data file into an array named List. Create another 10 element array named Reverse that is to contain the same items as List but in reverse order. For example, the first element in List will be placed in the last position of Reverse, the second element in List will be placed in the second-to-last position in Reverse, etc. After Reverse has been created, output the contents of both arrays.
By defining a dynamic allocation for pointer array, ask the user to enter some numbers and then return a sorted list of those numbers.
Question 1 Assume that arrX array is already defined and allocated in memory, its base address 0xabcd3000 and already stored in $a2 and its number of elements in $a3. Answer each of the next questions as required. arrX: .word 0x99,0x20,0x73,0x40,0x50,0x69, ... Please write question numbers and answer parts in this question in order. Q1) The fourth element of arrX is located at HEX address ___________ Q2) Write one MIPS instruction to copy into $t9 the value of the fourth element of arrX: ___________ Q3) Write one MIPS instruction to calculate $t0 = 32 * fourth element: __________ Q4) Write NO more than 3 MIPS instructions to decrement the fourth element of arrX: __________ Q5) Write no more than 6 instructions to calculate $v0= first element - last element in arrX.
Program 6: Sorting Data Add the Bubble Sort to minMaxArray.asm to sort the array into ascending order. Use the Bubble Sort algorithm from the lecture. You can use either Base Addressing or Indexed Addressing for the arrays. For this assignment, make sure you prompt the user for the numbers. Do not hard-code them in the data section. NOTE: Declare the array last in the Data section.
DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, complete the following: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times Maximum word count…
Assume that arrx array is already defined and allocated in memory, its base address Oxabcd3000 and already stored in Sa2 and its number of elements in Sa3. Answer each of the next questions as required. arrX: .word 0x99,0x20,0x73,0x40,0x50,0x69, ... Please write question numbers and answer parts in this question in order. Q1) The fourth element of arrX is located at HEX address Q2) Write one MIPS instruction to copy into $t9 the value of the fourth element of arrx: Q3) Write one MIPS instruction to calculate Sto = 32 * fourth element: Q4) Write NO more than 3 MIPS instructions to decrement the fourth element of arrX: Q5) Write no more than 6 instructions to calculate Svo= first element - last element in arrx.
An array is a collection of similar data elements stored at contiguous memory locations. It is the simplest data structure where each data element can be accessed directly by only using its index number. The following is an array of unsorted numbers called NumArr. NumArr: 24 56 78 79 34 75 2 23 Given the above array, demonstrate how a binary search can be performed. Indicate all the necessary operations need to be performed using an algorithm or pseudocode.
Assume that arrX array is already defined and allocated in memory, its base address and its number of elements are already stored in $a2 and $a3 correspondingly. Answer each of the next questions as required. Questions are independent. arrx: . word 0x99,0x20,0x73,0x40,0x50,0x69, Please write question numbers and answer parts in this question in order. Q1) Write no more than 7 MIPS instructions to calculate $vo: if (arrX[2]>= arrX[20] ) $v0 = arrX[2]-arrX[20]; else $v0 = arrX[20]- arrX[2]; Q2) Write no more than 12 MIPS instructions that arranges in ascending order the neighboring elements in every pair of arrX. For example, if arrX={5,2,8,20,30,15,...,9,7}, then after executing your code arrX becomes {2,5,8,20,15,30,..,7,9}.