Answer:
SOP=AB'+B'C
POS=B'(A'+C)
Shorthand Minterms=m₀+m₁+m₅
Shorthand Maxterms=M₃+M₂+M₄+M₆+M₇
Explanation:
For the full explanation of this question refer to the image attached which is of the k-Map of F.As we can see in the k-map that there are only 3 ones.by making 2 pairs of 1 we get the SOP expression.
Rest of them are zero from there we will get the POS expression.
The one's in the k-map represent the Minterms and 0's represent Maxterms and the number written in the box is their respective minterm and maxterm number.Minterms are represented by m and maxterms are represented by M.
The answer is : 2001:DB80:1470::200
A double colon ( :: ) can replace any single, contiguous string of one or more 16-bit segments (hextets) which is consist of all 0s, and it can only be used once per IPv6 address. Therefore,any leading 0s (zeros) in any 16-bit section or hextet can be omitted.
Answer:
- Create partitions on each hard disk drives.
- Mount the partition created on each hard drive so they are accessible by the the operating system.
- Format the partitions created with a filesystem recognized by Linux.
Explanation:
Having purchased the two new SCSI hard disk drives with the controller cards for each and installed them properly, before using them for data storage and retrieval he must first use the fdisk command to create one or more partitions on each of the hard disk drives then mount any partitions created on the two hard drives so that they are accessible by the operating system before then proceeding to format any partitions created with a valid filesystem recognized by Linux.
Answer:
Airplane mode has been set on the tablet.
Explanation:
Joe a frequent visitor to a branch office attempts to connect his tablet to the office wireless network but is unable to connect to the internet even though he has verified that the SSID and password are correct. Joe attempts to connect to a coworker's hotspot but is still unable to connect to the internet.
This is because the Airplane mode has been set on the tablet.
Answer:
// here is code in c++ to find the approx value of "e".
#include <bits/stdc++.h>
using namespace std;
// function to find factorial of a number
double fact(int n){
double f =1.0;
// if n=0 then return 1
if(n==0)
return 1;
for(int a=1;a<=n;++a)
f = f *a;
// return the factorial of number
return f;
}
// driver function
int main()
{
// variable
int n;
double sum=0;
cout<<"enter n:";
// read the value of n
cin>>n;
// Calculate the sum of the series
for (int x = 0; x <= n; x++)
{
sum += 1.0/fact(x);
}
// print the approx value of "e"
cout<<"Approx Value of e is: "<<sum<<endl;
return 0;
}
Explanation:
Read the value of "n" from user. Declare and initialize variable "sum" to store the sum of series.Create a function to Calculate the factorial of a given number. Calculate the sum of all the term of the series 1+1/1!+1/2!.....+1/n!.This will be the approx value of "e".
Output:
enter n:12
Approx Value of e is: 2.71828
