1
GATE CSE 1991
Numerical
+2
-0
The weighted external path length of the binary tree in figure is ___________. GATE CSE 1991 Algorithms - Greedy Method Question 12 English
Your input ____
2
GATE CSE 1991
MCQ (Single Correct Answer)
+2
-0.6
The following sequence of operations is performed on stack: PUSH (10),PUSH (20),POP,PUSH (10),PUSH (20),POP,POP,POP,PUSH (20),POP The sequence of the value popped out is:
A
20,10,20,10,20
B
20,20,10,10,20
C
10,20,20,10,20
D
20,20,10,20,10
3
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
4
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.
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12