Question 2
Question 3
Question 4
In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator polynomial is G(x) = x4 + x + 1. After implementing CRC encoder, the encoded word sent from sender side is _____.
Question 6
Consider a weighted complete graph G on the vertex set {ν1, ν2, .... νn} such that the weight of the edge (νi, νj) is 4 | i – j|. The weight of the minimum cost spanning tree of G is :
4n2
n
4n – 4
2n – 2
Question 7
Question 8
Question 9
Question 10
Which access specifier allows members to be accessed only within the class?
public
protected
private
none of them
There are 75 questions to complete.