Scribd
Upload
8 views

B. Tech. ECE VIII Sem End Semester Question Paper EC 18302 2022-23

The document contains a test paper for a course on switching circuits and finite automata theory. The paper has 6 questions testing concepts like threshold logic, fault detection in combinational and sequential circuits, finite state machines, and digital circuit design.

Uploaded by

haanmainkunal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

B. Tech. ECE VIII Sem End Semester Question Paper EC 18302 2022-23

The document contains a test paper for a course on switching circuits and finite automata theory. The paper has 6 questions testing concepts like threshold logic, fault detection in combinational and sequential circuits, finite state machines, and digital circuit design.

Uploaded by

haanmainkunal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

मोतीलाल नेह रा य ौ यो गक सं थान इलाहाबाद

यागराज-211004 (भारत)
Motilal Nehru National Institute of Technology Allahabad
Prayagraj - 211 004 (India)
__________________________________________________________________________________
Department of Electronics and Communication Engineering
End Semester Examination, Session 2022-23 (Even)

Programme: B. Tech. Branch: ECE Semester: VIII


Course Name: Switching Circuits and Finite Automata Theory (PE III)
Course Code: EC18302 Max. Marks: 60
Time: 3 Hours Reg. No.:

Note: Attempt all questions. All symbols and notations have their usual meaning.

1. Determine whether the Boolean function f ( x1 , x2 , x3, x4 )   (0, 1,3, 4,5, 6, 7,12,13) is a threshold

function, and if so, find a weight-threshold vector. (10)


2. There is one input X and one output Z in a sequential circuit. The input X is a serial message and the
system reads X one bit at a time. The output Z = 1 whenever the sequence 101 is detected in the serial
message. Overlapping sequences are accepted; for instance, if the input is 010101, the required output
sequence is 000101. Draw a state diagram for the circuit with the minimum number of states. Design the
circuit using J-K flip-flops. (10)
3. Discuss the procedure for designing a fault-detection experiment for sequential machines with one or
more distinguishing sequences. Construct a fault-detection experiment for the sequential machine
represented by the following state table. (10)

Present Next State, z


State x=0 x=1
A B,0 C,1
B C,0 D,0
C D,1 C,1
D A,1 B,0

4 (a) Realize the following switching function with a (static) hazard-free two-level OR-AND circuit:
f ( x1 , x 2 , x 3 , x 4 )  ( x1  x 4 )( x 2  x3  x 4 )( x 3  x 4 ) . (5)

(b) If a Boolean function F ( X ) is expressed in the form F ( X )  A( X )  xi B ( X )  xi C ( X ) where A(X),

dF ( X )
B( X ) and C(X) are not functions of xi , then show that =  B( X )  C ( X )  A( X ). (5)
dx i

PTO
5 (a) Using Boolean difference method, find a minimal complete test set to detect all the single faults in the
following circuit. (5)

(b) Find the equivalent partition for the machine characterized by the following state table. (5)

Present Next State, z


State x=0 x=1
A E,0 D,1
B F,0 D,0
C E,0 B,1
D F,0 B,0
E C,0 F,1
F B,0 C,0

6 (a) In response to the input sequence X, an unknown three-state sequential machine produces the output
sequence Z, as shown below.

X: 0 0 0 0 1 0 1 0 0 0 1 0
Z: 1 0 1 0 0 1 1 0 0 0 0 1
Find the reduced standard form description of the machine, assuming that A is the initial state. (5)

(b) The initial state of the following machine is unknown, as is the entry in row B, column 1, of the state
table.

Present Next State, z


State x=0 x=1
A B,0 C,0
B A,1 ?
C B,1 C,1

Design an experiment that can be used to find the unknown entry. (5)

___________________
Course Outcomes:

CO1: Understand the principles of threshold logic

CO2: Be familiar with the concepts of reliable design and fault detection methods for combinational circuits

CO3: Be familiar with the general finite-state model and important characteristics of finite-state machines

CO4: Be familiar with fault detection experiments for sequential machines

CO5: Analyze and synthesize digital circuits

Mapping:

Q1: CO1

Q2: CO3, CO5

Q3: CO4

Q4 : CO2

Q5 (a): CO2

(b): CO3

Q6: CO3, CO5

_________________________

You might also like