Log In

Answers by Harsh181996

2 votes
answered Apr 11, 2017 in Algorithms 116 views
0 votes
when does iisc call candidates for mtech(res) interview? is it later after the mtech interviews?
answered Apr 10, 2017 in IISc/IITs 303 views
16 votes
Six people are seated around a circular table. There are at least two men and two women. There are at least three right-handed persons. Every woman has a left-handed person to her immediate right. None of the women are right-handed. The number of women at the table is $2$ $3$ $4$ Cannot be determined
answered Feb 14, 2017 in Quantitative Aptitude 4.6k views
2 votes
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
answered Feb 8, 2017 in Computer Networks 2.1k views
133 votes
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 $2n-c$ comparisons, for some constant $c$ are needed. At most $1.5n-2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above
answered Feb 5, 2017 in Algorithms 11.2k views
2 votes
in case of shift-reduce and R-R conflict, which is favoured by YACC?
answered Feb 3, 2017 in Compiler Design 214 views
1 vote
96 votes
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 fifth transmission. 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 20.2k views
88 votes
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
answered Nov 28, 2016 in Algorithms 25.6k views
2 votes
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)$ ... $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 2.9k views
13 votes
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 9.5k views
1 vote
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 2.1k views
1 vote
answered Aug 6, 2016 in Algorithms 459 views
1 vote
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 319 views