The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
882 views

The $FSM$ (Finite State Machine) machine pictured in the figure above

  1. Complements a given bit pattern
  2. Finds $2's$ complement of a given bit pattern
  3. Increments a given bit pattern by $1$ 
  4. Changes the sign bit
asked in Theory of Computation by Veteran (359k points)
edited by | 882 views
0
(d) ?
0
Despite the error in the FSM, ISRO didn't change the key or discard the question.

2 Answers

+6 votes

I think there is some error in the diagram. If DFA had been like this :

.

Ans:(c) Increments a given bit pattern by 1.

answered by Loyal (9.2k points)
0
If anything is right this should be the most probable. Otherwise None. :)
0
If the input is: 1011.

What will be output?

Since the diagram is ambiguous then it should be reported.
0
i can take objection in this question ma'am.bcoz of fig misprint .i marked option A
0
If input is 1010, the output is 0110. I don't understand how is this FSM increasing the bit pattern by 1.
0 votes
  1. D ans
answered by (283 points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

40,904 questions
47,561 answers
146,300 comments
62,306 users