Register
Filter

Recent activity by Sunny Mukherjee

6 answers
3
GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of$O(m)$$O(n)$$O(m+n)$$O(\log m + \log n)$
3 answers
8
Gate 2018
Which of the following is true In slow start phase cwnd 1)Increase by 2mss after every successfull ack 2) approximately double after every rtt 3) increase by 1mss after every successfull ack 4) approximately double after every rtt I am not sure but question was something like that
Which of the following is trueIn slow start phase cwnd1)Increase by 2mss after every successfull ack2) approximately double after every rtt3) increase by 1mss after every...
3 answers
9
GATE 2018
Maximum no of min spanning trees,.... taking a value of x I answered 2 Is it correct?
Maximum no of min spanning trees,.... taking a value of xI answered 2 Is it correct?
2 answers
10
GATE 2018
Value of Global variable counter in C program is ----------.
Value of Global variable counter in C program is .
2 answers
11
Gate 2018
1 answer
12
Gate18
Dbms query question, Which query is superset of other query
Dbms query question,Which query is superset of other query
1 answer
13
gate cs 2018
three processes and four resouces.minimum number of resouces required to avoid deadlock?given that each process take all resources at once and release all resources at once
three processes and four resouces.minimum number of resouces required to avoid deadlock?given that each process take all resources at once and release all resources at on...
3 answers
14
Gate 2018
What is the ans of last question if no is divided then reminder is 7
What is the ans of last question if no is divided then reminder is 7
4 answers
15
GATE CSE 2018 | Question: 38
Consider the following parse tree for the expression a#b$\$c$\$d#e#f, involving two binary operators $\$ ... has higher precedence and is right associative; # is left associative
Consider the following parse tree for the expression a#b$\$$c$\$$d#e#f, involving two binary operators $\$$ and #.Which one of the following is correct for the given par...
7 answers
19
GATE CSE 2006 | Question: 12
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is: Queue Stack Heap B-Tree
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:QueueStackHeapB-Tree
2 answers
23
GATE CSE 2013 | Question: 6
Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort? $O(\log n$) $O(n$) $O(n \log n$) $O(n^{2}$)
Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort?$O(\log n$)$O(n$)$O(n \log n$...
6 answers
27
GATE CSE 2001 | Question: 2.24
Which of the following relational calculus expression is not safe? $\left\{t \mid \exists u \in R_1\left(t[A] = u[A]\right) \land \neg \exists s \in R_2 \left(t[A] = s[A]\right)\right\}$ ...
Which of the following relational calculus expression is not safe?$\left\{t \mid \exists u \in R_1\left(t[A] = u[A]\right) \land \neg \exists s \in R_2 \left(t[A] = s[A]\...
18 answers
28
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...
4 answers
30
GATE CSE 2017 Set 2 | Question: 50
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$ ... message of $100$ characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below:$$\begin{array}{|c|c|...