0 votes
3
How many ways are there for a horse race with three horses to finish if ties are possible.(Two or three horses may tie).
4 votes
4
3 votes
7
No. Of serial schedules view equal to SS: R1(A), R3(D), W1(B), R2(B), W3(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) .If possible please provide detailed solutions.Thank...
2 votes
13
a.9’s complement circuitb.0’s complement circuitc.5’s complement circuitd.9’s complement circuit if C3 = 0 and 10’s complement circuit if C3 = 1
2 votes
15
10 votes
16
In $\text{IEEE}$ floating point representation, the hexadecimal number $\text{0xC0000000}$ corresponds to$-3.0$$-1.0$$-4.0$$-2.0$
4 votes
17
Consider the following scheduling: A.Gang schedulings.Guaranteed schedulingB.Rate monotonic schedulingt.Thread schedulingC.Fair share schedulingu.Real-time schedulingMatc...
2 votes
18
1) $9^{1015}mod 21=?$2)$11^{999}mod 17=?$
4 votes
22
Give the language accepted by the above NFA and #states in DFA accepting that language is _________________
15 votes
25
What is the minimum number of students needed in a class to guarantee that there are at least $6$ students whose birthdays fall in the same month ?$6$$23$$61$$72$$91$
2 votes
29