Register
Filter

Answers by adarsh_1997

2 votes
2
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
2 votes
3
GATE CSE 2012 | Question: 12
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
What is the complement of the language accepted by the NFA shown below?Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string.$\phi$$\{\epsilon\}$$a^*$$\{a , \epsilon...
1 votes
5
DIgital MUX GFG TEST
1 votes
6
Self doubt TOC DFA
Construct a minimal DFA which accepts set of all strings over {a,b}, such that $1)$Second symbol from $RHS$ should be $‘a’$ $2)$Third symbol from $RHS$ should be $‘a’$
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a�...
1 votes
10
Limit
Please try to answer without using any standard result as i cant remember them.
Please try to answer without using any standard result as i cant remember them.
0 votes
11
Job Sequencing Problem (Greedy Algorithm)
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$ $A)1$ $B)2$ $C)3$ $D)All$
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$$A)1$ ...
1 votes
12
please explain also..
5 votes
13
find out the no. of spanning tree possible
How many spanning trees are possible from the graph given below? $24$ $34$ $44$ $54$
How many spanning trees are possible from the graph given below?$24$$34$$44$$54$
7 votes
14
Self doubt Spanning tree
How many numbers of spanning tree are possible?
How many numbers of spanning tree are possible?
1 votes
17
GateForum
Can anyone please explain
Can anyone please explain
2 votes
19
Deadlock
If the total number of resources available is 6 and each process requires 3 instances of a resource to complete execution. Then what is the number of processes that can exist in this system without causing a deadlock?
If the total number of resources available is 6 and each process requires 3 instances of a resource to complete execution. Then what is the number of processes that can e...
0 votes
20
number of conflict schedules
https://gateoverflow.in/178786/transaction can anyone confirm this question answer i am getting 90
https://gateoverflow.in/178786/transactioncan anyone confirm this question answer i am getting 90
5 votes
21
Static Single Assignment form
Consider the following code generation: a=b+c; c=a+x; d=b+c; b=a+x; The minimum no. of total variables required to convert the above code to static single assignment form is______
Consider the following code generation:a=b+c;c=a+x;d=b+c;b=a+x;The minimum no. of total variables required to convert the above code to static single assignment form is__...
1 votes
22
#MADE NOTE
F={AB$\rightarrow$C,A$\rightarrow$C} G={A$\rightarrow$C} FIND EQUVALIANT ARE NOT?
F={AB$\rightarrow$C,A$\rightarrow$C}G={A$\rightarrow$C} FIND EQUVALIANT ARE NOT?
0 votes
24
#CD Doubt
#CD compute first and follow for S->SS+\SS*\a
#CDcompute first and follow forS->SS+\SS*\a
1 votes
25
Self Doubt
How to decide in which question process will run completely and where preemption needs to be taken while solving semaphore questions? Is there any predefined method?
How to decide in which question process will run completely and where preemption needs to be taken while solving semaphore questions? Is there any predefined method?
1 votes
26
Gilbert Strang
$\int \frac{x^3}{\sqrt{1+x^2}}.dx$
$\int \frac{x^3}{\sqrt{1+x^2}}.dx$
0 votes
27
Self Doubt
A relation R is in 2NF if every non-prime attribute of R is fully functionally dependent on every key of R true or false R(A,B,C) F {A->B,B->C} Here key = A R is in 2NF So is C is fully functional dependent on every key here ?. It is not dependent on key infact ?
A relation R is in 2NF if every non-prime attribute of R is fully functionally dependent on every key of R true or falseR(A,B,C)F {A->B,B->C}Here key = AR is in 2NFSo is...
Page: