PROGRAMMING EXERCISE 5-3 Write a program to take two numerical lists of the same length ended with sentinel value and store the lists in array X and array Y, each of which has 20 elements. Let N be the actual number of data values in each list. Store the product of corresponding elements of array X and array Y into third array Z of size 20. Display the square root of the sum of the items in array Z. Make up your own data and be sure to test your program on at least one data set with number exactly 20 items. PROGRAMMING EXERCISE 5-4 Write a program that would store 11 numbers in a one dimensional array. Store the sum of the wo succeeding pairs in another array. Hence, only 10 integers will be stored in the second array. Sample Run: Enter eleven numbers: SUM of TWO succeeding pairs:3 579 11 13 15 17 1921 123 45678910 11

PROGRAMMING EXERCISE 5-3 Write a program to take two numerical lists of the same length ended with sentinel value and store the lists in array X and array Y, each of which has 20 elements. Let N be the actual number of data values in each list. Store the product of corresponding elements of array X and array Y into third array Z of size 20. Display the square root of the sum of the items in array Z. Make up your own data and be sure to test your program on at least one data set with number exactly 20 items. PROGRAMMING EXERCISE 5-4 Write a program that would store 11 numbers in a one dimensional array. Store the sum of the wo succeeding pairs in another array. Hence, only 10 integers will be stored in the second array. Sample Run: Enter eleven numbers: SUM of TWO succeeding pairs:3 579 11 13 15 17 1921 123 45678910 11

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

C Language Write a program to take two numerical lists of the same length ended with sentinel value and store the lists in array X and array Y, each of which has 20 elements. Let N be the actual number of data values in each list. Store the product of corresponding elements of array X and array Y into third array Z of size 20. Display the square root of the sum of the items in array Z. Make up your own data and be sure to test your program on at least one data set with number exactly 20 items.
Write a program to input a list of numbers in an array and then rearrange this array in such a waythat all the odd numbers appear in the beginning of the array and all the even numbers appear in theend of the array. E.g., if the input list is 1,4,2,7,6,5,9, then after rearrangement the list should be:1,7,5,9,4,2,6.
Write a program that reads a list of integers from input into an array and outputs "yes" if the list is sorted in ascending order between two provided positions. Otherwise, output "no". The first input specifies the number of items in the list. The next set of inputs is the list. The last two inputs are the start and end positions (inclusive). Assume the list contains less than 20 integers and position 1 is the first element. Ex: If the input is: 8 5 6 7 4 3 2 1 0 1 3 the output is: yes Ex: If the input is: 6 1 2 3 4 5 2 4 6 the output is: no
Write a program to input a list of numbers in an array and then rearrange this array in such a waythat all the odd numbers appear in the beginning of the array and all the even numbers appear in theend of the array. E.g., if the input list is 1,4,2,7,6,5,9, then after rearrangement the list should be:1,7,5,9,4,2,6. program should be in c language.
You were tasked to do programs that will illustrate the use of lists implemented using an array. One uses a sorted list, the other an unsorted list. Run the programs separately and answer the following questions. Write a program that will initially create an UNSORTED list containing the following and then run the program: Mitch Diane Jack Robbie Katherine Answer and explain the following questions below: Ifwecheckthememorylocationofeachelementinthelist,whatwoulditbe?What index represent eachelement? What happens if we add Morrie in the list? What will be its indexvalue? Whatdoesthenewlistlooklike?WheredoyouthinkMorrieshouldbeplacedand why? With the same list above (with Morrie added), delete/remove Jack. Answer and explain the following questions below: What is the new list? Identify the elements of the list and itsindex. What happened to the former location occupied byJack? Write a program that will initially create a SORTED list containing the following and then run…
(a) Write a program to input a list of numbers in an array and then rearrange this array in such a waythat all the odd numbers appear in the beginning of the array and all the even numbers appear in theend of the array. E.g., if the input list is 1,4,2,7,6,5,9, then after rearrangement the list should be:1,7,5,9,4,2,6. (b) What does the term cast refer to? Why is it used? Justify your answer by considering a suitableexample.
WRITE THE MAIN.CPP FOR THIS PROGRAM a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
Write a program to print the product of a non-empty list of integers, i.e. the result of multiplying those numbers with each other. The answer box contains a simplification of Pattern 2.6 (Aggregate) as comments, to get you started. Write the corresponding code beneath each comment. Use variable names appropriate to the problem at hand instead of the generic names used by the pattern. The first step has been done for you. For example: Input Result [5] 5 [5, 2] 10 [2, 5, 1] 10 [2, -5, 3] -30 start of code follows
Write a C program to input a list of numbers in an array and then rearrange this array in such a way that all the odd numbers appear in the beginning of the array and all the even numbers appear in theend of the array. E.g. if the input list is 1,4,2,7,6,5,9 then after rearrangement the list should be 1,7,5,9,4,2,6. One array is to be used and program should be in C language.
please answer with a proper explanation and step by step solution Question: In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. Below is how the input array is represented ARRAY [] = [50, 11, 33, 21, 40, 50, 40, 40, 21]. Below is the expected output after sorting ARRAY [] = [11, 21, 21, 33, 40, 40, 40, 50, 50]. Write a Java program called SelectionSort that takes an input array [50, 11, 33, 21, 40, 50, 40, 40, 21] and generates an output array [11, 21, 21, 33, 40, 40, 40, 50, 50]. Test your program with different testcases and provide comments.
Write a program to sort an array of random elements using quicksort as follows: Sort the arrays using pivot as the first element of the array Sort the arrays using pivot as the median of the first, last, and middle elements of the array Sort the arrays using pivot as the first element of the array. However,, when the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. Sort the array using pivot as the median of the first, last and middle elements of the array. When the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. Calculate and display the CPU time for each of the preceding four steps. Example of the median of the first, last and middle elements: 1 2 3 4 5 6 7 8 0 (median of 1, 5, 0 is 1) 8 0 1 2 3 4 5 6 7 (median of 8, 3, 7 is 7) To calculate the CPU time, use the header , and clock_t type. You need to cast the duration to float and divide it by CLOCKS_PER_SEC. Depends on the CPU of your computer, your…
Write a function / program that does the following: int moveToEnd(string a[], int n, int pos); Eliminate the item at position pos by copying all elements after it one place to the left. Put the item that was thus eliminated into the last position of the array. Return the original position of the item that was moved to the end. Here's an example: string people[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; int j = moveToEnd(people, 5, 1); // returns 1 // people now contains: "samwell" "margaery" "daenerys" "tyrion" "jon" Notwithstanding each function's behavior described above, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array.