Computer Sciences > Gate 2015 Set-1 > Number Representation
Consider a 4 bit Johnson counter with an initial value of 0000. The counting sequence of this counter is
A
0,1,3,7,15,14,12,8,0
B
0,2,4,6,8,10,12,14,0
C
0,8,12,14,15,7,3,1,0
D
0,1,3,5,7,9,11,13,15,0

Explanation

Correct : Number Representation

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science