4 votes
122
L1={w|starts with a and ends with b}L2={w|starts with b and ends with a}then L1 ⋂ L2 will be:1. Finite2.CFL but not regular3.none of the above.
0 votes
124
Consider the following scheduleS : R2(A), R1(A), W1(C), R3(C), W1(B), R4(B), W3(A), R4(C), W2(D), R2(B), W4(A), W4(B)What is the number of Serial Schedules which are equa...
0 votes
132
0 votes
133
What is the concatenation of (a+b)*.a^nb^n?Shouldnt this be context free?
2 votes
138
a relational schema R (A, B, C, D) is decomposed into (A, B), (B, C), (B, D). If functional dependencies A → B, B → C, C → D and D → B were present in R, is the d...
5 votes
139
1 votes
140
I am unable to get this logic since in both of these algorithms we need to have a record of future requirement of the processes so then why is it that resource allocation...
0 votes
142
1 votes
143
can we say that:TCP uses only selective/independent acknowledgment not cumulative as it uses selective reject protocol???and go back N uses both independent and cumulativ...
0 votes
144
how it works??
1 votes
145
As Ipv4 datagram format contains 16 bit header checksum.Then why can't we say that network layer perform error control?
0 votes
146
A foreign key can refer to columns in another table, that areA. Primary key onlyB. Candidate key onlyC. Unique column only.D. Foreign key can refer any column
0 votes
147
Which are invalid process state transition?a. Timer Start: ready->runningb. Timer Out: running->blockedc. I/O: running->readyd. Resume : suspend->running