The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by Harsh181996
User Harsh181996
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Harsh181996
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
Algorithms Basic Question
answered
Apr 11, 2017
in
Algorithms

83
views
0
votes
2
iisc admission
when does iisc call candidates for mtech(res) interview? is it later after the mtech interviews?
answered
Apr 10, 2017
in
IISc/IITs

262
views
iisc
iiscinterview
admissiongate2017
+13
votes
3
GATE20171GA7
Six people are seated around a circular table. There are at least two men and two women. There are at least three righthanded persons. Every woman has a lefthanded person to her immediate right. None of the women are righthanded. The number of women at the table is $2$ $3$ $4$ Cannot be determined
answered
Feb 14, 2017
in
Numerical Ability

3.3k
views
gate20171
numericalability
roundtablearrangement
+2
votes
4
GateBook MockTest2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20byte IP header and a 20byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
answered
Feb 8, 2017
in
Computer Networks

1.4k
views
computernetworks
gatebook_mt2
ippacket
+97
votes
5
GATE200750
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2nc$ comparisons, for some constant $c$ are needed. At most $1.5n2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above
answered
Feb 5, 2017
in
Algorithms

6.5k
views
gate2007
algorithms
timecomplexity
easy
+2
votes
6
YACC
in case of shiftreduce and RR conflict, which is favoured by YACC?
answered
Feb 3, 2017
in
Compiler Design

148
views
compilerdesign
+1
vote
7
Travelling Salesman Problem
A)250 B)300 C)550 D)375
answered
Jan 5, 2017
in
Algorithms

1.1k
views
graphalgorithms
+86
votes
8
GATE201245
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during the ... . Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
answered
Dec 4, 2016
in
Computer Networks

12.7k
views
gate2012
computernetworks
congestioncontrol
normal
+67
votes
9
GATE2014139
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
answered
Nov 28, 2016
in
Algorithms

14.7k
views
gate20141
algorithms
numericalanswers
normal
minimummaximum
+2
votes
10
TIFR2014B11
Consider the following recurrence relation: $T\left(n\right)= \begin{cases} T\left(\frac{n}{k}\right)+ T\left(\frac{3n}{4}\right)+ n & \text{if } n \geq 2 \\ 1& \text{if } n=1 \end{cases}$ Which of the following statements is FALSE? $T(n)$ is $O(n^{3/2})$ when $k=3$. $T(n)$ is ... $O(n \log n)$ when $k=4$. $T(n)$ is $O(n \log n)$ when $k=5$. $T(n)$ is $O(n)$ when $k=5$.
answered
Nov 14, 2016
in
Algorithms

1.8k
views
tifr2014
algorithms
recurrence
+10
votes
11
GATE20001.21
Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following: wait (m[i]; wait (m(i+1) mod 4]); ........... release (m[i]); release (m(i+1) mod 4]); This could cause Thrashing Deadlock Starvation, but not deadlock None of the above
answered
Sep 10, 2016
in
Operating System

4.9k
views
gate2000
operatingsystem
processsynchronization
normal
0
votes
12
TIFR2014B7
Which of the following statements is TRUE for all sufficiently large $n$? $\displaystyle \left(\log n\right)^{\log\log n} < 2^{\sqrt{\log n}} < n^{1/4}$ $\displaystyle 2^{\sqrt{\log n}} < n^{1/4} < \left(\log n\right)^{\log\log n}$ ... $\displaystyle 2^{\sqrt{\log n}} < \left(\log n\right)^{\log\log n} < n^{1/4}$
answered
Aug 6, 2016
in
Algorithms

866
views
tifr2014
algorithms
timecomplexity
+1
vote
13
True/False
(logn)1/2=O(loglogn)
answered
Aug 6, 2016
in
Algorithms

254
views
asymptoticnotations
+1
vote
14
which function has higher growth rate among $n^3$ and $(\log n)!$ ?
According to me $n^3$ should be asymptotically greater since $(\log n)!$ is computed like $\log n$ will be a small constant less than $n$ and when I calculate its factorial it will obviously be less than $n^3$.
answered
Aug 6, 2016
in
Algorithms

252
views
asymptoticnotations
+8
votes
15
GATE20002.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
answered
Aug 2, 2016
in
Algorithms

7.1k
views
gate2000
algorithms
asymptoticnotations
normal
50,737
questions
57,324
answers
198,412
comments
105,178
users