Register
Filter

Answers by minal

17 votes
42
GATE CSE 1991 | Question: 01-xii
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
0 votes
47
process
If a process on the system could issue an I/O request then the process will be placed on which of the following ? a)Ready State b) Running state c) ready queue d) I/o queue
If a process on the system could issue an I/O request then the process will be placed on which of the following ?a)Ready Stateb) Running statec) ready queued) I/o queue
0 votes
48
DBMS SQL query (3)
26 votes
51
TIFR CSE 2010 | Part A | Question: 7
The limit of $\dfrac{10^{n}}{n!}$ as $n \to \infty$ is. $0$ $1$ $e$ $10$ $\infty$
The limit of $\dfrac{10^{n}}{n!}$ as $n \to \infty$ is.$0$$1$$e$$10$$\infty$
2 votes
52
ISRO2011-69
Lightweight Directory Access protocol is used for Routing the packets Authentication obtaining IP address domain name resolving
Lightweight Directory Access protocol is used forRouting the packetsAuthenticationobtaining IP addressdomain name resolving
2 votes
54
GATE CSE 2005 | Question: 36
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n-1)k + 1$ $n(k-1) +1$ $n(k-1)$
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is:$nk$$(n-1)k + 1$$n(k-1) +1$$n(k-1)...
3 votes
59
Which of the following changes to typical QuickSort improves its performance on average and are generally done in practice ?
1) Randomly picking up to make worst case less likely to occur. 2) Calling insertion sort for small sized arrays to reduce recursive calls. 3) QuickSort is tail recursive...
60 votes
62
GATE CSE 2008 | Question: 17
Which of the following system calls results in the sending of SYN packets? $\textsf{socket}$ $\textsf{bind}$ $\textsf{listen}$ $\textsf{connect}$
Which of the following system calls results in the sending of SYN packets?$\textsf{socket}$$\textsf{bind}$$\textsf{listen}$$\textsf{connect}$
2 votes
63
Given n points in the xy plane, what is the time complexity to find the closest pair?
what is the approach of this question , Is it that first we will traverse all the pairs then find the minimum distance between all the pairs
what is the approach of this question , Is it that first we will traverse all the pairs then find the minimum distance between all the pairs
2 votes
64
minimum no. of states
6 votes
67
Elimination of epsilon
Question : (Here e=epsilon) S->A|B, A->e, B->aBb, B->b My answer is : S->B, B->aBb , B->b or S->B|e , B->aBb , B->b Want to know which one is correct ? please explain...
Question : (Here e=epsilon) S->A|B, A->e, B->aBb, B->bMy answer is :S->B, B->aBb , B->b orS->B|e , B->aBb , B->bWant to know which one is correct ? please explain...
5 votes
69
set theory
difference between {} , ∅ , {∅} ???
difference between {} , ∅ , {∅} ???
54 votes
70
GATE CSE 2004 | Question: 45
Consider the grammar with the following translation rules and $E$ ... root of the parse tree for the expression:$2$ # $3$ & $5$ # $6$ & $4$ $200$ $180$ $160$ $40$
Consider the grammar with the following translation rules and $E$ as the start symbol$$\begin{array}{lll}E \rightarrow E_ 1\# \: T & \qquad\left\{E.value = E_1.value * ...
Page: