github

Made bySaurav Hathi

ECE - Practice Test - 52

Q1:

Which one of the following logical operation is performed by the digital circuit shown below?

Tags:
Truechip_M1
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q2:

Match the logic gates in column A and their equivalents in column B.

 

Column A

 

Column B

P.

1.

Q.

2.

R.

3.

S.

4.

 

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q3:

The Boolean expression Y(A,B,C) = A+BC is to be realized using 2- input gates of only one type. What is the minimum number of gates for the realization. ?

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q4:

The Boolean expression for the output of the below logic circuit is.

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q5:

If the input to the digital circuit consisting of a Cascade of 20 XOR-gates is X, then the output Y is equal to.

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
V2_ECE_NewTest1
V2_ECE_NewTest2
+ 1 more
Section:
Digital Circuits
Options:
Q6:

 A Ring oscillator consisting of 5 inverters is running at a frequency of 10 MHz. The propagation delay per gate is :

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q7:

Match List-1 with List-2 and select the correct answer using the code given below the Lists.

List-1

List-2

A. AND gate

1. Boolean Complementation

B. OR gate

2. Boolean addition

C. NOT gate

3. Boolean Multiplication

 

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q8:

Which is the following are universal gate?

1-NAND 2-NOR 3-XOR

Select the correct answer form the codes given below.

Tags:
Truechip_M1
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q9:

A,B and C are three Boolean variable which one of the following Boolean expressions cannot be minimized any further?

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q10:

When the Boolean function

F(x1,x2,x3)=∑(0,1,2,3)+∑d(4,5,6,7)

is minimized what does one get?

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q11:

The Boolean function can be expressed in canonical sop (sum of products) and pos(product of sums) form. For the following, Y=A+B¯C

Tags:
NEAT_ECE_Exit_Baseline
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q12:

Minimize the function given below using K-map

F(A,B,C,D)=∑m(0,2,3,6,8,9,12,14)+∑d(1,4,10,11)

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q13:

A 3-variable truth table has a high output for the inputs: 010,011and110, the Boolean expression for sum of product (sop) can be written as.

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q14:

The Boolean expression Y=A¯B¯C¯D+A¯BCD¯+AB¯C¯D+ABC¯D¯can be minimized to

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options:
Q15:

Consider the following statement.

1.Minimization using k-may not provide unique solution

2.Redundant grouping in k-map may result in non-minimized solution

3.Don’t care states if used in k-map for minimization, the minimal solutions is not obtain

Which of the statements given above are correct?

Tags:
PlaceMe2_DC&MP2
NEAT_DC&MP2
Section:
Digital Circuits
Options: