2 answers
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
1 answer
2
How to approach for this question?
4 answers
6
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Virtual memory} & \text{(p)} & \text{ Temporal Locality} \\\hline \text{(B)} & \text{Sha...
3 answers
7
The minimum number of interchanges needed to convert the array into a max-heap is$89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70$$0$$1$$2$$3$
9 answers
9
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
1 answer
13
Consider a lower triangular Matrix A[-25....+25, -25....+25], base address (BA)=0, size of element = 100 Byte. Find the location of a [-20][-21] (Ordering: Row Major)?
11 answers
16
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...
5 answers
18
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown autom...
0 answers
19
1 answer
20
1 answer
21
2 answers
22
3 answers
26
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...
1 answer
29
In software engineering the following are some of the software specification tools:A) Data Dictionary, FSM,Petri-netsB)DFDs,FSM,ERPC)FSM,Petri-nets,ADAD) Data Dictionary,...
1 answer
30
The following source code corresponding to a 'bash' shell script 'sl.sh' in UNIX system:for i in $* do cat $i doneWhat will be the output if 'sl.sh' is executed from the ...