Question

Explain shannon's theory of confusion and diffusion with example.

Answer 1

microprogram control unit is required to generate a total of 25 control signals .Assume that during any microinstruction,at most 2 control signals are active ,the minimum no. of bits required in control word to generate the required control signa; will be a.2 b.25 c.10 d.12 2.R(A, B,C,D) is a relation. Which of the foll does not have a lossless join, dependency preserving BCNF decomposition? a) A --> B, B --> CD b) A --> B, B --> C, C --> D c) AB --> C, C --> AD d) A --> BCD 3.Consider a schema R(a,b,c,d) and funcional dependencies a->b and c->d. Then the decomposition of R into R1(ab) and R2(cd) is a) dependency preserving and lossless decomposition b) Not dependency preserving and lossless decomposition c) Not dependency preserving and not lossless decomposition d) dependency preserving and not lossless decomposition 4. Max no. of edges in a planar graph is 15 then no of vertices in the graphs is a) 3 b) 8 c) 7 d) 6 5. A polynomial p(x) is such tht p(0) = 5 , p(1) = 4, p(2) = 9 p(3) = 20 The min degree it can have is ? a) 1 b) 2 c) 3 d) 4 6 G be a graph with 100 vertices numbered 1 to 100. Two vertices i&j are adjacent if |i-j| =8 or |i-j| = 12 . The no. of connected components in G is (ans -4) a) 3 b) 4 c) 12 d) 8 7.number of different rooted labelled trees with n vertices is a)2^(n-1) b)2^n c)n^(n-1) d)n^n 8. A binary tree T has n leaf nodes.The number of nodes of degree 2 in the tree is a) log n to the base 2.