# Recent posts tagged gate2018

1
It is used for this question only actually whenever m=n the complete bipartite graph is regular. here they want to just test the concept whether we know this or not and how patiently we go through all options.
2
Assuming optimal is with respect to the total waiting time (a) is correct. Total waiting times are (a) 0 + 1.4 + 7 = 8.4, idle time = 1 (b) 0 + 5.6 + 14.6 = 20.1, idle time = 0.6 (c) 0 + 1.4 + 7 = 8.4, idle time = 1 (d) 0 + 9 + 14 = 23, idle time = 0 http://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/5_CPU_Scheduling.html
3
D. Use case Diagram It gives the external view of the system
4
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 - 10 - 5 -$ And this goes into infinite recursion. And if we multiply $5$ with ... possible, there are infinite recursions possible (even considering this case only). So, (iv) is TRUE and (iii) is false. So, correct answer is (D).
6
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 learning and you should definitely go for MTech or MS.
9
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having all edges of maximum ... in $G$ having all edges of maximum weight. Edge $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
12
In a data link protocol, the frame delimiter flag is given by $0111$. Assuming that bit stuffing is employed, the transmitter sends the data sequence $01110110$ as $01101011$ $011010110$ $011101100$ $0110101100$
14
The number $(123456)_8$ is equivalent to $(A72E)_{16}$ and $(22130232)_4$ $(A72E)_{16}$ and $(22131122)_4$ $(A73E)_{16}$ and $(22130232)_4$ $(A62E)_{16}$ and $(22120232)_4$
15
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, a), (f, \epsilon)), ((f, a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$
16
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[i], i \neq 0$, is? $\left \lfloor \dfrac i 2 \right \rfloor$ $\left \lceil \dfrac{i-1}{2} \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil - 1$
19
The formula used to compute an approximation for the second derivative of a function $f$ at a point $X_0$ is $\dfrac{f(x_0 +h) + f(x_0 – h)}{2}$ $\dfrac{f(x_0 +h) - f(x_0 – h)}{2h}$ $\dfrac{f(x_0 +h) + 2f(x_0) + f(x_0 – h)}{h^2}$ $\dfrac{f(x_0 +h) - 2f(x_0) + f(x_0 – h)}{h^2}$
21
A language is a set of strings. Regularity property is for such sets. We cannot apply it to a single string. If you put that string in a set, it becomes a singleton set- which is finite and hence regular also.
22
24) a. It will depends on value of x.. U can decide others 3 process sequence I.e 3,5,6 Now x can come anywhere depending on its value.. Remember we shld gve it in increasing order to minimize response time
23
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining with itself. Which of the ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$
24
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$
To see more, click for the full list of questions or popular tags.