Register
Filter

Recent activity by TusharKumar

1 answer
2
Made Easy test series
answer given is 33
answer given is 33
2 answers
3
Operating System(Process)
A process executes the following segment of code: int main(){ fork(); fork() && fork(); } The number of new processes created is
A process executes the following segment of code: int main(){fork();fork() && fork();}The number of new processes created is
1 answer
4
Made Easy Test Series
p ->(q->r). Could you please tell me how it is a tautology?
p ->(q->r). Could you please tell me how it is a tautology?
0 answers
6
Made Easy
can anyone help me how to approach these type of questions..? And also please attach link of similar questions if possible . thanks in advance
can anyone help me how to approach these type of questions..? And also please attach link of similar questions if possible .thanks in advance
3 answers
7
Made easy Gate mock test -1
A Boolean Function must satisfy the condition f(a,b,c) = f(c,b,a). how many such functions are possible?
A Boolean Function must satisfy the condition f(a,b,c) = f(c,b,a). how many such functions are possible?
1 answer
9
Self Doubt
Consider L is recursive language and G is Recursively Enumerable then, L' union G is Recursively enumerable. Can someone please explain me this statement why it is true.?
Consider L is recursive language and G is Recursively Enumerable then,L' union G is Recursively enumerable. Can someone please explain me this statement why it is true.?...
0 answers
10
Made Easy Gate Mock -1
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
1 answer
14
made easy mock 1 2022
persistent connection require all info at one time while non persistent require every time a new connection can any one solve this question..
persistent connection require all info at one timewhile non persistent require every time a new connection can any one solve this question..
0 answers
15
Made easy test series question
Any one please let me know if there is any other way to this output?
Any one please let me know if there is any other way to this output?
2 answers
16
DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$} Is the above language DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?
3 answers
17
Made Easy Mock -1
how does the program is working..? answer – 8
how does the program is working..?answer – 8
0 answers
18
Unacademy AIMT 1
How many integers are there in the set {1,2,3,…..,1000} with no digit being repeated?
How many integers are there in the set {1,2,3,…..,1000} with no digit being repeated?
0 answers
19
Unacademy AIMT 1
The correct answer given is 3.
The correct answer given is 3.
0 answers
20
Unacademy AIMT -1
the answer is 28
the answer is 28
1 answer
22
unacademy AIMT 2
In go back 5, if every 7th packet that is being transmitted is lost and if we have to send 10 packets, then how many transmissions are required____. I’m getting 15 but the given answer is 14
In go back 5, if every 7th packet that is being transmitted is lost and if we have to send 10 packets, then how many transmissions are required____.I’m getting 15 but t...
1 answer
23
Unacacdemy AIMT 2
can anyone explain how the for loop works here..?
can anyone explain how the for loop works here..?
1 answer
24
Hello sir, If I subscribe to GO Combined Test series. Can I also get the access of all the test of ISRO,TIFR, UGC-Net, etc. ?
Hello sir, If I subscribe to GO Combined Test series. Can I also get the access of all the test of ISRO,TIFR, UGC-Net, etc. ?