Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
vivek9837
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vivek9837
0
votes
1
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
480
views
answered
Jun 7, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
2
cormen page 157-159
While proving that the running time of the BUILD-MAX-HEAP to be O(n) and not O(n lgn), the have considered the number of nodes or elements at some height 'h' to be n/2^(h+1). How? All I know is that 2^h alone can give you number of nodes at some heigh h. I do not understand this. Can someone explain in detail?
While proving that the running time of the BUILD-MAX-HEAP to be O(n) and not O(n lgn), the have considered the number of nodes or elements at some height 'h' to be n/2^(h...
296
views
answered
Sep 12, 2017
DS
data-structures
binary-heap
+
–
0
votes
3
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
537
views
answered
Jul 15, 2017
Algorithms
graph-theory
graph-algorithms
+
–
1
votes
4
# 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?
339
views
answered
Jul 14, 2017
Mathematical Logic
engineering-mathematics
probability
+
–
0
votes
5
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.9k
views
answered
May 11, 2017
Algorithms
algorithms
time-complexity
+
–
3
votes
6
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++;
2.7k
views
answered
Oct 25, 2016
Algorithms
algorithms
time-complexity
+
–
2
votes
7
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))
1.4k
views
answered
Oct 18, 2016
Algorithms
algorithms
asymptotic-notation
+
–
0
votes
8
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...
405
views
answered
Oct 16, 2016
0
votes
9
pipelining
256
views
answered
Oct 14, 2016
4
votes
10
Solve Recurrence Equation T(n) = 2T(n/4) + √3
I've been struggling to come to exact solution for this. Master's theorem is not applicable and likely way to get to answer is Recursion tree. Which is giving me Theta(n) as an answer. Steps : => 1) T(n) = 2T(n/4) + √3 2) ... .. = n/2 Which is incorrect , Answer given is ( √n log n ) , would appreciate if someone could shed light how so ?
I've been struggling to come to exact solution for this. Master's theorem is not applicable and likely way to get to answer is Recursion tree. Which is giving me Theta(n)...
5.1k
views
answered
Oct 12, 2016
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
0
votes
11
math calculus
363
views
answered
Oct 12, 2016
Mathematical Logic
engineering-mathematics
calculus
+
–
1
votes
12
TIFR CSE 2016 | Part A | Question: 2
Consider the graph shown below: The following experiment is performed using this graph. First, an edge $e =\{i,j\}$ of the graph is chosen uniformly at random from the set of $9$ possibilities. Next, a common neighbour $k$ of $i$ and $j$ is chosen, again uniformly from the set of ... $\frac{1}{6}$ $\frac{1}{4}$ $\frac{1}{3}$ $\frac{2}{3}$ $\frac{5}{6}$
Consider the graph shown below:The following experiment is performed using this graph. First, an edge $e =\{i,j\}$ of the graph is chosen uniformly at random from the set...
1.0k
views
answered
Oct 12, 2016
Graph Theory
tifr2016
graph-theory
graph-connectivity
probability
+
–
0
votes
13
Asymptotic Worst Time Complexity
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 here so what do we mean by O(n3) and o(n3).
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...
201
views
answered
Oct 9, 2016
Algorithms
time-complexity
asymptotic-notation
+
–
4
votes
14
Hashing+Probaility
764
views
answered
Oct 8, 2016
DS
hashing
probability
uniform-hashing
binomial-distribution
+
–
0
votes
15
Time complexity
Q)for(int i=0; i<n; i++) for(int j=i+1; j<n; j++) for(int k=j+1; k<n; k++) For this question Arjun sir has explained this Counting the number of times the inner most loop gets executed equals, n-2 + n-3 + n-2 + ....1 +n-3 + n-2 + . ... + .... )/2 = O(n3) as there are n terms and n2 is the dominating term in each of them. Can anyone plz explain in detail.I am not getting it
Q)for(int i=0; i<n; i++) for(int j=i+1; j<n; j++) for(int k=j+1; k<n; k++)For this question Arjun sir has explained thisCounting the number of times the inner most loop g...
280
views
answered
Oct 5, 2016
Algorithms
algorithms
time-complexity
+
–
1
votes
16
virtual test series
217
views
answered
Oct 4, 2016
Algorithms
huffman-code
virtual-gate-test-series
numerical-answers
+
–
1
votes
17
Virtual Gate Test Series: Algorithms - Hashing With Chaining
Let $| U | = m^{2}$ and consider hashing with chaining. For any hash function $h : U\rightarrow{ 1, 2, ......., m-1}, $ there exists a sequence of $m$ insertions that leads to a chain of length $:$ $(A) m-1$ $(B) m$ ($C) m+1$ $(D)$ None. i got (m-2) max length .....option D
Let $| U | = m^{2}$ and consider hashing with chaining. For any hash function $h : U\rightarrow{ 1, 2, ......., m-1}, $ there exists a sequence of $m$ insertions that lea...
1.3k
views
answered
Oct 2, 2016
Algorithms
algorithms
hashing
virtual-gate-test-series
+
–
0
votes
18
UGC NET CSE | August 2016 | Part 3 | Question: 34
A priority queue is implemented as a max-heap. Initially, it has five elements. The levelorder traversal of the heap is as follows : 20, 18, 15, 13, 12 Two new elements 10' and 17' are inserted in the heap in that order. The level-order traversal of the heap after ... 18, 17, 12, 13, 10, 15 20, 18, 17, 10, 12, 13, 15 20, 18, 17, 13, 12, 10, 15
A priority queue is implemented as a max-heap. Initially, it has five elements. The levelorder traversal of the heap is as follows :20, 18, 15, 13, 12Two new elements ‘...
2.5k
views
answered
Oct 2, 2016
DS
ugcnetcse-aug2016-paper3
data-structures
priority-queue
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register