1 answer
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 ...
1 answer
4
#include <stdio.h>int main(){ int i = 8; int p = i++*i++; printf("%d\n", p);}
1 answer
5
#include<stdio.h int main() { char num = '\011'; printf("%d",num); return 0; }
1 answer
11
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)
1 answer
14
1 answer
15
can anyone help me to solve this? a little bit confused about 100K and 30K.
2 answers
20
1 answer
22
1 answer
25
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...
2 answers
27
Consider the following relations:How many number of records will be returned by the following query?
1 answer
30
In crash recovery in the checkpoint mechanism. Till the last checkpoint for all committed transactions redo will be done and all uncommited transactions undo is done. Can...