2 answers
1
which of the following is not a strict schedule?A) R1(A),R2(A),W1(A),Abort1,W2(A),Commit2B) R1(A),R2(A),W1(A),Commit1,W2(A),Abort2C) R1(A),R2(A),W2(A),Commit2,W1(A),Commi...
1 answer
3
Suppose the functional dependencies B ->Cholds in a relation R(A,B,C,D).which additional FD will make R be in 3NF ,but not in BCNF?a)D ->AB b)AC ->Dc)CD >B ...
1 answer
4
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys?here, ans is 24 sec how it is plz explain me.
1 answer
7
#include<stdio.h void main() { int i; printf("%d", scanf("%d",&i)); //provide input as 100; }
1 answer
8
if c has value =0 initially ....i am getting MAX=2 and minimum =-2..is it correct??
1 answer
10
Is the following DFA valid ?? Can we go to same state from a same state with different inputs ??
3 answers
11
Which of the following is trueIn slow start phase cwnd1)Increase by 2mss after every successfull ack2) approximately double after every rtt3) increase by 1mss after every...
2 answers
12
1 answer
14
Consider a logical address space of eight pages of 1,024 words each, mapped on to a physical memory of 32 frames.a)How many bits are in logical address?b)How many bits ar...
1 answer
15
How many tokens are there?1) int a /*b2) printf ("%
2 answers
17
1 answer
18
Is this line a/*b successfully generating the token's or it give lexical error ? if it is given the lexical error then why so ?I think it will give lexical error because...
1 answer
19
1 answer
20
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
1 answer
21
1 answer
22
Fixed partitioning for contiguous memory allocation suffers from external fragmentation or not please explain with example