2 answers
1
2 answers
4
Consider the following programint find (int n) { int a = 1; for (i = 1; i < = n; i ++) for (j = 1; j < = i; j++) for (k = 1; k <= j, k++) a = a + 1; ...
0 answers
5
1 answer
9
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BSTHow to tackle this kind of problem. Anyone!
1 answer
14
Never done any problem in concept called purging in networking. can anyone tell me how to approach this. is this in syllabus?
0 answers
15
2 answers
16
I know the answer but need a good explanation for this question. Can anyone help. Thanks!
0 answers
17
2 answers
19
Consider the following schedule S:S: R3(A), W2(A), R1(A), W3(A), W1(A);The possible number of view serializable schedules of the schedule S (other than S) are _____Can so...
3 answers
20
1 answer
22
The following table givens the frequency of 4 letters in a database of textIf Huffman encoding is used to encode the word “aaabca” the number of bits required for it ...
1 answer
24
1 answer
25
int a = 50, b = 50;a = a+++++b;b = b+++++a; Value of b after executing these .I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify ...
1 answer
30
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 co...