0 votes
2
#include<stdio.h int main() { char num = '\011'; printf("%d",num); return 0; }
2 votes
3
In Dining philospher problem, there are X number of dinners and Y number of chopsticks. What is the minimum number of chopsticks required to insure that there will be no ...
0 votes
8
For 12L85M to be divisible by 8 and 9, (L, M) should be(A) (2, 8)(B) (5, 6)(C) (3, 4)(D) (1, 8)
0 votes
10
1 votes
12
can anyone help me to solve this? a little bit confused about 100K and 30K.
4 votes
17
0 votes
19
1 votes
22
Let the predicates $D(x,y)$ mean “team $x$ defeated team $y$” and $P(x,y)$ mean “team $x$ has played team $y$”. The quantified formula for the statement that ther...
1 votes
23
Consider the following relations:How many number of records will be returned by the following query?
1 votes
26
G(V,T,P,S) V={S,A,B} T={a,b,c,d} S->aAb/bB A->b/cA B->cB/d. Is the above grammar Regular?