5 votes
2 answers
41
Draw a minimal DFA which accepts a language L over {a,b}01 [ ((10) * + 111) * + 0 ] * 1
2 votes
1 answer
42
Wha is the relationship between the running time of insertion sort and the number of inversions in the input array ?Is the circled text should be greater instead of less ...
0 votes
0 answers
43
1 votes
1 answer
44
2 votes
1 answer
45
2 votes
1 answer
46
0 votes
0 answers
47
4 votes
1 answer
48
Given the following set of FD's find the minimum set of 3 NF relations.A->B A->CB->CB->DD->BABE->FE->JEJ->HH->G
5 votes
5 answers
49
Total no. of ways to perform matrix multiplication having 7 matrices is ?Total no. of ways to by which we could parenthesize 7 matrices is ?Does the above two questions ...
1 votes
1 answer
50
Could anyone describe how the partitioning algorithm vary when the pivot is varied ?In Cormen , last element is taken as pivot . Suppose I took first element or middle e...
1 votes
1 answer
51
Let X and Y be independent random variables each taking the values -1 or 1 with probability 1/2. Let Z=XY . Show that X,Y,Z are pairwise independent .Are they indepeneden...
–1 votes
1 answer
53
What will be the time complexity of a function f(n) = n^-2 i.e. pow (n,-2) ?
2 votes
3 answers
54
What type of conversion is not accepted in C ?a. from char to int b. from float to char pointerc.from negative int to chard. from double to char
3 votes
5 answers
55
#include<stdio.h>int f(int a){ a 20 ? return 10: return 20;}int main(){int b=fun(20);return 0;}what will be the output of this program ?
1 votes
2 answers
56
#include<stdio.h>int main(){short int i=20;char c=97;printf("%d %d %d\n",sizeof(i),sizeof(c),sizeof(i+c));return 0;} could anyone explian why the answer of sizeof(i+c) is...
1 votes
0 answers
57
0 votes
1 answer
58
Suppose det(A)=4 then how we could find the det(a^4) ?A is a square matrix of order 4X4 .
1 votes
2 answers
59
What is subnet mask ?Plz explain why do u need subnet mask in Computer Networks ? PS: I want high level explanation plz do not give any fundamental explanation .
0 votes
1 answer
60
While solving this recurrence T(n) = 2T(n/2 + 17) + n what is the need of 17 and how to go forward to solve this question using the method of master theorem ?