





Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Main points of this exam paper are: Confguration, Transistors, Standard, Truth Table, K-Map, Boolean Expression, Switch Level Circuit, Bottom Half, Boolean Algebra Manipulations, Truth Table Representation
Typology: Exams
1 / 9
This page cannot be seen from the preview
Don't miss anything!






Some useful Boolean identities.
Implement the following expressions using n-type and p-type transistors in the standard CMOS configuration that we used in class.
Complete the following switch level circuit by designing the bottom half (the pull-down net- work). Provide the expressions for F and G = F.
By using Boolean algebra manipulations, express the following function as a sum of products (SOP) and as a product of sums (POS). You are not required to simplify but you may if you want.
Draw a gate implementation of the following function that exhibits a minimum amount of propagation delay. F = D(A( B C + B) + C A )
For the following functions, derive a simplified sum of products (SOP) expression using a Kar- naugh map. Circle the prime implicants used in the simplified expression.
@ @@
00
}
}
︷ ︸︸ ︷︷ ︸︸ ︷
︸ ︷︷ ︸︸ ︷︷ ︸︸ ︷︷ ︸
@ @@
00
}
}
︷ ︸︸ ︷︷ ︸︸ ︷
︸ ︷︷ ︸︸ ︷︷ ︸︸ ︷︷ ︸