Register
Filter

Recent questions

#19461
348
views
0 answers
0 votes
raman classes test series
..an getting 0.00010650
User Avatar
#19462
222
views
0 answers
0 votes
#books q
the number of algebric terms in expansion of a determinant of order 5 is
User Avatar
#19463
1.9k
views
0 answers
0 votes
Short cut to calculate d (private key) ins RSA algorithm
Please tell me shortcut to calculate d (private key) in RSA Algorithm
User Avatar
#19464
306
views
1 answers
0 votes
Limit
Please try to answer without using any standard result as i cant remember them.
User Avatar
#19465
473
views
0 answers
0 votes
Breadth First Search(BFS)
$0-1$ $BFS$ (Breadth First Search)al is used to find the shortest distance between two nodes in a graph providedthat the edges in the graph have the weights $0$ or $1.$Which of ... $C)$ Double-ended queue $D)$ Linked list
User Avatar
#19466
584
views
1 answers
0 votes
Graph Search
Which of the following statements are true? In a depth-first search of an undirected graph $G,$every edge of $G$ is either a tree edge or a back edgeForward and cross edges never occur ... $1$ and $2$ $2$ and $3$ All of these
User Avatar
#19467
885
views
0 answers
0 votes
Depth First Search (DFS)
Consider the following sequence of nodes for the undirected graph given below$:$(1)PQSTWVUR$(2)PQRSTUWV$(3)PQRTUSVW$A Depth First Search (DFS) is started at node $ ... )$B)(1) and (2)$C)(2) and (3)$D)(1) and (2)$
User Avatar
#19468
3.0k
views
2 answers
0 votes
Fibonacci number time complexity
Consider the following code segment to find the $n^{th}$ Fibonacci number:Fib(n) { if(n==0) {return 0;} if(n==1) {return 1;} else { return(Fib(n-1) + Fib(n-2)) ... O(n)$B)O(2^{n}),O(n)$C)O(2^{n}),O(n^{2})$D)$None of the above
User Avatar
#19469
324
views
0 answers
0 votes
test series(virtual gate)
consider the grammer S->SS/a/$\epsilon$ .what will be the total number of inadequate state in DFA for LR(1) items is....................explanation require.
User Avatar
#19470
819
views
1 answers
0 votes
why is the conclusion incorrect for the below premises ?
I am getting the conclusion to be true by Proof by Contradiction , what's wrong in the approach ?
User Avatar
#19471
408
views
0 answers
0 votes
self doubt about dense index
In dense index the index is created for every search key value, does it mean for every record there will be an entry in the dense index? if yes then clustering index ... is not an entry in clustering index, thus it is non-dense. What is it?
User Avatar
#19472
1.2k
views
0 answers
0 votes
NUMBER OF TOKENS
++++---+=+=+=-+-+&*+-&&&===<<==**/*++++-++-+-***/***+-+-+-&&&&===<<>>*** HOW MANY TOKENS ARE THERE
User Avatar
#19473
1.3k
views
1 answers
0 votes
test series - Testbook
Which of the following functions given by their recurrences grows the fastest asymptotically?$T(n) = 8T(n/4) + 100n^2$T(n) = 81T(n/9) + 10n^2$T(n) = 16T(n/4)+ 100(n \log n)^{1.99}$T(n) = 100T(n/100)+ n \log^2 n$
User Avatar
#19474
441
views
0 answers
0 votes
raman classes test series
Consider the following functions f and g:f(){ x = x+1; x = y*y; x = x-y; }g(){ y = y+1; y = x*x; y = y-x; }Suppose we start with initial values of 1 for x and 2 for ... final state?x = 2, y = 2x = 5, y = -1x = -63, y = 72x = 32, y = 5
User Avatar
#19475
376
views
0 answers
0 votes
self doubt
It has been proved that A<B i.e A is polynomial reducible to B. The polynomial reductionn is carried out in time of O(n). The problem B can be solved in O(n^3) time. what is them taken to sovle problem A ??
User Avatar
#19476
1.9k
views
2 answers
2 votes
Probability
In four tests taken by 450 students, marks are found to be normally distributed with mean and variance as given belowTest IdMeanVariance174121275100378196482169 A has secured ... .(A)Fourth Test(B)Third Test(C)Second Test(D)First Test
User Avatar
#19477
306
views
0 answers
0 votes
chache performance between hoare and loranto quicksort
between hoare and loranto quicksort which give better cache performance ?we know that in hoare quicksort we move the pointer i,j in different direction but in ... i,j in same directionso the cache performance of loranto should be better?
User Avatar
#19478
440
views
0 answers
0 votes
Ripple carry adder
Refer : https://gateoverflow.in/8250/gate2015-2-48Here i dont understood how they calculated 12ns . I got that the first full adder will take 4.8ns time at that 4.8 ... need to be propagated through all full adder firstWhy 4.8 + 3*2.4 ??
User Avatar
#19479
217
views
0 answers
–1 votes
raman classes test series
i think it should be d!both have same no. of misses that is 10001
User Avatar
#19480
264
views
0 answers
0 votes
raman classes test series
i am getting c as 4,7,13,14 onlybut given answer is that there are 5 distinct values
User Avatar
Page: