Register
Filter

Recent activity by sourav.

2 answers
1
Made Easy Test Series
What is worst case time complexity to delete middle element from the min heap of n distinct elements? O(logn) O(n) O(nlogn) O($n^{2}$)
What is worst case time complexity to delete middle element from the min heap of n distinct elements?O(logn)O(n)O(nlogn)O($n^{2}$)
0 answers
2
made easy
Consider the following c code int f(int x) { if(x<1) return 1; else return f(x-1)+g(x); } int g(int x) { if (x<2) return 1; else return f(x-1)+g(x/2); } Of the following ,which best describes the growth of f(x) as a function of x? a) logarithmic b) quadratic c) linear d)exponential
Consider the following c code int f(int x) { if(x<1) return 1; else return f(x-1)+g(x); } int g(int x) { if (x<2) return 1; else return f(x-1)+g(x/2); }Of the following ,...
2 answers
3
MIT ASSIGNMENT
Find the complexity of the following function when called with some integer n: void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k = 1 ; k <= j ; k++) { x=x+10; } }
Find the complexity of the following function when called with some integer n:void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k ...
3 answers
4
self doubt RSA Algorithm
How To Solve..? 17 * d = 1 mod 3120. should we need to apply bruteforce?
How To Solve..? 17 * d = 1 mod 3120.should we need to apply bruteforce?
0 answers
5
Probability
Parcels from sender to receiver pass sequentially through 2 post office.Each post office has a probability 1/5 of loosing an incoming parcel,independently of all other parcels.Given that a parcel is lost, the probabilty that it was lost by the second post office is....??
Parcels from sender to receiver pass sequentially through 2 post office.Each post office has a probability 1/5 of loosing an incoming parcel,independently of all other pa...
1 answer
7
Ace material
If a graph with 10 vertices having each vertex having degree >=5 find graph connected or disconnected
If a graph with 10 vertices having each vertex having degree >=5 find graph connected or disconnected
2 answers
8
Permutations with restrictions
$Z =\left \{ {A,B,C,D,E,F,G} \right \}$ How many permutations of all elements of set $Z$ are possible when A cannot appear after D and C cannot appear after F C cannot appear after D
$Z =\left \{ {A,B,C,D,E,F,G} \right \}$How many permutations of all elements of set $Z$ are possible when A cannot appear after D and C cannot appear after FC cannot appe...
2 answers
9
#Number System
$(70\,\,\,34\,\,\, 3\,)_{81} = (?)_3$ Any trick to solve this type of questions?
$(70\,\,\,34\,\,\, 3\,)_{81} = (?)_3$Any trick to solve this type of questions?
1 answer
11
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
2 answers
12
Number of relation
How many relations are there on a set with 10 elements that are reflexive and symmetric??
How many relations are there on a set with 10 elements that are reflexive and symmetric??
1 answer
13
#Regular Language
1 answer
14
logic and predicate
1 answer
15
definite finite automata
construct DFA which do not contain 11 as sub string but end with 0
construct DFA which do not contain 11 as sub string but end with 0
1 answer
17
Pipeline
A computer with a 5 stage pipeline deals with conditional branches by stalling for the next 3 cycle after hitting one. how much does stalling hurt the performance is 20% of all instructions are conditional branches.
A computer with a 5 stage pipeline deals with conditional branches by stalling for the next 3 cycle after hitting one. how much does stalling hurt the performance is 20% ...
0 answers
18
Pipeline
Suppose that a computer prefetches upto $20$ instructions in advance. on the average four of these are conditional branches, each with a probability of $90 \%$ of being predict correctly. what is the probability that the prefetching is on the right track?
Suppose that a computer prefetches upto $20$ instructions in advance. on the average four of these are conditional branches, each with a probability of $90 \%$ of being p...
4 answers
24
ISRO2008-79
Repeated execution of simple computation may cause compounding of round-off errors syntax errors run-time errors logic errors
Repeated execution of simple computation may cause compounding ofround-off errorssyntax errorsrun-time errorslogic errors
1 answer
25
#techtud What does the following fragment of C- program print?
What does the following fragment of C- program print? char t[] = "PROGRAM1234"; char *r = t; printf ("%s", r + r[6]- r[3]); Explain.
What does the following fragment of C- program print?char t[] = "PROGRAM1234"; char *r = t; printf ("%s", r + r[6]- r[3]);Explain.
1 answer
26
ISRO-2013-21
What will be the cipher text produced by the following cipher function for the plain text ISRO with key $k=7$. [ Consider $'A'=0, 'B'=1,....'Z'=25$] $C_{k} (M) = (kM + 13) \mod 26$ RJCH QIBG GQPM XPIN
What will be the cipher text produced by the following cipher function for the plain text ISRO with key $k=7$. [ Consider $'A'=0, 'B'=1,....'Z'=25$]$C_{k} (M) = (kM + 13)...
1 answer
28
ISRO-DEC2017-25
Let $L=\{a^p\mid p \text{ is a prime}\}.$ Then which of the following is true It is not accepted by a Turing Machine It is regular but not context-free It is context-free but not regular It is neither regular nor context-free ,but accepted by a Turing Machine
Let $L=\{a^p\mid p \text{ is a prime}\}.$ Then which of the following is trueIt is not accepted by a Turing MachineIt is regular but not context-freeIt is context-free b...
2 answers
29
UGC NET CSE | June 2014 | Part 3 | Question: 19
Match the following $:$ ... $\text{a-ii, b-i, c-iv, d-iii}$ $\text{a-iv, b-ii, c-i, d-iii}$
Match the following $:$ $\begin{array}{clcl} & \textbf{List – I}&& \textbf{List – II} \\ \text{a.} & \text{Correctness}& \text{i.} & \text{The extent to which a soft...