Write a Python function uniquely_sorted() that takes a list as a parameter, and returns the unique values in sorted order.
1 answer:
You might be interested in
Answer:
a.) k² - 3k + 3
b.) 1/(1 - k)²
c.)
Explanation:
a.) A packet can make 1,2 or 3 hops
probability of 1 hop = k ...(1)
probability of 2 hops = k(1-k) ...(2)
probability of 3 hops = (1-k)²...(3)
Average number of probabilities = (1 x prob. of 1 hop) + (2 x prob. of 2 hops) + (3 x prob. of 3 hops)
= (1 × k) + (2 × k × (1 - k)) + (3 × (1-k)²)
= k + 2k - 2k² + 3(1 + k² - 2k)
∴mean number of hops = k² - 3k + 3
b.) from (a) above, the mean number of hops when transmitting a packet is k² - 3k + 3
if k = 0 then number of hops is 3
if k = 1 then number of hops is (1 - 3 + 3) = 1
multiple transmissions can be needed if K is between 0 and 1
The probability of successful transmissions through the entire path is (1 - k)²
for one transmission, the probility of success is (1 - k)²
for two transmissions, the probility of success is 2(1 - k)²(1 - (1-k)²)
for three transmissions, the probility of success is 3(1 - k)²(1 - (1-k)²)² and so on
∴ for transmitting a single packet, it makes:
∞ n-1
T = ∑ n(1 - k)²(1 - (1 - k)²)
n-1
= 1/(1 - k)²
c.) Mean number of required packet = ( mean number of hops when transmitting a packet × mean number of transmissions by a packet)
from (a) above, mean number of hops when transmitting a packet = k² - 3k + 3
from (b) above, mean number of transmissions by a packet = 1/(1 - k)²
substituting: mean number of required packet =
Answer:
See explaination
Explanation:
import java.util.Scanner;
public class SortArray {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
System.out.println("Enter Size Of Array");
int size = sc.nextInt();
int[] arr = new int[size]; // creating array of size
read(arr); // calling read method
sort(arr); // calling sort method
print(arr); // calling print method
}
// method for read array
private static void read(int[] arr) {
Scanner sc = new Scanner(System.in);
for (int i = 0; i < arr.length; i++) {
System.out.println("Enter " + i + "th Position Element");
// read one by one element from console and store in array
arr[i] = sc.nextInt();
}
}
// method for sort array
private static void sort(int[] arr) {
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length; j++) {
if (arr[i] < arr[j]) {
// Comparing one element with other if first element is greater than second then
// swap then each other place
int temp = arr[j];
arr[j] = arr[i];
arr[i] = temp;
}
}
}
}
// method for display array
private static void print(int[] arr) {
System.out.print("Your Array are: ");
// display element one by one
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + ",");
}
}
}
See attachment
