In phyton Using a both a for (for within a for) and a while (while within a while) nested loop, read the dimensional array below: aList = [["Red","Blue","Green"],["Cup","Plate","Bowl"],["Large","Med","Small"]] and print out its contents in a matrix as follows: Red Blue Green Cup Plate Bowl Large Med Small

In phyton Using a both a for (for within a for) and a while (while within a while) nested loop, read the dimensional array below: aList = [["Red","Blue","Green"],["Cup","Plate","Bowl"],["Large","Med","Small"]] and print out its contents in a matrix as follows: Red Blue Green Cup Plate Bowl Large Med Small

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Write simply python code for the following: Using a both a for (for within a for) and a while (while within a while) nested loop, read the dimensional array below: aList = [["Red","Blue","Green"],["Cup","Plate","Bowl"],["Large","Med","Small"]] and print out its contents in a matrix as follows: Red Blue GreenCup Plate BowlLarge Med Small
Write a code that can create a [n×m] dimensional matrix. Take the values of all the elementsfrom the user and write a code that can swap all the values of its first row with its last row. After swapping, add all the values of the last column.
Using a both a for (for within a for) and a while (while within a while) nested loop, read the dimensional array below using python: aList = [["Red","Blue","Green"],["Cup","Plate","Bowl"],["Large","Med","Small"]] and print out its contents in a matrix as follows: Red Blue Green Cup Plate Bowl Large Med Small
Java Program Your program should use 2D arrays to implement simple matrix operations. Your program should do the following: • Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order • Print M1 to the console; make sure you format as a matirx • Repeat the previous steps for a second matrix M2 • Create a matrix M3 that is the transpose of M1 and print it to the console • Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message. • Extra credit: Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements: • Use a helper method for reading a positive integer using an input validation loop. • Use a helper method for printing a matrix. Your helper methods should be private and…
What is the time complexity associated with accessing a single value in an array? The Vector class is clearly more complex than the array. What is the time complexity of accessing an element with the get method?
An array with any number of elements is said to be repeating if any two or more of the elements are appearing in sequential an indexes after each other.Write a C++ function that accepts an integer array and returns 1 or “Repeating” if it is a repeating array, otherwise it returns 0 or “Not Repeating”. For Instance:2, 3, 5, 6, 7, 7, 7, 6, 8, 10 - Repeating2, 3, 4, 6, 4, 6, 4, 7, 8, 9 - Not repeating
Please Help me with This Problem Language = C++ Take an array of name A of size 4 X 4. Take input and then take B with size 4 X 4. Add them.And show result after taking transpose.Formally, the i th row, j th column element of C T is the j th row, i th columnelement of C:1. write the rows of C as the columns of C T2. write the columns of C as the rows of C TC is an m × n matrix then C T is an n × m matrix.Then save the result in a file named “result.txt”, according the matrix spaces and newline. Note:Understand the Question Properly and Kindly Answer
Given two arrays A and B of equal size N, the task is to find a vector containing only those elements which belong to exactly one array - either A or B - but not both. That is, if some element x appears in both A and B it should not be included in the output vector. Complete the implementation of "getVector(vector<ll>A, vector<ll>B, int N)" function. Example: Input: 1 3 5 7 1 3 2 4 6 7 8 Output: 3 5 1 3 2 4 6 8 The driver codes are attached in the images below. DO NOT CHANGE THE PROVIDED DRIVER CODES AT ALL, LEAVE THEM EXACTLY THE SAME. ONLY ADD CODE TO THE "getVector(vector<ll>A, vector<ll>B, int N)" FUNCTION
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]
A unimodal array is an array that has a sequence of monotonically increasing integers followed by a sequence of monotonically decreasing integers, assuming all elements in the array are unique. Example: - A= {4, 5, 8, 9, 10, 11, 7, 3, 2, 1}: A is a unimodal array because there is an increasing sequence followed by a decreasing sequence and the maximum element is 11.- B= {11, 9, 8, 7, 5, 4, 3, 2, 1}: B is not a unimodal array because there is no increasing sequence It is simply a decreasing sequence and the maximum element is 11.- C= {1, 2, 3, 4, 5, 7, 8, 9, 11}: C is not a unimodal array because There is an increasing sequence, but there is no decreasing sequence and the maximum element is 11.a) Design an efficient algorithm with the lowest possible complexity to state whether a given array is unimodal or not, and explain why your algorithm is efficient. b) Analyze the complexity of your algorithm. Data Structure With Python
Consider the graph below Can you determine whether this graph is bidirectional or not? Write a program that will store this graph as a matrix ( a 2D array) You don’t have to print out the elements Write a program that will store this graph as a 1D array of vectors and print the elements Extra credit: The subroutine included in the reference below (void printGraph) for the array of vectors ( question c) is not ideal. Consider modifying it to reference each node(vertex) by the size of the vector for each array element. So it would be ideal to replace for( auto x : adj[v]) with something like for (int j = 0; j < adj[v].size(); j++) cout << adj[v][j] << " "; Regardless, add a function to the program that will map the label to the nodes to the following characters: [ 0 → ‘cat’, 1→ ‘dog’, 2 → ‘car’, 3 → ‘dub’, 4 → ‘boo’, 5 → ‘foo’, 6 → ‘doo’ ]. Which means that when you call function, myfunc(4) it should return ‘boo’. And then adding a secondary…
Create a 3-by-3 matrix: A = [1 2 3;4 5 6;7 8 10] (a)Extract a submatrix B consisting of rows 1 and 3 and columns 1 and 2 of the matrix A (b)Interchange rows 1 and 3 of A and put it in a variable C. Hint: use the vector of row indices together with the colon operator (c)Create a vector version of the original matrix A. (d)Delete the 2nd column of the original matrix A and put it in a variable called A. (e)Insert a 2nd column to the new matrix A to restore it back to its original form A. (f) Extract those entries of the original matrix A that are greater than 5