Find the lexicographic ordering of the bit strings 0 < 1 given below based on the ordering .
(A) 001
(B) 010
(C) 011
(D) 0001
(E) 0101
Choose the correct answer from the options given below:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. 0001 < 001 < 010 < 0101 < 011
Explanation
Compare bit by bit: 0001 < 001 (at the third bit 0 < 1), then 010 < 0101 (010 is a prefix) < 011.
More Discrete Structures and Optimization questions
- Statement I: 5 divides n⁵ − n whenever n is a non-negative integer. Statement II: 6 divides n³ − n whenever n is a non-negative integer.
- A basic feasible solution of an transportation problem is said to be non- degenerate, if basic feasible solution contains exactly----------…
- Maximize z = x₁ + x₂ subject to x₁ + 2x₂ ≤ 2000, x₁ + x₂ ≤ 1500, x₂ ≤ 600, x₁, x₂ ≥ 0. The solution is
- What are the GLB and LUB of the sets A = {3, 9, 12} and B = {1, 2, 4, 5, 10}, if they exist, in the poset (Z⁺, /)?
- Let (P) be the set of all people. Let (R) be a binary relation on (P) such that (a, b) is in R if a is a brother of b. Is (R) symmetric tra…
- A tree has 2 n vertices of degree 1,3 n vertices of degree 2, n vertices of degree 3 . Determine the number of vertices and edges in tree.