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:
Difference between Queue and Stack are as following:-
- Queue is a FIFO(First In First Out) type data structure while Stack is a LIFO(Last In First Out) type data structure.
- The insertion and deletion of elements from the queue happens from two ends insertion at the tail and deletion from the front.While the insertion and deletion from stack happens from one end only that is top.
- The insertion and deletion operation in queue are referred as enqueue and dequeue. While in stack they are referred as push and pop respectively.
Answer:
true
Explanation:
Mainly true, but partly false. There are two bits in a computer that supply speed: The processor (measured in hertz eg. 2Ghz Processor) and RAM (bits and bytes eg 2GB of RAM). The processor is more to do with the speed programs run and load at, and RAM let's you use lots of memory intensive programs at the same time, although this also comes down to the processor and vice versa. Hope I helped :)
Answer:
H o e! (as the gardening tool)