Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by ramji
–1
votes
1
GATE CSE 2011 | Question: 31
Given $i = \sqrt{-1}$, what will be the evaluation of the definite integral $\int \limits_0^{\pi/2} \dfrac{\cos x +i \sin x} {\cos x - i \sin x} dx$ ? $0$ $2$ $-i$ $i$
Given $i = \sqrt{-1}$, what will be the evaluation of the definite integral $\int \limits_0^{\pi/2} \dfrac{\cos x +i \sin x} {\cos x - i \sin x} dx$ ?$0$$2$$-i$$i$
11.0k
views
answered
Jul 31, 2018
Calculus
gatecse-2011
calculus
integration
normal
+
–
5
votes
2
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $2...
42.7k
views
answered
May 24, 2016
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
11
votes
3
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight s...
35.5k
views
answered
May 18, 2016
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register