Register
Filter

Recent activity by vivek9837

1 answer
2
UGC NET CSE | December 2019 | Part 2 | Question: 25
Which of the following is not needed by an encryption algorithm used in Cryptography? $\text{KEY}$ Message Ciphertext User details
Which of the following is not needed by an encryption algorithm used in Cryptography?$\text{KEY}$MessageCiphertextUser details
0 answers
4
Self Doubt
Is there any method to check equivalence of two regular expressions other than checking all strings of two set? I mean sometimes I may miss a string.
Is there any method to check equivalence of two regular expressions other than checking all strings of two set?I mean sometimes I may miss a string.
1 answer
5
Time Complexity
What will be the time complexity of a function f(n) = n^-2 i.e. pow (n,-2) ?
What will be the time complexity of a function f(n) = n^-2 i.e. pow (n,-2) ?
0 answers
7
Self Doubt (Graphs)
How to understand this: For a connected graph, V = O(E)) SOURCE http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-mst-for-adjacency-list-representation/ prims algorithm time complexity for adjacency list representation. Also same is given in CLRS but no reason
How to understand this: For a connected graph, V = O(E))SOURCE http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-mst-for-adjacency-list-representation/prims algo...
1 answer
8
Graph
The problem of finding the set of vertices reachable from a given vertex in a graph can be solved in time A. O(|V|^2) B. O(|V| + |E|) C. O(|V||E|) D. none of these
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 answer
9
# Probability
What is the expected no. of heads that come up when fair coin is flipped five times?
What is the expected no. of heads that come up when fair coin is flipped five times?
6 answers
10
Related to time complexity
Which one is greater in asymptomatic notation? 1)n 2)(log n)100
Which one is greater in asymptomatic notation?1)n 2)(log n)100
1 answer
15
ace test series
how many times middle loops execute for bound =1,2,......n.
how many times middle loops execute for bound =1,2,......n.
1 answer
16
Stall Cycles-Without Forwarding
anyone elaborate the reason for each stall cycles.
anyone elaborate the reason for each stall cycles.
1 answer
17
Combinatorics
A Sequence of nos. $<1, 2, 3, 4, ..... 10 $> is permuted randomly. What is the probability that all odd nos. appear before all even nos. I am getting $\frac{5! * 5!}{10!}$, is it correct
A Sequence of nos. $<1, 2, 3, 4, ..... 10 $ is permuted randomly. What is the probability that all odd nos. appear before all even nos. I am getting $\frac{5! * 5!}{10!}$...
2 answers
18
what is the time complexity ?
sum=0; for(i=0;i<n;i++) for(j=0;j<i*i;j++) for(k=0;k<j;k++) sum++;
sum=0; for(i=0;i<n;i++) for(j=0;j<i*i;j++) for(k=0;k<j;k++) sum++;
1 answer
20
Team selection
A team of 11 needs to be selected from 8 bolwers and 8 batsmen, a random selection is made. What is the probablility that the selected team has more bowlers than bastsmen $?$
A team of 11 needs to be selected from 8 bolwers and 8 batsmen, a random selection is made. What is the probablility that the selected team has more bowlers than bastsmen...
3 answers
21
graph
Assume undirected graph G is connected . G has 6 vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guaranteee that it will become disconnected
Assume undirected graph G is connected . G has 6 vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guaranteee that it will bec...
3 answers
22
COA -Cache memory
What is the use of Valid bit if we have a TAG comparator in Direct Mapped cache ?
What is the use of Valid bit if we have a TAG comparator in Direct Mapped cache ?
1 answer
23
Existence of small theta
Why doesn't the small $\theta$ notation exists ?
Why doesn't the small $\theta$ notation exists ?
1 answer
24
Little oh
f(n)=o(g(n)) if and only if a) g(n)=Ω(f(n)) b) g(n)=ω(f(n)) c)g(n)=Ω(f(n)) and g(n)=ω(f(n))
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))
2 answers
25
Doubt
A $\phi$ (empty) relation on any set $A$ is not reflexive because for every $ a \in A$, $(a, a) \notin \phi$, but $\phi$ is a symmetric as well as transitive relation on $A$, how is that possible $?$
A $\phi$ (empty) relation on any set $A$ is not reflexive because for every $ a \in A$, $(a, a) \notin \phi$, but $\phi$ is a symmetric as well as transitive relation on ...
1 answer
26
mathematics
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)surjection (c)bijection (d)none of these
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...