The answer to this question is c
Answer:
Probability Distribution={(A, 4/7), (B, 2/7), (C, 1/7)}
H(X)=5.4224 bits per symb
H(X|Y="not C")=0.54902 bits per symb
Explanation:
P(B)=2P(C)
P(A)=2P(B)
But
P(A)+P(B)+P(C)=1
4P(C)+2P(C)+P(C)=1
P(C)=1/7
Then
P(A)=4/7
P(B)=2/7
Probability Distribution={(A, 4/7), (B, 2/7), (C, 1/7)}
iii
If X={A,B,C}
and P(Xi)={4/7,2/7,1/7}
where Id =logarithm to base 2
Entropy, H(X)=-{P(A) Id P(A) +P(B) Id P(B) + P(C) Id P(C)}
=-{(1/7)Id1/7 +(2/7)Id(2/7) +(4/7)Id(4/7)}
=5.4224 bits per symb
if P(C) =0
P(A)=2P(B)
P(B)=1/3
P(A)=2/3
H(X|Y="not C")= -(1/3)Id(I/3) -(2/3)Id(2/3)
=0.54902 bits per symb
Answer:
The right answer is Letter B. It is an area of memory that is used for dynamic memory allocation.
Explanation:
<em>Because a store procedure is not a computer program,neither a computer software . It is a type of code or subroutine available to applications that access a relational database management system. Such procedures are stored in the database data dictionary. It serves to save time and memory, extensive or complex processing that requires execution of several SQL. </em>
Answer:
2^11
Explanation:
Physical Memory Size = 32 KB = 32 x 2^10 B
Virtual Address space = 216 B
Page size is always equal to frame size.
Page size = 16 B. Therefore, Frame size = 16 B
If there is a restriction, the number of bits is calculated like this:
number of page entries = 2^[log2(physical memory size) - log2(n bit machine)]
where
physical memory size = 32KB which is the restriction
n bit machine = frame size = 16
Hence, we have page entries = 2^[log2(32*2^10) - log2(16)] = 2ˆ[15 - 4 ] = 2ˆ11
Answer:
Option E i.e., transparency is the correct option.
Explanation:
When any person using social media networks the he always ensure that he gives all the information related accurately about himself because in the social media network there is the transparency of everything except his chat with other but any person get details of the other person only if he is using social media network.