Mirror Multidimensional ArrayCode in C language main.c>TestsExecutions5. Mirror Multidimensional Arrayby CodeChum AdminÇE Run TestsI'm stuck in a hall of mirrors! I was told that there was only oneway for the exit to be revealed to me, and that is if I canTest Casesdetermine whether the multidimensional array shown in themirror looks the same as the one l'm currently holding! Youneed to help me get out, I'm begging you!O Test CaselYour OutputInputNo Output1. Number of rows of the multidimensional arrayExpected OutputConstraintsThe value is >= 2.Enter the number of rows: 3Enter the number of columns: 32. Number of columns of the multidimensional array4 3 4Constraints3 8 3The value is >= 2.10 1 10mirror3. Values of the multidimensional array.OutputThe first line will containmessage prompt to input theO Test Case 2number of rows.The second line will contain a message prompt to input thenumber of columns.O Test Case 3The succeeding lines will prompt to input the values of themultidimensional array.The last line will contain the message "mirror" - if the array isO Test Case 4a mirror, and "not" - if the array is not a mirror.Enter the number of rows: 3O Test Case 5Enter the number of columns: 343 438 3O Test Case 6 Hidden10 1-10mirrorO Test Case 7Hidden

- We need to code for checking if the array is a mirror or not. - The problem can be solved by…

main.c Tests Executions 5. Mirror Multidimensional Array by CodeChum Admin G un Testa Im stuck in a hall of mirorst iwas told that there was only one way for the exit to be revealed to me, and that isi sitican Test Cases determine whether the multidimensional array shown in the mirror looks the same as the one m currently holding You need to help me get out, m begging yout O Test Case 1 Your Output Input No Output 1. Number of rows of the multidimensional array Expected Output Constraints The value is2. Enter the nunber of rous: 3 Enter the nunber of colums: 3 2. Number of columns of the multidimensional array 434 Constraints The value is 2 1e 1 1e nirror r 3. Values of the multidimensional array. Output O Test Case 2 The first line wil contain a message prompt to input the number of rows The second line will contain a message prompt to input the O Test Case 3 number of columns. The succeeding lines will prompt to input the values of the multidimensional array The last line will contain the message "miror the array is a miror, and "not-f the array is not a mirrr. O Test Case 4 Enter the nunber of rous: 3 O Test Case S Enter the nunber of coluns: 3 O Test Case 6 Haden 1e 1 10 nirror O Test Case 7 Haen

main.c Tests Executions 5. Mirror Multidimensional Array by CodeChum Admin G un Testa Im stuck in a hall of mirorst iwas told that there was only one way for the exit to be revealed to me, and that isi sitican Test Cases determine whether the multidimensional array shown in the mirror looks the same as the one m currently holding You need to help me get out, m begging yout O Test Case 1 Your Output Input No Output 1. Number of rows of the multidimensional array Expected Output Constraints The value is2. Enter the nunber of rous: 3 Enter the nunber of colums: 3 2. Number of columns of the multidimensional array 434 Constraints The value is 2 1e 1 1e nirror r 3. Values of the multidimensional array. Output O Test Case 2 The first line wil contain a message prompt to input the number of rows The second line will contain a message prompt to input the O Test Case 3 number of columns. The succeeding lines will prompt to input the values of the multidimensional array The last line will contain the message "miror the array is a miror, and "not-f the array is not a mirrr. O Test Case 4 Enter the nunber of rous: 3 O Test Case S Enter the nunber of coluns: 3 O Test Case 6 Haden 1e 1 10 nirror O Test Case 7 Haen

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Mirror Multidimensional Array

Code in C language

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1 ::

VIEW

Step 2 :: The code ::

VIEW

Step 3 :: The output ::

VIEW

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

ScenarioI want to create an INDEXCEPTION value of the unique vowels and unique consonants that the name that was given to you can create.InputA string of the name that was GIVEN TO YOU. CASE SENSITIVE.ProcessStep 1: For every unique vowel of a name, you need to get the first index of that vowel from the original string.Step 2: For each vowel index you get from step 1, you will get the unique consonant from that position. if the index is out of scope of the consonant array, ignore that vowel index.Step 3: For each unique consonant that you get from step 2, you need to get the first index of that consonant from the original string.Step 4: Get the value of indexception by adding all index you get from step 3.OutputTO BE DISPLAYED- 2 lists that consists of unique vowels and unique consonants- The vowel, the vowel index, the consonant, the consonant indexFINAL OUTPUT- The total indexception value of the name that was given to you.
For some reason I have 2 programs that aren't running. This is the second one, please let me know if everything is correct. (And I have tried changing class to main but that doesn't work) My code: class Program12two {//PSEUDOCODE //Write a program that creates a small (6-10) array of ints //Display your array elements, all on one line, using a foreach loop //In a try block, prompt the user to enter an index for the array and attempt to print the element with that index //Follow the try block with two catch blocks: //one that detects an index out of bounds //another that catches other bad inputs public static void main(String[] args) { Scanner in = new Scanner(System.in); int[] arr = {12, 15, 24, 5, 9, 16}; for (int num: arr) { System.out.print(num + " "); } System.out.println(); try { System.out.print("Enter any index of your array "); int index =…
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) {
Given the following setup code, show what is printed in each of the 8 code snippets that follow. int array[10] = { 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 }; int * p; p = array;cout << *p << endl; p = &(array[4]);cout << *p << endl; p = array+5;cout << *p << endl; p = array+5;cout << p[-1] << endl; p = array+10;cout << p[-1] << endl; p = array;p += 12;p -= 4;cout << *p << endl; p = array+10;cout << p-array << endl; p = array;cout << *(p++) << ' ';cout << *p << endl;
Can someone look at my code and tell me why my sequential access was slower than my random access. I thought random was supposed to be slower most of the time. #include <stdio.h> #include <stdlib.h> #include <time.h> #define ARRAY_SIZE (1 << 24) void sequentialAccess(int* array) { for (int i = 0; i < ARRAY_SIZE; ++i) { array[i] += 1; // Accеssing еach еlеmеnt sеquеntially } } void randomAccess(int* array, int stride) { for (int i = 0; i < ARRAY_SIZE; i += stride) { array[i] += 1; // Accеssing еlеmеnts with a spеcifiеd stridе } } int main() { int* largeArray1 = (int*)malloc(ARRAY_SIZE * sizeof(int)); int* largeArray2 = (int*)malloc(ARRAY_SIZE * sizeof(int)); for (int i = 0; i < ARRAY_SIZE; ++i) { largeArray1[i] = i; largeArray2[i] = i; } clock_t startTimeSeq = clock(); sequentialAccess(largeArray1); clock_t endTimeSeq = clock(); clock_t startTimeRand =…
Question 11 mah.What does the following code do? What happens if the second argument (i.e., the empty array) is removed from the call to useEffect()?useEffect(() => {tryLocalSignin()}, []) Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Write a program that does the following Declare and create an array named numbers that will hold 6 doublesManually fill the array by assigning values to each indexDeclare an integer array numbers2 that creates and assigns values to indexes in one statementWrite two loops that print each arrayNow, instead of having to write two separate loops that print the arrays create a method and an overloaded method printArray that does the followingAccepts a single parameter of an arrayUses a loop to print the array Sample Output: 23.93 9.4 14.02 1.0 33.333 19.91 47 64 5 100 8 92
Analyze the below code and answer the questions: #include <stdio.h> void add10 (int A[],int m); int main(void) { int Array2 [5]={11,21,31,41,51}; add10(Array2,5); for (int i=0;i<5; i++) { printf("Array2 [%d] after modification = %d \n", i,Array2 [i]); } return 0; } void add10 (int A[],int m){ for (int a = 0;a < m; a++) { A[a] = A[a]+10; } return; } Explain what does this code do? What is the size of Array2 [] ? What is the Array2 [4] value after the modification ? Change the size of Array2 to be 7 elements {……61,71}?
JAVA PROGRAM PLEASE MODIFY THIS PROGRAM SO WHEN I UPLOAD IT TO HYPERGRADE IT PASSES ALL TEST CASES. BECAUSE IT DOES NOT PASS ALL THE TEXT CASES. IT ONLY PASSES 8 PUT OF 16 TEXT CASES. ALL LENGHTS, HEIGHS AND ARRAY ELEMENTS ARE IN THREE DIGITS AFTER THE DEICIMAL POINT. ALSO, WHEN YOU TYPE BADFILE.TXT IT SHOULD SAY AFER THAT Please enter the file name AGAIN or type QUIT to exit:\n THEN YOU TYPE IN THE FILE NAME. I PROVIDED SCREENSHOTS OF THE FAILED TEST CASES.AND THE INPUTS. import java.io.*;import java.util.*;public class ArrayListOperations { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while(true) { System.out.print("Please enter the file name or type QUIT to exit:\n"); String filename = scanner.nextLine(); if(filename.equalsIgnoreCase("QUIT")) { break; } File file = new File(filename); if(!file.exists()) {…
explain what the program due in letters. #include <iostream> using namespace std; class Vec { public: Vec() { arr = new int[1]; this->cap= 1;//we start with cap=1 then we reserve to cap =10 ,and then when sz=cap we double the cap this->sz= 0; } int size() { return this->sz; } int capacity() { return this->cap; } void reserve( int n )//me:here we creat new arr with double capacity and move the old array to this new cap { // TODO: // (0) check the n should be > size, otherwise // ignore this action. if ( n > sz ) { // (1) create a new int array which size is n // and get its address int *newarr = newint[n]; // (2) use for loop to copy the old array to the // new array int i; for(i=0;i<sz;i++) { newarr[i] = this->arr[i]; } // (3) update the variable to the new address //me: to remember the old arr int* oldarr = this->arr;//by that we copy they old arr to the new arry and we still able to remeber the old arr this->arr = newarr; // (4) delete old…
You are provided a 2 dimensional array is created by the statement: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 What value is accessed by the following statements: num[1][7] = _________________ num[0][5] = __________________ num[1][4]= ___________________ num[0][9]= _____________________ num[1][0]=_____________________ Extra Credit: What is a common property of the values in the area? You are implementing a Stack of chars The following statements are issued: push (‘a’) push (‘b’) push (‘c’) push (‘d’) pop() push(‘z’) pop() push(‘e’) push(‘f’) push (‘g’) pop() Display a representation of the stack at the end of the operations above from top to bottom. You must label the top and bottom. You have a queue of numbers and you issue the following instructions: (10 pts.) add(33) add(57) add(75) add(12) remove() remove() add(101) add(99) remove() add(67) remove() add(33) remove() List…
javascript 7. Create a function that filters out negative numbers In this challenge, you'll have a function that takes an array as an input and returns an array. But if all goes according to plan, it'll remove the negative numbers. This is another example of a task that'll be useful when combing through data and looking for clever ways to eliminate "bad data."