The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1s complement of the input numberb)It computes 2s complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > The following diagram represents a finite sta...

Join the Discussion on the App

The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.

Q. Which one of the following is TRUE?

a)
It computes 1's complement of the input number
b)
It computes 2's complement of the input number
c)
It increments the input number
d)
It decrements the input number

Correct answer is option 'B'. Can you explain this answer?

FREE This question is part of

Test: Regular Expressions & Finite Automata- 2

Attempt Test

Attempt this Test

Verified Answer

The following diagram represents a finite state machine which takes as...

The given finite state machine takes a binary number from LSB as input.
The given FSM remains unchanged till first ‘1’ . After that it takes 1’s complement of rest of the input string.
We assume the input string to be ‘110010’ . Thus, according to the FSM, output is ‘001110’ .
2’s complement of ‘110010’ = 1’s complement of ‘110010’ + 1 = 001101 + 1 = 001110 Thus, the FSM computes 2’s complement of the input string.

Hence, option (B) is correct.

Please comment below if you find anything wrong in the above post.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

The following diagram represents a finite state machine which takes as input a binary number from the least significant bitWhich one of the following is TRUE?

View answer

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?

View answer

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution? (GATE CS 2013)

View answer

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?

View answer

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer?.

Solutions for The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer?, a detailed solution for The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer? has been provided alongside types of The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.Q. Which one of the following is TRUE?a)It computes 1's complement of the input numberb)It computes 2's complement of the input numberc)It increments the input numberd)It decrements the input numberCorrect answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam