Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
This often used is the binary-reflected Gray code which can be generated by starting from the n-tuple of all bits zero and successively flipping.
How many Fixed-polarity Reed-Muller expressions there are for functions of n = 3 variables?
Calculate the FPRM-expression for the polarity H = (110) for the function given by the truth vector F = [1, 0, 0, 1, 1, 0, 1, 1]T .
Determine the Kronecker expressions for the following a ssignments of the Shannon, positive Davio, and negative Davio expansion rules to the variables.
Determine the fixed polarity arithmetic expressions, and show that the FPRM- repressions can be derived from them by recalculating the coefficients.
Represent the function given by the truth-vector F = [1, 0, 0, 1, 1, 1, 1, 1]T by decision trees on groups C3 2 and C2 × C4.
Draw the Positive and Negative Reed-Muller decision diagrams for the function f in Problem 2.
Determine the Binary decision tree and the Binary decision diagram for the function.
Calculate the values of constant nodes in the Kronecker decision tree with the same assignment of nodes for the function given by the truthvector .
Determine the functional expression for f. by this diagram and write the corresponding functional expression for f.
Represent this function at the Karnaugh map and determine the complete disjunctive and conjunctive forms.
Determine the truth table of a function that has the value 1 if the number of 1 bits is even.
Determine the variances of n1 and n2 and the covariance of n1 and n2.
Analyze the logic network in Fig. and simplify it by using properties of Boolean expressions.
Determine the basis functions in terms of which Sum-of products expressions are defined for functions of n = 3 variables.
Write the Sum-of-products expression for the truth-table of a 2-bit comparator (f1, f2, f3).
Consider the function f(x1, x2, x3) given by the set of decimals indices corresponding to the 1-minterms {2, 4, 7}.
Derive the Positive-polarity Reed-Muller expression for functions of n = 3 variables by the recursive application of the positive Davio expansion rule.
Determine PPRM-expression for the function f(x1, x2, x3) which takes the value 0 for the assignments of input variables.
Determine the maximum number of terminals that can use the channel.
An alternative derivation for the throughput in a pure ALOHA system may be obtained from the relation G = S+ A.
Determine the variance s2 in the number of arrivals in the interval T.
The probability that another packet will arrive within 1 s; within 100 ms.
Consider a pure ALOHA system that is operating with a throughput S = 0.1 and packets are generated with a Poisson arrival rate ?.
Consider a CSMA/CD system in which the transmission rate on the bus is 10 Mbits/s.