0 votes
1
Which of the following is not needed by an encryption algorithm used in Cryptography?$\text{KEY}$MessageCiphertextUser details
0 votes
3
The problem of finding the set of vertices reachable from a given vertex in a graph can be solved in timeA. O(|V|^2)B. O(|V| + |E|)C. O(|V||E|)D. none of these
1 votes
4
What is the expected no. of heads that come up when fair coin is flipped five times?
0 votes
5
Which one is greater in asymptomatic notation?1)n 2)(log n)100
3 votes
6
sum=0; for(i=0;i<n;i++) for(j=0;j<i*i;j++) for(k=0;k<j;k++) sum++;
2 votes
7
f(n)=o(g(n)) if and only ifa) g(n)=Ω(f(n))b) g(n)=ω(f(n))c)g(n)=Ω(f(n)) and g(n)=ω(f(n))
0 votes
8
Let f : A → B and g : B → C denote two functions. If the function gof : A → C is a surjection and g is an injection, then function f is ______.(a)injection(b)surjec...
0 votes
9
0 votes
13
For f(n)= 2n2+3n , O(n3) and o(n3) both are correct then what do both mean in this. As Big oh is used to reprsent the tighest upper upper bound but it is not representing...