Recent activity by amitpandey675 / GATE Overflow for GATE CSE

9 answers

1

GATE CSE 2005 | Question: 44
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such that, $a \equiv c\mod 3$ and $b \equiv d \mod 5$ $4$ $6$ $16$ $24$

What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such th...

13.5k views

commented Dec 10, 2018

7 answers

2

GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps

Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5...

28.2k views

commented Jul 7, 2018

1 answer

3

Self Aboubt IPv6
Self Doubt The Draw back of IPv6 is it has no better checksum Algorithms . this is true or not???.

Self DoubtThe Draw back of IPv6 is it has no better checksum Algorithms .this is true or not???.

191 views

answered Jul 7, 2018

0 answers

4

data communications and networking by behrouz forouzan, Chapter 11, Data Link Layer, Exercies Question 30.

30. A system uses the Stop-and-Wait ARQ Protocol. If each packet carries 1000 bits of data, how long does it take to send 1 million bits of data if the distance betwe...

667 views

commented Jul 6, 2018

1 answer

5

Space Complexity of Dijkastra's algorithm
I read that the space complexity of Dijasktra is $O(V^2)$ . (http://igraph.wikidot.com/algorithm-space-time-complexity) But how ????

I read that the space complexity of Dijasktra is $O(V^2)$ . (http://igraph.wikidot.com/algorithm-space-time-complexity)But how ????

3.0k views

commented Jul 6, 2018

1 answer

6

STQC STA
If the original size of data is 40 then after adding error detection redundancy bit the size of data length is 1)26 2)36 3)46 4)56

If the original size of data is 40 then after adding error detection redundancy bit the size of data length is1)262)363)464)56

2.9k views

answered Jul 5, 2018

1 answer

7

Binary search tree construction Doubt
What is the worst case time complexity to construct a binary search tree.??? Now i know ,that if a BST is left or right-skewed, searching an element takes O(n) time.so suppose i want to insert 10,25,30,35,40 in a bst.. it will be completely right skewed.. So when ... so overall work =0+1+2+...+(n-1)=N(n-1)/2= O(n2) Am i correct here?? or it is O(nlogn)

What is the worst case time complexity to construct a binary search tree.???Now i know ,that if a BST is left or right-skewed, searching an element takes O(n) time.so sup...

2.2k views

answered Jul 4, 2018

1 answer

8

self doubt
all NP problems have the complexity exponential ???

all NP problems have the complexity exponential ???

226 views

answered Jul 4, 2018

1 answer

9

Routing
Can distance vector routing implementation is possible with delay? usually, is it done by hop-count? also, Can link state routing implementation is possible with hop-count? usually, is it done by delay?

Can distance vector routing implementation is possible with delay?usually, is it done by hop-count?also, Can link state routing implementation is possible with hop-count?...

387 views

answered Jul 4, 2018

2 answers

10

Ace Test Series: Computer Networks - Tcp
Can someone explain what this question means?

Can someone explain what this question means?

587 views

commented Jul 2, 2018

3 answers

11

Ace Test Series: Computer Networks - Flow Control Methods

602 views

comment edited Jul 2, 2018

2 answers

12

MadeEasy Test Series: Computer Networks - Ipv6
Hi Guys, Could you please provide justification for the mentioned options ?

Hi Guys,Could you please provide justification for the mentioned options ?

546 views

answered Jul 2, 2018

1 answer

13

graph_doubt
"edge disjoint spanning tree" means ?

"edge disjoint spanning tree" means ?

291 views

answered Jul 1, 2018

1 answer

14

max heap with binary search

1.4k views

commented Jul 1, 2018

1 answer

15

Dynamic programming
Consider the following C functions: int fun ( int n) { if (n<6) return 1; else return( fun(n-1)+fun(n-3)+fun (n-5)); } Q) Suppose we modify the above function fun( ) and store the values of fun (i), 0<=i<n, as and when they are computed . With this ... ( ) is significantly reduced. What is the time complexity of modified fun( ) would be: a)O(1) b)O(n) c)O(n^2) d)O(n!)

Consider the following C functions:int fun ( int n){ if (n<6) return 1; else return( fun(n-1)+fun(n-3)+fun (n-5));}Q) Suppose we modify the above function ...

350 views

answered Jun 28, 2018

2 answers

16

Online test series
#include<stdio.h> int f(int x,int *py,int **ppz){ int y,z; **ppz+=1; z=**ppz; *py+=2; y=*py; x+=3; return(x+y+z); } void main(){ int c,*b,**a; c=4; b=&c; a=&b; printf("%d",f(&c,b,a)); return 0; } Here why doesn't the value of x increment even though the pointers are changed by value? Why is the answer 19 and not 22?

#include<stdio.h>int f(int x,int *py,int ppz){ int y,z; ppz+=1; z= ppz; *py+=2; y=*py; x+=3; return(x+y+z);}void main(){ int c,*b, a; c=4; b=&c; a=&b; print...

1.8k views

answered Jun 25, 2018

1 answer

17

What is the worst case time complexity of the following recurrence relation?
What is the worst case time complexity of the following recurrence relation? T(n)=T(n/2)+T(n/4)+T(n/8)+n Θ(nlogn) Θ(n2) Θ(n) ----------------------------------------------------------- ... O(n) which is the answer..what is wrong in this approach..??by tree method,i will get O(n).but whats wrong with this? please clear ths.

What is the worst case time complexity of the following recurrence relation?T(n)=T(n/2)+T(n/4)+T(n/8)+n Θ(nlogn) Θ(n2) Θ(n) -i am solving like thisT(n...

1.4k views

answered Jun 18, 2018

2 answers

18

escape sequence
if i write $\text{printf("norma\bl")}$,then output is $norml$,but when i write $\text{printf("normal\b")}$,then output is $normal$..why can anyone explain concept of $\text{\b}$

if i write $\text{printf("norma\bl")}$,then output is $norml$,but when i write $\text{printf("normal\b")}$,then output is $normal$..whycan anyone explain concept of $\tex...

407 views

answered Jun 5, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true