0 votes
0 answers
3
I HAVE ONE DOUBT REGARDING THE STARVATION AND BOUNDED WAITING BOUNDED WAITING → ~STARVATION THEN USING THE CONCEPT OF CONTRAPOSITIVE IT CAN BE STARVATION → ~BOUNDED ...
0 votes
1 answer
6
http://faculty.simpson.edu/lydia.sinapova/www/cmsc365/LN365_Lewis/L03-ExampleDiagonal.htmCan someone explain with the diagonalizable table of first problem.viz; power set...
0 votes
0 answers
7
does DPDA have epsilon transition ??
2 votes
0 answers
8
does ring latency in token passing in the syllabus ??
0 votes
1 answer
9
ipv6 and wifi has been asked in any gate examination ???
0 votes
1 answer
10
0 votes
1 answer
11
is view seriziability came into the npc problem ??
0 votes
1 answer
12
difference between point to point and peer to peer ???
0 votes
1 answer
13
Find time of second meeting of 2 ducks moving at 10km/hr and 18km/hr in opposite direction along the circumference of a circular pond. Initailly they are present at any p...
0 votes
0 answers
14
is p and np problem are in syllabus in toc ???
1 votes
2 answers
15
(11+1111)* minimized number of states ???
2 votes
1 answer
16
why recursive enumerable languages does not satisfy the complementation property ???
0 votes
0 answers
17
what is the worst case possible height of an avl tree ???https://www.geeksforgeeks.org/practice-questions-height-balancedavl-tree/how does 1.44*logn comes ????
1 votes
0 answers
18
is it necessary for the gate exam that minimisation of dfa can be solved by partitiong method ?? will it be safe to escape partitining method and problem can be solved by...
0 votes
2 answers
19
#include<iostream>using namespace std;int main(){ int a[] = {10,20,30,40,50}; cout<<(*(&a+1)-a); return 0;}how th o/p is 5 ??
0 votes
1 answer
20
what is chromatic number for the above graph?also is it isomorphic ?