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

Create a 2D array of size 14x14 having same values ranging from 0 to 255 in each row. You are free to specify the values of this array. For instance, consider a 3x3 array as;Array [3] [3]= {{12,12,12}, {75, 75, 75}, {247, 247, 247}}12, 75, and 247 pixel values are specified in a way that they are in a range of 0 to 255 and they are same in a row.Write a code namely arraytoimage.c using any pgm (portable gray map) format image that represents an image in a text file in which each pixel is represented by a number ranging from 0 and 255. In this code, write:-P2 (magic number)-Width and height of the image-Maximum grayscale value-Gray scale intensity values you specify in the arrayin an order to this image

The "dynamic array" data structure is used as the basis of Java's ArrayList library class. Describe this data structure and explain how it achieves (amortized) constant-time adding of elements, while also giving constant-time random access of elements. As part of your answer, make sure to explain what "amortized" means for the data structure.

An array is positive dominant if it contains strictly more unique positive values than unique negative values. Write a function that returns true if an array is positive dominant. Examples ispositiveDominant([1, 1, 1, 1, -3, -4]) // There is only 1 unique positive value (1). // There are 2 unique negative values (-3, -4). ispositiveDominant([5, 99, 832, -3, -4]) → true ispositiveDominant([5, 0]) → true ispositive Dominant([0, -4, -1]) → false

Q1. Implement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the given length. Initially, each element equals 0. void set(index, val) sets the element at the given index to be equal to val. int snap() takes a snapshot of the array and returns the snap_id: the total number of times we called snap() minus 1. int get(index, snap_id) returns the value at the given index, at the time we took the snapshot with the given snap_id   Example 1: Input: ["SnapshotArray","set","snap","set","get"] [[3],[0,5],[],[0,6],[0,0]] Output: [null,null,0,null,5] Explanation: SnapshotArray snapshotArr = new SnapshotArray(3); // set the length to be 3 snapshotArr.set(0,5); // Set array[0] = 5 snapshotArr.snap(); // Take a snapshot, return snap_id = 0 snapshotArr.set(0,6); snapshotArr.get(0,0); // Get the value of array[0] with snap_id = 0, return 5..

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].

Write a program that creates a 3x3 2d array and populate it by user input. It then creates a secondarray of size 3 which stores the sum of each row in the user input matrix.If the matrix is [ [1,1,1], [2,2,2], [3,3,3] ], sums should be [3, 6, 9].The sums are then printed on the screen.