0 votes
1
Shift-reduce parser consists ofinput bufferstackparse tableChoose the correct option from those given below:a and b onlya and c onlyc onlya, b and c
8 votes
4
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have?$\left\lfloor\frac {n}{k}\right\rfloor$$\left\lceil \frac{n}{k} \right\r...
–1 votes
7
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has9 edges and 5 vertices9 edges and 6 vertices10 edges and 5 vertices10 edges and 6 v...
0 votes
8
No of switching fn for f (A, B, C, D)=BD+B'D'How to approach this question ?