1 votes
0 answers
2
Solve the recurrence relation $T(n) = T(\sqrt{n}) + n$
2 votes
2 answers
3
main(){if(fork()>0)sleep(100);}The given code results in the creation of:I) an orphan processII) a zombie processIII) a process that executes foreverIV) None of these Ca...
0 votes
1 answer
5
Choose the digital building blocks from the following list using which we can realize any boolean function.(A) 2-to-1 Multiplexer(B) 4-to-1 Multiplexer(C) 8-to-1 Multiple...
0 votes
1 answer
6
What would be the equivalent pointer expression for referring the array element a[i][j][k][l]?A. ((((a+i)+j)+k)+l)B. *(*(*(*(a+i)+j)+k)+l)C. (((a+i)+j)+k+l)D. ...
1 votes
2 answers
8
Can someone solve this?Also please attempt this question on Algorithms time complexity if interested :)https://gateoverflow.in/210836/algorithms-time-complexity
2 votes
1 answer
9
0 votes
1 answer
10
0 votes
1 answer
13
How to find number of conflict equivalent schedules possible :)
0 votes
0 answers
14
Please help me with this How to find minimum number of NAND/ NOR gates for some given expression
4 votes
1 answer
15
The minimal finite automata accepting the set of all strings over 0,1 starting with 1 that interpreted as a binary representation of an integer are congruent to 0 modulo ...
0 votes
1 answer
16
Language {w | ww=www} is regular.How and what is this language?
0 votes
1 answer
17
Can someone explain me these two qns and solution :)
2 votes
0 answers
18
Consider the homomorphism h(a) = 11 amd h(b) = 10. Consider the inverse homomorphism of the regular set (01+00)*a) The resulting set is emptyb) The resulting set is 00*c)...
2 votes
1 answer
20
The total number of comparisons performed in a 8-bit magnitude comparator consist of inputs A[A4, A3, A2, A1] and B[B4, B3, B2, B1] then condition for A>B is :A 255 x 26B...