All categories

3 years ago

Can anyone help???

Computers and Technology

2 answers:

Ugo [173]3 years ago

6 0

Answer: Protocol identifier

Explanation:

Just took the test and resource name was incorrect. Hope this helps :)

Leya [2.2K]3 years ago

4 0

Answer:

c just did it

Explanation:

You might be interested in

Create an application containing an array that stores 10 integers. The application should call five methods that in turn (1) dis

tensa zangetsu [6.8K]

Answer:

public class Main {
public static void main(String[] args) {
int myArray[] = {3, 7, 2, 5, 9,11, 24, 6, 10, 12};
int myArray2 [] = {1, 2, 3, 4 ,5};
displayValue(myArray);
reverseDisplay(myArray);
displaySum(myArray);
displayLess(myArray, 10);
displayHighAvg(myArray);
displayBoth(myArray, myArray2);
}
public static void displayValue(int arr[]){
for(int i = 0; i < arr.length; i++){
System.out.print(arr[i] + " ");
}
System.out.println();
}
public static void reverseDisplay(int arr[]){
for(int i = arr.length-1; i >= 0; i--){
System.out.print(arr[i] + " ");
}
System.out.println();
}
public static void displaySum(int arr[]){
int sum = 0;
for(int i = 0; i < arr.length; i++){
sum += arr[i];
}
System.out.println(sum);
}
public static void displayLess(int arr[], int limit){
for(int i = 0; i < arr.length; i++){
if(arr[i] < limit){
System.out.print(arr[i] + " ");
}
}
System.out.println();
}
public static void displayHighAvg(int arr[]){
int sum = 0;
for(int i = 0; i < arr.length; i++){
sum += arr[i];
}
double avg = sum / arr.length;
for(int i = 0; i < arr.length; i++){
if(arr[i] > avg){
System.out.print(arr[i] + " ");
}
}
System.out.println();
}
public static void displayBoth(int arr1[], int arr2 []){
for(int i = 0; i < arr2.length; i++){
for(int j = 0; j < arr1.length; j++){
if(arr1[j] == arr2[i]){
System.out.print(arr1[j] + " ");
}
}
}
System.out.println();
}
}

Explanation:

There are five methods written to solve all the problems stated in the question.

Method 1 : displayValue (Line 15 - 21)

This is the method that take one input array and use the print() method to display the all the elements in the array.

Method 2: reverseDisplay (Line 23 - 26)

This method will take one input array and print the value in the reverse order. We just need to start with the last index when running the for-loop to print the value.

Method 3: displaySum (Line 31 - 37)

This method will take one input array and use a for-loop to calculate the total of the values in the array.

Method 4: displayLess (Line 39 - 47)

This method will take one two inputs, a array and a limit. We use the limit as the condition to check if any value less than the limit, then the value will only be printed.

Method 5: displayHighAvg (Line 50 - 64)

This method will take one input array and calculate the average. The average will be used to check if any element in the array higher than it, then the value will only be printed.

Method 6: displayBoth (Line 66 - 75)

This method will take two input arrays and compare both of them to find out if any value appears in both input arrays and print it out.

3 0

4 years ago

Prepare a algorithm visualization for the Tower of Hanoi when 4 disks are to be moved from spindle #1 to spindle #3.

Setler [38]

Answer:

follwing is the code for Tower of Hanoi for n disks.

#include <iostream>

using namespace std;

void towofhan(int n,char source,char aux,char dest)//function for tower of hanoi..

{

if(n<0)

return ;

if(n==1)//base case.

{

cout<<"Move disk 1 from "<<source<<" to spindle "<<dest<<endl;

return;

}

towofhan(n-1,source,dest,aux);//recursive call.

cout<<"move disk "<<n<<" from "<<source<<" to spindle "<<dest<<endl;

towofhan(n-1,aux,source,dest);//recursive call.

}

int main() {

int n=4;

towofhan(n,'1','2','3');//function call.

return 0;

}

Explanation:

If there is only 1 disk then we have to move the disk from source to destination.

Then after that we will apply recursion to solve the problem.

We have to work on only nth disk else will be done by the recursion.

First call recursion to move n-1 disks from source to auxiliary.

Then move nth disk from source to destination spindle.

Now move n-1 disks that are on the auxiliary spindle to destination spindle.

6 0

3 years ago

20.

Kazeer [188]

Answer:

Megabyte

Explanation:

Megabytes come before Gigabytes like how Gigabytes come before Terrabytes

8 0

3 years ago

In theory, a(n) _____ can be an independent centralized database management system with proper interfaces to support remote acce

Vlad [161]

Answer:

Transaction Manger

Explanation:

Transaction Manger

Transaction Manager is responsible for transaction between resources that are available. It works as interface to support remote access form other systems in Data base management system.

8 0

3 years ago

Select the two true statements about functions with parameters:

kondor19780726 [428]

Answer:

Option (B) and (C) is the correct option to the following question.

Explanation:

Because the function is the module of the program and we call that function again and again anywhere whenever we need that function in the program.

Function is used to carry out any operation which is used in the program many times and it creates the program short and simple.

<u>For example</u>: if we need to add or multiply two numbers many times in the program then, we create one or two functions for addition and subtraction or one program for both, when we need them we call them.

4 0

3 years ago