Recent posts tagged mtech-admission

31
The function terminates for all powers of $2$ (which is infinite), hence (i) is false and (ii) is TRUE.Let $n = 5. $Now, recursive calls will go like $5 - 14 - 7 - 20 - 1...
32
SLR paper is more powerful than LALR . False .LALR parser is more powerful than Canonical LR parser . False .Canonical LR parser is more powerful than LALR parser. True.T...
33
How query 2 will not produce the correct result?I am getting the desired result from query 2.
34
no. It asks for "NOT" supported in HTML
35
I searched the paper of 1996 from internet, that question paper is having first option not same as given but the same diagram, and unfortunately option given in that pape...
36
Its not a difficult topic- but not highlighted in books. Most books tell what common students want. The fact that you asked this question shows that you are interested in...
38
One of the zero edge has the arch missed
39
A software project plan has identified ten tasks with each having dependencies as given in the following table:TaskDepends OnT1-T2T1T3T1T4T1T5T2T6T3T7T3, T4T8T4T9T5, T7, ...
40
Time without pipeline $=6 \text{ stages}=6 \text{ cycles}$Time with pipeline $=1+\text{stall freqency}\times \text{stall cycle}$ $=1+.25\times 2$ $=1.5$Speed up $=\dfrac{...
41
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is...
42
Consider the following data path of a $\text{CPU}.$The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including increm...