Register
Filter

Questions by qwertyui

2 votes
1 answer
3
made easy
what is the correct ans?
what is the correct ans?
0 votes
1 answer
4
made easy
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing) a 1/(1-x) b 1/(1+x) c 1/x d 2/(2-x)
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing)a 1/(1-x)b 1/(1+x)c 1/x...
1 votes
0 answers
5
bit stuffing
i have a small doubt about bit stuffing if flag is 011110 and data is 01111111 then what will be the data after bit stuffing? is it 0111011101 0r 011101111???? plz clear my doubt
i have a small doubt about bit stuffing if flag is 011110 and data is 01111111 then what will be the data after bit stuffing?is it 0111011101 0r 011101111???? plz clear m...
1 votes
2 answers
6
network layer
station A in network 1 send a payload of 1600 B to station B in network 3 via network 2 if fragmentation is done the actual data size to be transmitted? n/w 1: MTU=1500B n/w 2: MTU=480B n/w 3: MTU=1500B
station A in network 1 send a payload of 1600 B to station B in network 3 via network 2if fragmentation is done the actual data size to be transmitted?n/w 1: MTU=1500Bn/w...
6 votes
4 answers
7
fork
#include <stdio.h> #include <unistd.h> int main() { int i; for(i=1;i<=3;i++) { fork(); printf("*"); } return 0; } how many times * will be printed ?...is it 11?
#include <stdio.h #include <unistd.h int main() { int i; for(i=1;i<=3;i++) { fork(); printf("*"); } return 0; }how many times * will be printed ?...is it 11?
3 votes
1 answer
8
made easy
consider a system with 2 level paging scheme in which a regular mem access takes 300 ns and servicing a page fault takes 500 ns . Avg instr takes 200 ns cpu time and 1 mem access. tlb hit ratio=80% and page fault ratio =20%. Average instr execution time is?
consider a system with 2 level paging scheme in which a regular mem access takes 300 ns and servicing a page fault takes 500 ns . Avg instr takes 200 ns cpu time and 1 me...
2 votes
1 answer
9
fork
#include<stdio.h> #include<unistd.h> int main() { for(i=0;i<2;i++) { if(fork()==0) printf("hello"); } }
#include<stdio.h #include<unistd.h int main() { for(i=0;i<2;i++) { if(fork()==0) printf("hello"); } }
0 votes
1 answer
10
fork
main() { for(i=1;i<=3;i++) { printf("*"); fork(); } } how many times * will be printed ? will it be same if printf and fork statement would be interchanged?
main(){ for(i=1;i<=3;i++) { printf("*"); fork(); }}how many times * will be printed ? will it be same if printf and fork statement would be in...
1 votes
0 answers
11
made easy test series que
a real n*n matrix aij =i if i = j , otherwise 0 the determinant of all n eigen values of A is a) n(n+1)/2 b) n(n-1)/2 c) n(n+1)(2n+1)/6 d) factorial(n) my ans is d but the ans given is a. Is it correct?
a real n*n matrix aij =i if i = j , otherwise 0the determinant of all n eigen values of A isa) n(n+1)/2b) n(n-1)/2c) n(n+1)(2n+1)/6d) factorial(n)my ans is d but the ans ...
1 votes
0 answers
12
heapsort
I have read that for heapify, t(n) = t(2n/3) +o(1) and i know the no. of nodes in the subtree will be 2n/3(worst case) but the algo actually be applied to logn elements down the subtree so isn't it should be t(log n) instead of t(2n/3)? if anybody know then plz clear my doubt
I have read that for heapify, t(n) = t(2n/3) +o(1) and i know the no. of nodes in the subtree will be 2n/3(worst case) but the algo actually be applied to logn elements d...