Inversion of single bit input to a single bit output using                    

Related MCQs

• An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?
• The bit strings for the sets are 1111100000 and 1010101010. The union of these sets is ____________.
• In FSA ,the notation for M being in state S0, reading the input symbol a, moving one cell right and reaching the state S1 is given by ________.
• The logic gate that provides high output for same inputs                          
• Using Induction Principle if 13 = 1, 23 = 3 + 5, 33 = 7 + 9 + 11, then
• Which amount of postage can be formed using just 4-cent and 11-cent stamps?
• There are 6 equally spaced points A, B, C, D, E and F marked on a circle with radius R. How many convex heptagons of distinctly different areas can be drawn using these points as vertices?
• In what time can the Hamiltonian path problem can be solved using dynamic programming?
• What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
• Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.