Register
Filter

Recent activity by Mr_22B

8 answers
1
GATE CSE 2006 | Question: 34
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is: $3$ $5$ $8$ $9$
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is:$3$$5$$8$$9$
1 answer
5
doubt view serializability
anyone who can solve this by this methos i think it has some mistakes ?
anyone who can solve this by this methos i think it has some mistakes ?
1 answer
7
ace test series 2018
Boolean expression Y+(X+Y)+(X+Y')(X'+Y) IS equivalent to A)X'Y B) XY' C)Y D)X'Y' please explain i think ans is 1 but ans is given as C
Boolean expression Y+(X+Y)+(X+Y')(X'+Y) IS equivalent toA)X'YB) XY'C)YD)X'Y'please explain i think ans is 1 but ans is given as C
1 answer
8
#Toc
I read some where that if thier is one comparision at any time then only CFL otherwise CSL? plz give proof.
I read some where that if thier is one comparision at any time then only CFL otherwise CSL?plz give proof.
2 answers
10
Ace Test Series: Programming & DS - Linked Lists
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N) A. O(1) B. O(N)
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N)A. O(1)B. O(N)
1 answer
11
ace test
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with single node is 0.]
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with ...
1 answer
12
[DS] Graph reversal
What will be complexity to reverse the directed graph?(By reverse i mean reverse direction of all edges).Assume graph is represented by adjacency list. i) No extra space ii)May use extra space
What will be complexity to reverse the directed graph?(By reverse i mean reverse direction of all edges).Assume graph is represented by adjacency list.i) No extra spaceii...
1 answer
14
doubt in branching method
https://www.youtube.com/watch?v=Z4rgivgkNVc&t=1s anyone please tell me if i choose f instead of b at 7:21 then answer will be different there are so many different answers possible here ??
https://www.youtube.com/watch?v=Z4rgivgkNVc&t=1s anyone please tell me if i choose f instead of b at 7:21 then answer will be different there are so many different a...
2 answers
17
Recurrance Relations
3 answers
20
TIFR CSE 2012 | Part B | Question: 14
Consider the quick sort algorithm on a set of $n$ ... $\Theta (n^{2})$. None of the above.
Consider the quick sort algorithm on a set of $n$ numbers, where in every recursive subroutine of the algorithm, the algorithm chooses the median of that set as the pivot...
1 answer
21
self doubt apply
can masters theorem be used when base condition is given in a recurrence ? can we directly apply masters theorem to any recurrence ?
can masters theorem be used when base condition is given in a recurrence ?can we directly apply masters theorem to any recurrence ?
10 answers
23
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
Consider the following functions$f(n) = 3n^{\sqrt{n}}$$g(n) = 2^{\sqrt{n}{\log_{2}n}}$$h(n) = n!$Which of the following is true?$h(n)$ is $O(f(n))$$h(n)$ is $O(g(n))$$g(n...
2 answers
24
C Programming
Which of the following is the correct output for the program given below? #include<stdio.h> void fun(int); int main() { int a; a=3; fun(a); printf("\n"); return 0; } void fun(int n) { if(n>0) { fun(--n); printf("%d",n); fun(--n); } } (a) 0 2 1 0 (b) 1 1 2 0 (c) 0 1 0 2 (d) 0 1 2 0
Which of the following is the correct output for the program given below?#include<stdio.h void fun(int); int main() { int a; a=3; fun(a); printf("\n"); return 0; } void f...
1 answer
25
Hashing
The average number of probe required when inserting an element with load factor alpha (assume uniform hashing) 1 / 1-alpha how? Please explain
The average number of probe required when inserting an element with load factor alpha (assume uniform hashing) 1 / 1-alpha how? Please explain