1
GATE CSE 1991
Fill in the Blanks
+2
-0
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______ GATE CSE 1991 Data Structures - Trees Question 57 English
2
GATE CSE 1991
Subjective
+5
-0
Find the minimum sum of products form of the logic function
$$f\left( {A,B,C,D} \right) = \sum d \left( {3,11,12,14} \right)$$
Where $$m$$ and $$d$$ denote the minterms and don't cares respectively.
3
GATE CSE 1991
Numerical
+2
-0
Find the maximum clock frequency at which the counter in Fig., can be operated. Assume that the propagation delay through each flip-flop and $$AND$$ gate is $$10$$ $$ns.$$ Also assume that the setup time for the $$JK$$ inputs of the flip-flops is negligible. GATE CSE 1991 Digital Logic - Sequential Circuits Question 22 English
Your input ____
4
GATE CSE 1991
Fill in the Blanks
+2
-0
The maximum number of possible edges in an undirected graph with a vertices and $$k$$ components is _________ .
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12