3 h2..." - Step-by-step solution, answer key, and detailed explanation on MCA Prep."> 3 h2..." - Step-by-step solution, answer key, and detailed explanation on MCA Prep." /> 3 h2..." - Step-by-step solution, answer key, and detailed explanation on MCA Prep." />
Consider 4-bit gray code representation of numbers. Let h<sub>3</sub> h<sub>2</sub> h<sub>1</sub> h<sub>0</sub> be the gray code representation of a number n and g<sub>1</sub>g<sub>2</sub>g<sub>3</sub>g<sub>0</sub> be the gray code representation of the number (n + 1) modulo 16. Which one of the following functions is correct?
Build the table: for each 4-bit Gray code h (the code of n), find the Gray code of \((n+1) \bmod 16\) and note which bits are 1.
Gray sequence: 0000, 0001, 0011, 0010, 0110, 0111, 0101, 0100, 1100, 1101, 1111, 1110, 1010, 1011, 1001, 1000, and then back to 0000.
Working this out bit by bit (h read as a decimal number):
Only option (C) is correct, \(g_2 = \Sigma(2,4,5,6,7,12,13,15)\). The other options pair a correct list with the wrong output bit.
Answer: (C)
Reinforce your conceptual grasp with related questions from MAH MCA CET 2015:
Given f1 , f3 and f in canonical sum of products...
Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →