What will the output be from the following program?

Allushta [10]

Answer:

All of given terms are Categories of Wireless networks.

Explanation:

Wireless networks as obvious from name are the networks having no means of physical medium such as cords, wires or cables. This gives the advantage of mobility and extension of the applications to different parts of building, block and even anywhere in word. Wireless network can be divided into four basic categories in order to differentiate between there quality and range:

Category Coverage

Wireless Personal Area Network (WPAN) | Within One person
Wireless Local Area Networks (WLAN) | Within a building
Wireless Metropolitan Area Networks (WMAN) | Within a city
Wireless Wide Area Networks (WWAN) | Worldwide

i hope it will help you!

4 0

3 years ago

Give a common business example that mimics the differences between a shared

Serhud [2]

An business example that mimics the differences between a shared network segment and a dedicated network segment is that of connection of work station transmission.

<h3>What is Shared segment network?</h3>

In this type of network, local area network or an aspect of the local area network is said to have a lot of workstations and the multiple workstations are linked by using a hub

Note that all the workstation do not need to share the network capacity with other workstations but an business example that mimics the differences between a shared network segment and a dedicated network segment is that of connection of work station transmission.

Learn more about network segment from

brainly.com/question/7181203

#SPJ1

6 0

2 years ago

The page-replacement policy means that pages are not placed to make more space. A. True B. False

BabaBlast [244]

Answer:

B. False

Explanation:

A page-replacement policy can be defined as a set of algorithm that instructs the operating systems on what memory page is to be swapped, paged out or written to disk in order to allocate more memory as they're required by various active processes during virtual memory management.

Some of the algorithms or techniques used by the operating system for page-replacement policy are;

1. Last In First Out (LIFO).

2. First In First Out (FIFO).

3. Least Recently Used (LRU).

4. Least Frequently Used (LFU).

5. Optimal (OPT or MIN).

Hence, the page-replacement policy means that pages are placed to make more space and to minimize the total number of page that would be missing.

7 0

3 years ago

Write a program to calculate the great circle distance between two points on the surface of a sphere. If p1(x1, y1) and p2(x2,y2

Tamiku [17]

Answer:

import java.lang.*;

public class distance { public static double distance(double latitude1,

double latitude2, double longitude1,

double longitude2)

{

// Convert Latitude and Longitude to Radians

longitude1 = Math.toRadians(longitude1);

longitude2 = Math.toRadians(longitude2);

latitude1 = Math.toRadians(latitude1);

latitude2 = Math.toRadians(latitude2);

double d_longitude = longitude2 - longitude1;

double d_latitude = latitude2 - latitude1;

double a = Math.pow(Math.sin(d_latitude / 2), 2)

+ Math.cos(latitude1) * Math.cos(latitude2)

* Math.pow(Math.sin(d_longitude / 2),2);

double val = 2 * Math.asin(Math.sqrt(a));

// Radius of earth in kilometers is 6371

double earth_radius = 6371;

// Calculate and return the distance

return(val * earth_radius);

}

// Main Method

public static void main(String[] args)

{

double latitude1 = 67.32055555555556;

double latitude2 = 83.31861111111111;

double longitude1 = -1.7217899;

double longitude2 = -1.6567799;

System.out.println(distance(latitude1, latitude2,

longitude1, longitude2) + " K.M");

}

Explanation:

This program is implemented in Java programming language

The formula for the shortest distance between two points on the earth is:

Distance = 3963.0 * arccos[(sin(lat1) * sin(lat2)) + cos(lat1) * cos(lat2) * cos(long2 – long1)]

The latitude and longitude of the two points must be known

The latitude and longitude are converted into radians using built in methods in java.

Take value for the radius of the earth in Kilometers 6371;

Note that a seperate method has been created to calculate the distance

In the driver method (main), values for latitude and logitudes for both places have been hard-corded, then the method distance is called and passed those values

Note also that the distance has been calculated in Kilometers

8 0

3 years ago

Variance for accumulator. Validate that the following code, which adds the

Art [367]

Using the knowledge of computational language in JAVA it is possible to write a code that Validate that the following code, which adds the methods var() and stddev() to Accumulator, computes both the mean and variance of the numbers presented as arguments to addDataValue()

<h3>Writting the code:</h3>

import java.util.*;

public class Accumulator {

private static double m;

private static double v;

private static double st;

private static double s[]=new double[5];

private static int N;

private static int count =0;

public static void main(String[] args) {

// TODO Auto-generated method stub

Random r = new Random();

System.out.println("hello world");

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

double randomvalue = r.nextDouble();

addDataValue(randomvalue);

}

for(int i=0;i<s.length;i++) {

System.out.println("dataValue:"+s[i]);

}

mean();

System.out.println("mean:"+m);

var();

System.out.println("variance:"+v);

stddev();

System.out.println("standard deviation:"+st);

}

public static void addDataValue(double value) { // addes data values to array

s[count]=value;

count++;

}

public static double mean() { // returns mean

double sum=0.0;

for(int i=0;i<s.length;i++) {

sum+=s[i];

}

m = sum/s.length;

return m;

}

public static double var() { //returns variance

double mm = mean();

double t = 0;

for(int i=0;i<s.length;i++) {

t+= (s[i]-mm)*(s[i]-mm);

}

v= t/(s.length-1);

return v;

}

public static double stddev() { // returnsn the stardard deviation

st= Math.sqrt(var());

return st;

}

See more about JAVA at brainly.com/question/12975450

#SPJ1

3 0

1 year ago