Register
Filter

Recent activity by akankshadewangan24

1 answer
1
Binary serach tree
Can binary serach tree have duplicate elements in the tree?
Can binary serach tree have duplicate elements in the tree?
0 answers
7
Matrix
Vector space is in syllabus of gate 2019 cse????????
Vector space is in syllabus of gate 2019 cse????????
2 answers
8
Cyclic group
The order of cyclic group is equal to order of generating element.... Somebody explain with example plz
The order of cyclic group is equal to order of generating element.... Somebody explain with example plz
1 answer
10
Paging advantage
Advantage of paging: It support time sharing system..... Explain plz can't get it
Advantage of paging: It support time sharing system..... Explain plz can't get it
0 answers
12
https://www.geeksforgeeks.org/wp-content/uploads/gq/2016/02/GATECS201612.png
How to solve this https://www.geeksforgeeks.org/wp-content/uploads/gq/2016/02/GATECS201612.png
How to solve thishttps://www.geeksforgeeks.org/wp-content/uploads/gq/2016/02/GATECS201612.png
2 answers
13
Ace Test Series: Algorithms - Time Complexity Notation
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true? S(n)=O(t(n)) correct How???
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true?S(n)=O(t(n)) correct H...
5 answers
14
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...
2 answers
15
data structure
the number of inversions in (n,n-1,.........3,2,1) is n(n-1)/2 how??????????????????/
the number of inversions in (n,n-1,.........3,2,1)is n(n-1)/2how??????????????????/
4 answers
16
GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA ... follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
Consider the NPDA $$ \left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \p...
4 answers
18
GATE CSE 2012 | Question: 21
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and ...
11 answers
20
GATE CSE 2008 | Question: 45
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to only vertex $a$ only vertices $a, e, f, g, h$ only vertices $a, b, c, d$ all the vertices
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance toonly vertex $a$only vertices $...
5 answers
23
ISRO2015-7
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders required will be $0,17$ $16,1$ $1,16$ $8,8$
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders r...
1 answer
25
Algorithms:Asymptotic Notations
plz help me . how to solve that type of question
plz help me . how to solve that type of question
1 answer
28
ethernet
if an ethernet station collide 4 times to try to transmit a single frame .How long might it wait to be before the next attempt if time slot 51.2 micro sec ...................micro sec. a. 768 b. 819.2 c.409.6 d. none
if an ethernet station collide 4 times to try to transmit a single frame .How long might it wait to be before the next attempt if time slot 51.2 micro sec ..................
1 answer
29
time complexity
time complexity questions like : h(n)=O(n2); f(n)= O(logn); g(n)=omega(n2); what is the complexity of :::: 1. h(n)-g(n)=?? 2. h(n)-f(n)=??? elaborate plz
time complexity questions like :h(n)=O(n2);f(n)= O(logn);g(n)=omega(n2);what is the complexity of :::: 1. h(n)-g(n)=?? 2. h(...
2 answers
30
GATE2016 EC-1: GA-9
If $\large q^{-a} = \dfrac{1}{r}$ and $\large r^{-b} = \dfrac{1}{s}$ and $\large s^{-c} = \dfrac{1}{q}$, the value of $abc$ is ________. $\left(rqs\right)^{-1}$ $0$ $1$ $r+q+s$
If $\large q^{-a} = \dfrac{1}{r}$ and $\large r^{-b} = \dfrac{1}{s}$ and $\large s^{-c} = \dfrac{1}{q}$, the value of $abc$ is ________.$\left(rqs\right)^{-1}$$0$$1$$r+q+...