Register
Filter

Recent activity by Anand.

0 answers
1
MIT Assignment
f(n) = O(g(n)) and g(n) = O(f(n)),then f(n) = g(n) ---> True or False The answer to this question is False and this the explanation given by them " False: f(n) = n and g(n) = n+1". Someone please explain what are they trying to say.
f(n) = O(g(n)) and g(n) = O(f(n)),then f(n) = g(n) - True or FalseThe answer to this question is False and this the explanation given by them " False: f(n) = n and g(n)...
3 answers
2
doubt toc
wxw ;w,x belongs to {a,b}* this regular or dcfl or cfl??? somewhere it is written as regular but dontknow why??
wxw ;w,x belongs to {a,b}*this regular or dcfl or cfl??? somewhere it is written as regular but dontknow why??
1 answer
3
Verifying Relational Algebra Question
I think it should be option a) All query $1,3,4$ are equivalent but $2$ is not equivalent. Query $2$ should be $\prod \text{Room no,hotel no,type,price}(\sigma \text{type='single' } \wedge \text{price=200 })$
I think it should be option a)All query $1,3,4$ are equivalent but $2$ is not equivalent.Query $2$ should be $\prod \text{Room no,hotel no,type,price}(\sigma \text{type='...
2 answers
5
SQL_IN_Query
Answer should be $0$ row,right?
Answer should be $0$ row,right?
2 answers
6
Bit stuffing
A message M = 11111111 after bit stuffing with End delimeter as 111 will be sent as____________?
A message M = 11111111 after bit stuffing with End delimeter as 111 will be sent as____________?
1 answer
7
#Deterministic Finite Automata
Is there any difference in (a + b)* and a*b* ? If yes then what is the language generated by this ?
Is there any difference in (a + b)* and a*b* ?If yes then what is the language generated by this ?
2 answers
9
made easy test series
Consider a man is known to speak truth 3 out of 5 times, he throw a die and reports the number obtained is 2. What is the probability that the number obtained is actually 2?
Consider a man is known to speak truth 3 out of 5 times, he throw a die and reports the number obtained is 2. What is the probability that the number obtained is actually...
1 answer
10
madeeasy test series os
Q1: SAFE OR NOT?? i have doubt with the answer given becz i am getting safe for question 1 and unsafe for question 2 but opposite answer is given in test series/.
Q1: SAFE OR NOT??i have doubt with the answer given becz i am getting safe for question 1 and unsafe for question 2 but opposite answer is given in test series/.
0 answers
11
nptel
Match the following: List – I 1. Data link layer 2. Network layer 3. Transport layer 4. Presentation layer List – II i. Encryption ii. Connection control iii. Routing iv. Framing
Match the following: List – I 1. Data link layer 2. Network layer 3. Transport layer 4. Presentation layer List – II i. Encryption ii. Connection control iii. Routing...
1 answer
12
TOC SELF DOUBT
THE MINIMAL FINITE AUTOMATA THE STRING IN R=0*1*______STATES.
THE MINIMAL FINITE AUTOMATA THE STRING IN R=0*1*______STATES.
0 answers
13
gate 2001
what is the converse of the following assertion. ? I stay only if you go a)I stay if you go b) if I stay then you go c)If you do not go then I do not stay d)if I do not stay then you go
what is the converse of the following assertion. ?I stay only if you goa)I stay if you gob) if I stay then you goc)If you do not go then I do not stayd)if I do not stay t...
0 answers
14
Ace Algorithms
What is the time complexity? i=n; while(i>0) { k=1; for(j=1;j<=n;j+=k) k++; i=i/2; } a) O(n2) b) O(n logn) c) O(log2n) d) O(logn n1/2
What is the time complexity?i=n; while(i>0) { k=1; for(j=1;j<=n;j+=k) k++; i=i/2; }a) O(n2)b) O(n logn)c) O(log2n)d) O(logn n1/2
1 answer
16
#Number system
Consider a computer system that stores floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two’s complement. The smallest and largest positive values which can be stored
Consider a computer system that stores floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two’s complement. The smallest and largest positive va...
1 answer
17
#Digital logic
The output of a tristate buffer when the enable input in 0 is Always 0 Always 1 Retains the last value when enable input is high Disconnected state
The output of a tristate buffer when the enable input in 0 isAlways 0Always 1Retains the last value when enable input is highDisconnected state
2 answers
20
#Test series
Consider the minimal Finite automata that accepts all the strings of a’s & b’s where each string contains (i) exactly 5 a’s (ii) atmost 5 a’s The No. of states in each case respectively are:
Consider the minimal Finite automata that accepts all the strings of a’s & b’s where each string contains(i) exactly 5 a’s(ii) atmost 5 a’sThe No. of states in ea...
1 answer
22
#Self doubt
L = {x^a y^a : a ≥ 1} I. L^3 is context free. II. ⌈√ L⌉ is not context free. Which of the following is correct? (a) I only (b) II only (c) Both I and II (d) None of the above
L = {x^a y^a : a ≥ 1}I. L^3 is context free.II. ⌈√ L⌉ is not context free.Which of the following is correct?(a) I only (b) II only(c) Both I and II (d) None of th...
2 answers
23
#Self Doubt
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s.
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s.
1 answer
24
Ace volume-2 divide and conquer method
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys? here, ans is 24 sec how it is plz explain me.
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys?here, ans is 24 sec how it is plz explain me.
3 answers
25
Made Easy test series DS
The number of binary search trees possible with 12 keys, when keys 1, 2, 3, 4, ........ 12 are inserted into empty Binary Search Tree with condition such that 4 is the root of binary search tree and 8 is immediate right child of 4 are ________.
The number of binary search trees possible with 12 keys, when keys 1, 2, 3, 4, ........ 12 are inserted into empty Binary Search Tree with condition such that 4 is the r...
1 answer
27
made easy test series
Consider P and Q be language over Σ = {0, 1} represented by the regular expression 0* (10*)* and (0* + 1*)* respectively. Which of the following is true? A) P⊂Q B) Q⊂P C) P=Q D)P∩Q=0*1*
Consider P and Q be language over Σ = {0, 1} represented by the regular expression 0* (10*)* and (0* + 1*)* respectively. Which of the following is true?A) P⊂QB) Q⊂P...
0 answers
28
Finite automata
2 answers
29
Test-series algorithms
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2. void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) printf("GeeksforGeeks"); }
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2.void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j...
7 answers
30
Let f(n)= Ω(n), g(n)= O(n) and h(n)= Ѳ(n).
Let $f(n)= &Omega;(n), g(n)= O(n)$ and $h(n)= &#1138;(n)$. Then $[f(n). g(n)] + h(n)$ is: &Omega; (n) O (n) &#1138; (n) None of these
Let $f(n)= &Omega;(n), g(n)= O(n)$ and $h(n)= &#1138;(n)$. Then $[f(n). g(n)] + h(n)$ is:&Omega; (n)O (n)&#1138; (n)None of these