Are you looking for the abbreviation if so it is FPS
Answer:
1.) DHCP is sent over the message at UDP.
2.) The address of link-layer is Source: DellComp_4f:36:23 (00:08:74:4f:36:23)
3.) The message type of value to the discover message is 1, but the message type of value to the request packets is 3. This how you can be differentiate two.
4.) The Transaction ID in first four message is 0x3e5e0ce3
The transaction ID in second sets of messages is 0x257e55a3
The transaction ID is identifies if the message is a part of the set of the messages is related to the one transaction
Explanation:
DHCP is stands for the Dynamic Host Configuration Protocol which is the networks management protocol that is used on the UDP/IP networks where by the DHCP servers dynamically assign the IP address and the other networks configuration parameters to the each devices on the network so they can be communicate with the other IP network.
Answer:
// C++ program to find k largest elements in the array
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variable
int n,k;
cout<<"Enter the number of elements of array:";
// read the value of n
cin>>n;
// declare the array of size n
int arr[n];
cout<<"Enter the elements of array:";
// read the elements of array
for(int a=0;a<n;a++)
{
cin>>arr[a];
}
cout<<"Enter the value of K:";
cin>>k;
// call the function to perform selection Sort
sort(arr, arr+n);
cout << k<<" largest elements of the array are: ";
// print k largest elements of the array
for (int i=n-1; i>n-k-1; i--)
cout << arr[i] << " ";
return 0;
}
Explanation:
Read the number of elements in the array.Then create an array of size "n" and read n elements of the array.Sort the array in ascending array.Then Read the value of k from user.Find the k Elements from the end of the array.This will be the k largest elements of the array.
Output:
Enter the number of elements of array:8
Enter the elements of array:34 8 75 99 12 7 5 55
Enter the value of K:3
3 largest elements of the array are: 99 75 55
Diskpart command might be the answer
