Suppose N is a (6x3) matrix array. This program segment print the locations of the negative elements. Captionless Image O O 1-If N(I, J) < 0 Then 2-Print I; (","); J; 3-End If 4-Next J, I 1-If N(I, J) < 0 Then 2-Print I; (","); J; 3-End If 4-Next I, J 1-If N(I, J) < 0 Then 2-Print I; (","); J; 3-Next J, I 4-End If 1-If N(J, I) > 0 Then 2-Print I; (",); J; 3-End If 4-Next J, I 1-If N(I, J) < 0 Then 2-End If 3- Next J, I 4- Print I; (","); J;

Suppose N is a (6x3) matrix array. This program segment print the locations of the negative elements. Captionless Image O O 1-If N(I, J) < 0 Then 2-Print I; (","); J; 3-End If 4-Next J, I 1-If N(I, J) < 0 Then 2-Print I; (","); J; 3-End If 4-Next I, J 1-If N(I, J) < 0 Then 2-Print I; (","); J; 3-Next J, I 4-End If 1-If N(J, I) > 0 Then 2-Print I; (",); J; 3-End If 4-Next J, I 1-If N(I, J) < 0 Then 2-End If 3- Next J, I 4- Print I; (","); J;

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Vectors store a linear arrangement of values, accessed by a single index. Two-dimensional arrays store a tabular arrangement of values, accessed by two indexes, for example matrix[i][j], where i is the row index, and j is the column index. A common two-dimensional array that you should have seen early on in your education is a multiplication table. For example, here is the multiplication table up to 5 x 5: 1 2 3 4 5 1 1 2 3 4 5 2 2 4 6 8 10 3 3 6 9 12 15 4 4 8 12 16 20 5 5 10 15 20 25 Write a program that asks the user for the number of rows and columns for a multiplication table and prints out the corresponding results.
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 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.
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]
import java.util.Scanner;import java.util.ArrayList; public class UserIDSorting {// TODO: Write the partitioning algorithm - pick the middle element as the // pivot, compare the values using two index variables l and h (low and high), // initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessarypublic static int partition(ArrayList<String> userIDs, int i, int k) {} // TODO: Write the quicksort algorithm that recursively sorts the low and // high partitionspublic static void quicksort(ArrayList<String> userIDs, int i, int k) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in); ArrayList<String> userIDList = new ArrayList<String>(); String userID; userID = scnr.next();while (!userID.equals("-1")) {userIDList.add(userID);userID = scnr.next();}// Initial call to quicksort quicksort(userIDList, 0, userIDList.size() - 1); for (int i = 0; i < userIDList.size(); ++i)…
9.). integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array. Example 1: Input: nums = [1], k = 1 Output: 1 Example 2: Input: nums = [1,2], k = 4 Output: -1 Example 3: Input: nums = [2,-1,2], k = 3 Output: 3.
Suppose we have to declare a two dimensional array called matrix with each dimension having some length. Write a message to initialize this array with random values between zero and 99. Hint: set each individual element of the right to random value
In C program Given a 2D array, determine if there is a row or a column that has the same numbers all throughout. Input The first line contains the number of rows and columns the multidimensional array has. The succeeding lines contain the values inside the multidimensional array, depending on the number of rows and columns. 5 5 2 5 1 2 3 4 2 1 3 4 8 2 1 9 5 7 0 1 3 4 2 2 1 2 2 Output A single line containing a string "yes" if there is, and "no" if there isn't yes
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…
You are given two arrays, one shorter (with all separate items) and one longer (with no unique elements). Find the shortest subarray in the larger array that contains all of the shorter array's items. The things can be shown in any order.EXAMPLEInput: {1, 5, 9}{7, 5, 9, 0, 2, 1, 3, 5. 7, 9. 1, 1, 5, 8, 8, 9, 7}Results: [7, 10] (the underlined portion above)
. Implement a program that randomly generates 10 integers from -100 to 100, stores them in a 1D array, and finds their maximum value. Calculate the execution time of finding a maximum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Implement a Java program that will populate a 5x5 matrix with randomly generated integers from 0 to 100. (1) print your matrix in a table form. (2) modify your code to multiply all even numbers by 10 and print the matrix. Your output of questions (1) and (2) should match the format of the following sample outputs:
Find the number of super values in vector<int>v where an array element is super if it is greater than all elements to its right. For ex in {4,27,1,20,17, 5} has 4 super values 27, 20,17,5 so its output should be 4. Code in C++