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

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

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

ZMA @ Suppose N is a (6x3) matrix array. This program segment print the locations of the negative elements. Captionless Image O O 10:00 م 3G Asiacell ... 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-End If 3- Next J, I 4- Print I; (","); J; Quilgo Submission ID (do not edit) * docs.google.com
Select the for-loop which iterates through all even index values of an array.A. for(int idx = 0; idx < length; idx++)B. for(int idx = 0; idx < length; idx%2)C. for(int idx = 0; idx < length; idx+2)D. for(int idx = 0; idx < length; idx=idx+2)
In each input array, every number repeats at least once, except for two. Write a function that returns the two unique numbers. Examples returnUnique ([1, 9, 8, 8, 7, 6, 1, 6]) → [9, 7] returnUnique([5, 5, 2, 4, 4, 4, 9, 9, 9, 1]) → [2, 1]
The following algorithm examines all the components in a given array to check for the existence of any two numbers, where one of them is the square of the other, in the given array or not.For example 1: input: A[9,5,28,25,47, 55]  output: true For example 2: input: A[24,15,18,18,42, 22]  output: falseIn example 1 the output is True because (5 and 25), where 25 is the square value of 5, while the output of example 2 is False because there is no any pair of numbers that meets this condition.• Input: An array A[0…n-1] • Output: Return True if there exist any two numbers, where one of them is the square of the other in the array, False otherwise a) Design a brute force algorithm to solve this problem and analyze its complexity. [explain your answer] b) Design a more efficient algorithm to do the same job analyze the complexity of your algorithm [explain your answer] c) Develop a python code to implement your efficient algorithm.
Given an array arr[] of N non-negative integers representing the height of blocks. If width of each block is 1, compute how much water can be trapped between the blocks during the rainy season. Example 1: Input: N = 6 arr[] Output: 10 = {3,0,0,2,0,4}
Write an algorithm to find the minimum in an array
This code segment determine an average of even elements of Array T(50). s=0:c=0 For I = 1 To 50 1-....... !!!! 2-...... 3-....... 4-.. 5-...... 6-...... 1-If T(1) mod 2=0 then 2-s = s + T(1) 3- c=c+1 4-End if 5-Next 6-A = s / 50 1-If T(1) mod 2=0 then 2-s = s + T(1) 3- c=c+1 4-End if 5-Next 6-A = s / c 1-If T(1) mod 2=0 then 2-s = s + T(1) 3- c=c+1 4-Next 5-End if 6-A = s/c 1-If T(1) mod 2=0 then 2-s = s + T(I) 3- c=c+1 4-A = s/ 50 5-End if 6-Next
Suppose B is a one dimension array with (20) elements. This code sorts B so that its elements are decreasing. For I=1 To 19 1-......... 2-....... D=B(1) B(I)=B(J) B(J)=D 3-....... 4-....... O ***** 1-For J = 1+1 To 20 2-lf B(J) > B( 1 ) Then 3-Endlf 4-Next I, J 1-For J = 1+1 To 20 2-lf B(J) B( 1 ) Then 3- Endlf 4-Next J, I 1-For J = 1+1 To 20 2-lf B(J) > B(1) Then 3-Next J, I 4-End If 1-For J = 1+1 To 20 2-lf B(J) > B(1) Then 3-Endlf 4-Next J, I
Write an algorithm that should calculate the sum of diagonal elements from 2-d array.
This code segment determine an average of even elements of Array T(50). s=0:c=0 For I = 1 To 50 1-..... 2-..... 3-........ 4-... 5-..... 6-........ 1-If T(1) mod 2=0 then 2-s = s + T(1) 3- c=c+1 4-A = s/ 50 5-End if 6-Next 1-If T(1) mod 2=0 then 2-s = s + T(1) 3- c=c+1 4-Next 5-End if 6-A = S/C 1-If T(1) mod 2=0 then 2-s = s + T(1) 3- c=c+1 4-End if 5-Next 6-A = s / 50 1-If T(1) mod 2=0 then 2-s = s + T(1) 3- c=c+1 4-End if 5-Next 6-A = s/c III
Write a program that fills a unary array ar[4] with four random integers between [1 to 10] Ex: 4 7 ar Then the program creates a 4*4 matrix based on the values in {ar} and print it 11 6. 7 8 6. 4 7 3 -2 -4 5.
Rust Given a array of finite length then print this array and also print it's length of array then find the average of these array elements