...
October 14, 2023

Digital-Logic-Design

Question 43 Consider the following minterm expression for F: F(P,Q,R,S) = Σ0,2,5,7,8,10,13,15 The minterms 2, 7, 8 and 13 are ‘do not care’ terms. The minimal […]
October 14, 2023

GATE 2017 [Set-1]

Question 9 When two 8-bit numbers A7…A0 and B7…B0 in 2’s complement representation (with A0 and B0 as the least significant bits) are added using a […]
October 14, 2023

GATE 2007

Question 3 What is the maximum number of different Boolean functions involving n Boolean variables? A n2 B 2n C 22n D 2n2 Digital-Logic-DesignBoolean-Algebra Question 3 […]
October 14, 2023

Digital-Logic-Design

Question 490 Consider the graph given below : Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of […]
error: Alert: Content selection is disabled!!