R-410A Is also known as A. Suva 410a B. AZ-20 C. Puron D. All Of The Above

Write the addReview method, which adds a single product review, represented by a ProductReview object, to the ReviewCollector ob

maw [93]

Answer:

Explanation:

namespace Jeroen\ReviewIntegration\Observer;

use Magento\Framework\Event\ObserverInterface;

class ProductReview implements ObserverInterface

{

protected $_storeManager;

protected $_request;

public function __construct(

\Magento\Store\Model\StoreManagerInterface $storeManager,

\Magento\Framework\App\Request\Http $request

) {

$this->_storeManager = $storeManager;

$this->_request = $request;

}

public function execute(\Magento\Framework\Event\Observer $observer)

{

return 'test';

}

5 0

3 years ago

For each of the following application areas state whether or not the tree data structure appears to be a good fit for use as a s

Cerrena [4.2K]

Answer:

a) Chess game moves:- Tree data structure is not a good fit.

b) Public transportation paths:- Tree data structure is not a good fit.

c) Relationshi[p among computer files and folders:- Tree data structure is a good fit.

d) Genealogical information:- Tree data structure is a good fit.

e) Parts of books:- Tree data structure is a good fit.

f) Programming language history:- Tree data structure is not a good fit.

g) Mathematical expression:- Tree data structure is a good fit.

Explanation:

a) Chess game moves:- Tree data structure is not a good fit. Since in tree data structure moving backward or sharing the node is not that much easy. Presume, In chess, you have to check any box is empty or not. Here, Graph is the best fit.

b) Public transportation paths:- Tree data structure is not a good fit. whenever shortest path, routes, broadcast come always graph is a good option. Because in the tree you don't know how many time you visit that node

c) Relationshi[p among computer files and folders:- Tree data structure is a good fit. Since they have a predefined route. Go to 'c' drive. Open a particular folder and open a particular file.

d) Genealogical information:- Tree data structure is a good fit. Since genealogical information also has a predefined route. Here, the Graph is not suitable.

e) Parts of books:- Tree data structure is a good fit. Since manages the chapters and topics are not that much complex. You can see any book index which is in a very pretty format.

f) Programming language history:- Tree data structure is not a good fit. To store the history of the programming language we need some unconditional jumps that's why the tree is not suitable.

g) Mathematical expression:- Tree data structure is a good fit. The tree is suitable in some cases. We have an expression tree for postfix, prefix.

5 0

3 years ago

Which one is not an operating system?1.mac 2.Microsoft office3.Iso.3.Android

quester [9]

It's either microsoft or office. Based on research I would say office.

I really hope this helps you! :-)

6 0

3 years ago

The return value is a one-dimensional array that contains two elements. These two elements indicate the rows and column indices

erma4kov [3.2K]

Answer:

In Java:

import java.util.Scanner;

import java.util.Arrays;

public class Main {

public static void main(String args[]) {

Scanner input = new Scanner(System.in);

int row, col;

System.out.print("Rows: "); row = input.nextInt();

System.out.print("Cols: "); col = input.nextInt();

int[][] Array2D = new int[row][col];

System.out.print("Enter array elements: ");

for(int i =0;i<row;i++){

for(int j =0;j<col;j++){

Array2D[i][j] = input.nextInt();

} }

int[] maxarray = findmax(Array2D,row,col);

System.out.println("Row: "+(maxarray[0]+1));

System.out.println("Column: "+(maxarray[1]+1));

}

public static int[] findmax(int[][] Array2D,int row, int col) {

int max = Array2D[0][0];

int []maxitem = new int [2];

for(int i =0;i<row;i++){

for(int j =0;j<col;j++){

if(Array2D[i][j] > max){

maxitem[0] = i;

maxitem[1] = j; } } }

return maxitem;

}

Explanation:

The next two lines import the scanner and array libraries

import java.util.Scanner;

import java.util.Arrays;

The class of the program

public class Main {

The main method begins here

public static void main(String args[]) {

The scanner function is called in the program

Scanner input = new Scanner(System.in);

This declares the array row and column

int row, col;

This next instructions prompt the user for rows and get the row input

System.out.print("Rows: "); row = input.nextInt();

This next instructions prompt the user for columns and get the column input

System.out.print("Cols: "); col = input.nextInt();

This declares the 2D array

int[][] Array2D = new int[row][col];

This prompts the user for array elements

System.out.print("Enter array elements: ");

The following iteration populates the 2D array

for(int i =0;i<row;i++){

for(int j =0;j<col;j++){

Array2D[i][j] = input.nextInt();

} }

This calls the findmax function. The returned array of the function is saved in maxarray

int[] maxarray = findmax(Array2D,row,col);

This prints the row position

System.out.println("Row: "+(maxarray[0]+1));

This prints the column position

System.out.println("Column: "+(maxarray[1]+1));

The main method ends here

}

The findmax function begins here

public static int[] findmax(int[][] Array2D,int row, int col) {

This initializes the maximum to the first element of the array

int max = Array2D[0][0];

This declares maxitem. The array gets the position of the maximum element

int []maxitem = new int [2];

The following iteration gets the position of the maximum element

for(int i =0;i<row;i++){

for(int j =0;j<col;j++){

if(Array2D[i][j] > max){

maxitem[0] = i; -- The row position is saved in index 0

maxitem[1] = j; -- The column position is saved in index 1} } }

This returns the 1 d array

return maxitem;

}

7 0

3 years ago

____ is a philosophy and a software and system development methodology that focuses on the development, use, and reuse of small,

LiRa [457]

Answer:

d.) Service-Oriented Architecture

Explanation:

Because its definition matches

4 0

3 years ago