Create a program that will create a jagged array with the following specifications: a. contains 10 rows b. the length of the first row is 1, next row is 2.and the last row is 10 c. each index contains the sum of its indexes output 1 4. 45 6 10 10 11 12 10 11 12 13 14 10 11 12 13 14 15 16 10 11 12 13 14 15 16 17 18

Create a program that will create a jagged array with the following specifications: a. contains 10 rows b. the length of the first row is 1, next row is 2.and the last row is 10 c. each index contains the sum of its indexes output 1 4. 45 6 10 10 11 12 10 11 12 13 14 10 11 12 13 14 15 16 10 11 12 13 14 15 16 17 18

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Create a program that will create a private jagged array with the following specifications: a. contains 10 rowsb. the length of the first row is 10, next row is 9…and the last row is 1c. each index contains the sum of its indexes
Create a program that will encrypt letters and create a secret code. You will create an array of numbers from 0 - 25. use [i for i in range (26)] to create an array of numbers from 0 - 25. use random.shuffle to to shuffle the above array. This will be used for a new letter index order. For example: The first created array [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25] gets shuffled to become[2, 14, 12, 20, 16, 5, 11, 1, 13, 17, 15, 21, 19, 10, 23, 22, 25, 3, 6, 7, 18, 4, 9, 24, 0, 8] This will be used as the new index for the encrypted alphabet. create an array of letters using list(string.ascii_lowercase), this requires importing the string module. This will create: ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'] Accept an input of a word. Using the above tables take each letter of the word and convert it to the encrypted letter. Print each…
Create a program that will encrypt letters and create a secret code. You will create an array of numbers from 0 - 25. use [i for i in range (26)] to create an array of numbers from 0 - 25. use random.shuffle to to shuffle the above array. This will be used for a new letter index order. For example: The first created array [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25] gets shuffled to become[2, 14, 12, 20, 16, 5, 11, 1, 13, 17, 15, 21, 19, 10, 23, 22, 25, 3, 6, 7, 18, 4, 9, 24, 0, 8] This will be used as the new index for the encrypted alphabet. create an array of letters using list(string.ascii_lowercase), this requires importing the string module. This will create: ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'] Accept an input of a word. Using the above tables take each letter of the word and convert it to the encrypted letter. Print each…
Write a computer program for searching an array consist of following numbers. [ 12 32 73 95 23 45 26 48 83 24 56 19 23 28 45 ] User enters a number for searching. If an array does not contain the number to the last row of the array. If the number is still exists, script outputs the text message " The number is already exists".
/*** creates an array of 1000 integers where each element matches its index* * @return the array that is created*/public static int[] makeNumberArray() {
RU Rotten Tomatoes . Write a program RURottenTomatoes.java that creates a 2 dimensional integer array of movie ratings from the command line arguments and displays the index of the movie that has the highest sum of ratings. Ratings range from 1 to 5 (inclusive). The rows of the 2D array correspond to movie reviewers and the columns of the 2D array correspond to movies. The reviewer at index 2 gave movie at index 0 a rating of 4. Take a look at the following example for an explanation on the command line arguments sequence. java RURottenTomatoes 3 2 5 2 3 3 4 1 0 1 0 5 2 1 3 3 2 4 1 The first argument corresponds to the number of reviewers and the second argument corresponds to the number of movies (the dimensions of the 2D integer array). Following are the movie ratings in a row-major order.…
Below you will find code blocks necessary to insert a value into an ordered array given a position (index) to insert. Be careful! Some lines are not needed. first line COMPLETED: bool insertElement(char array[ ], int& numElems, int &capacity, in position, char value) { last line COMPLETE: bool insertElement(char array[ ], int numElems, int capacity, in position, char value) {
A "peak" is an entry in an integer array that is bigger than or equal to the adjacent integers, while a "valley" is an element that is smaller than or equal to the surrounding numbers. In the array, for example, 5, 8, 6, 2, 3, 4, 6 are peaks while 5, 2 are troughs. Sort an array of numbers into an alternating series of peaks and troughs. EXAMPLEInput: {5, 3, 1, 2, 3}Output: {5, 1, 3, 2, 3}
Exercise1: Write a program that stores data for 5 students in two different arrays as follows: Name: take student’s names from the console (using Scanner object) then store their names in an array of a String data type GPA: : take student’s GPA from the console (using the same Scanner object) then store their GPAs in an array of a double data type. Exercise 5: Write a program the calculates the maximum number in an array of 10 integers. The input should be taken from the console (using a Scanner object).
Write the following method that returns the locationof the smallest element in a two-dimensional array.public static int[] locateSmallest(double[][] a)The return value is a one-dimensional array that contains two elements. Thesetwo elements indicate the row and column indices of the smallest element in thetwo-dimensional array. Write a test program that prompts the user to enter a twodimensionalarray and displays the location of the smallest element in the array.Here is a sample run: Enter the number of rows and columns of the array: 3 4↵EnterEnter the array:23.5 35 2 10↵Enter4.5 3 45 3.5↵Enter35 44 5.5 9.6↵EnterThe location of the smallest element is at (0, 2)**
Write a code segment that initializes each cell in a three-dimensional array with an integer that represents its three index positions. Thus, if a position is (depth, row, column), the integer datum at position (2, 3, 3) is 233.
An_array and a number kFind the max elements of each of its sub-arrays of length k. Keep indexes of good candidates in deque d.The indexes in d are from the current window, they're increasing,and their corresponding nums are decreasing.Then the first deque element is the index of the largest window value. For each index i: 1. Pop (from the end) indexes of smaller elements (they'll be useless).2. Append the current index.3. Pop (from the front) the index i - k, if it's still in the deque (it falls out of the window).4. If our window has reached size k, append the current window maximum to the output..