Register
Filter

Recent activity by Isha Karn

2 answers
1
Calculate effective address?
2 answers
3
Explain
6 answers
4
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
3 answers
5
No. of tables?
1 answer
6
Explain
2 answers
7
consider the following schedule:
S: R1(x), W2(x), R2(x), R3(x), W3(x) If the above schedule S is conflict equal to S' then find S' ? a) R1(x), R3(x), W2(x), R2(x), W3(x) b) R1(x), R2(x), R3(x), W2(x), W3(x) c) R1(x), R2(x), W2(x), W3(x), R3(x) d) none
S: R1(x), W2(x), R2(x), R3(x), W3(x)If the above schedule S is conflict equal to S' then find S' ?a) R1(x), R3(x), W2(x), R2(x), W3(x)b) R1(x), R2(x), R3(x), W2(x), ...
4 answers
9
Consider the following program
int i = 1; int main() { int a[]= { 0,1, 2} ; f(a[i], i); printf("%d", a[i]); } void f(int x, int y) { y++; x=5*i; } In above function f() uses " call by name" technique, what is the output printed? a) 2 b) 10 c) 5 d) 1
int i = 1; int main() { int a[]= { 0,1, 2} ; f(a[i], i); printf("%d", a[i]); } void f(int x, int y) { y++; x=5*i; }In above function f() uses " call by name" technique, w...
1 answer
10
Consider the following code
void main() { int x=10, y=5; swap(x,y); print(x,y); } void swap(int a, int b) { int c, x=0; c=a; a=b; b=c; } what is output using call by text? a) 5 0 b) 5 10 c) 10 0 d) 10 10
void main() { int x=10, y=5; swap(x,y); print(x,y); } void swap(int a, int b) { int c, x=0; c=a; a=b; b=c; }what is output using call by text?a) 5 0b) 5 10c) 10 0d) ...
2 answers
12
consider the program:
0 answers
13
what is the output?
void strfind( char dest[], char src[] ) { int i=0; while ((dest [i] = src[i]) != '\0') i++; printf("%s, %s", dest, src); } main() { char A[] = {'g', 'a', 't', 'e', '\0' }; char B[] = {'e', 'x', 'a', 'm', '1' }; strfind (B, A); }
void strfind( char dest[], char src[] ){int i=0;while ((dest [i] = src[i]) != '\0')i++;printf("%s, %s", dest, src);}main(){ char A[] = {'g', 'a', 't', 'e', '\0' }; ...
1 answer
14
Self doubt
Consider the following C code: char A[20]; A="gate"; Which of the following is correct? a) '\0' is automatically appended at the end of "gate". b) '\0' is not stored at the end of "gate" in array A. c) error produced by compiler d) none of these
Consider the following C code:char A[20]; A="gate";Which of the following is correct?a) '\0' is automatically appended at the end of "gate".b) '\0' is not stored at the e...
2 answers
15
Consider the following C code
main() { int x, y= 100; float *P; P=&y; x=*P; printf("%d", x); } what is output? a) 100 b) 1 c) 0 d) none
main() { int x, y= 100; float *P; P=&y; x=*P; printf("%d", x); }what is output?a) 100b) 1c) 0d) none
1 answer
16
what is output?
main() { int i= 1, j=2; j= j++ && i++ || i--; printf("%d, %d", i, j); }
main(){ int i= 1, j=2; j= j++ && i++ || i ; printf("%d, %d", i, j);}
1 answer
17
Explain
2 answers
18
MadeEasy Test Series: Programming & DS - Hashing
Consider a hash table using uniform hashing with number of slots as $m=6$ and number of keys, $k=8$. Collisions are resolved by chaining. Assuming direct hashing is used, what is the expected number of slots that ends not being empty?
Consider a hash table using uniform hashing with number of slots as $m=6$ and number of keys, $k=8$. Collisions are resolved by chaining. Assuming direct hashing is used,...
1 answer
19
Time complexity?
We are given a sequence of n nos. a1, a2, a3,.......an, we will assume that all the nos. are distinct. We say two indices i < j form an inversion if ai > aj . How much time will it take to find total no. of inversions in the given array? a) O(n2) b) O(nlogn) c) O(n) d) none of these
We are given a sequence of n nos. a1, a2, a3,.......an, we will assume that all the nos. are distinct. We say two indices i < j form an inversion if ai aj .How much time...
5 answers
21
ISRO2014-2
The number of states required by a Finite State Machine,to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is? $m \times 2^n$ $2^{m+n}$ $2^{mn}$ $m+n$
The number of states required by a Finite State Machine,to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is?$m \...
1 answer
22
Regular or not ?
{ wxw | w belongs to {0,1}* , x belongs to {0,1}+ }
{ wxw | w belongs to {0,1}* , x belongs to {0,1}+ }
2 answers
23
MadeEasy Workbook: Probability
A pair of dice is rolled again and again till a total of 5 or 7 is obtained. The chance that a total of 5 comes before a total of 7 is??
A pair of dice is rolled again and again till a total of 5 or 7 is obtained. The chance that a total of 5 comes before a total of 7 is??
1 answer
25
find minimal dfa for L
$L= \{a^nb : n \geq 0\} \cup \{b^na : n \geq 1\}$
$L= \{a^nb : n \geq 0\} \cup \{b^na : n \geq 1\}$