Dark Mode

Recent activity by vineet.ildm

1 answer

1

self doubt
If packet with TTL value = 0 received at destination, then destination discard that packet or accept that packet.

commented in Computer Networks Jan 29, 2018

1.2k views

1 answer

2

Test by Bikram | Mock GATE | Test 2 | Question: 62
An apple vendor sells half the number of existing apples plus $1$ to the first customer, sells $1/3$^{rd}$of the remaining apples plus $1$ to the second customer and $1/5$^{th}$ of the remaining apples plus $1$ to the third ... he has $7$ apples left. If each apple costs $Rs.12$, then the amount of money he collected while selling apples is _______

commented in GATE Jan 28, 2018

625 views

5 answers

3

GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$

commented in Operating System Jan 25, 2018

13.9k views

0 answers

4

programming Q MOCK TEST
Consider the following program along with push and pop operations on stack which can contain atmost The decimal value equivalent to the binary number printed by above code is _______

commented in Programming in C Jan 25, 2018

568 views

5 answers

5

MadeEasy Test Series 2018: Compiler Design - Left Recursion
I think the answer should be option: C but it is given option A. Providing the snapshot of the question with the options provided. I don't think option A should be the correct one, even if it then we cannot ... "bda" from option A which is possible in the original grammar. Please help with this question. Thanks in advance.

commented in Compiler Design Jan 25, 2018

1.6k views

9 answers

6

GATE IT 2008 | Question: 39
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ control signals are needed to be generated by the control unit. While designing the horizontal ... size of the control word and control address register? $125, 7$ $125, 10$ $135, 9$ $135, 10$

commented in CO and Architecture Jan 24, 2018

17.8k views

1 answer

7

MadeEasy Test Series: Computer Networks - Ip Packet
If a datagram of size 4000 bytes from transport layer arrives at network layer and it has to be forwarded through a link with maximum capacity of 800 bytes. Then calculate the number of fragments needed if the header size is 20 bytes. Also calculate the data size of the last fragment.

commented in Computer Networks Jan 13, 2018

2.4k views

1 answer

8

Database: Does each multivalued attribute requires a separate table in 1NF?
Following question and answer from GateForum test series: Now see the following text i coped from Korth, we will create an new for each value of multivalued attribute: Hence answer should be 1 for this question.

commented in Databases Jan 8, 2018

3.9k views

3 answers

9

GATE CSE 1993 | Question: 14
An $\text{ISAM}$ (indexed sequential) file consists of records of size $64$ bytes each, including key field of size $14$ bytes. An address of a disk block takes $2$ bytes. If the disk block size is $512$ bytes and there are $16K$ records, compute the size of the data and index areas in terms of number blocks. How many levels of $\text{tree}$ do you have for the index?

commented in Databases Dec 2, 2017

6.8k views

4 answers

10

GATE CSE 2000 | Question: 2.4
A polynomial $p(x)$ satisfies the following: $p(1) = p(3) = p(5) = 1$ $p(2) = p(4) = -1$ The minimum degree of such a polynomial is $1$ $2$ $3$ $4$

commented in Set Theory & Algebra Nov 22, 2017

7.7k views

10 answers

11

GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$

commented in Set Theory & Algebra Nov 21, 2017

7.0k views

2 answers

12

GARPH THEORY
Q.A tree has n2 vertices of degree 2,n3 vertices of degree 3.....and nk vertices of degree k.How many vertices of degree 1 does it have ? a)n2+2n4+3n5+.......+(k-2)nk+1 b)n2+2n3+3n4+.......+(k-1)nk c)n3+2n4+3n5+.......+(k-2)nk+2 d)None of the above

answered in Graph Theory Nov 20, 2017

2.2k views

9 answers

13

GATE CSE 2006 | Question: 25
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is the number of sets $X_j$ that contain the element $i.$ That is $f(i)=\left | \left\{j \mid i\in X_j \right\} \right|$ then $ \sum_{i=1}^{m} f(i)$ is: $3m$ $3n$ $2m+1$ $2n+1$

commented in Set Theory & Algebra Nov 20, 2017

11.0k views

2 answers

14

Space complexity of heap sort
Why space complexity of heapsort is O(1)....and why not O(logn)..because of space required by recursion calls which is equivalent to height of the tree...where am i getting wrong plz help...

answer selected in Algorithms Nov 12, 2017

5.8k views

6 answers

15

GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$

commented in Computer Networks Oct 17, 2017

23.6k views

1 answer

16

Cn-ques1 ethernet and csma-cd
Suppose two nodes, A and B, are attached to opposite ends of a 900 m cable, and that they each have one frame of 1000 bits (including all headers and preambles) to send to each other. Both nodes attempt to transmit at time t=0. Suppose there are four ... *10-6 sec. For 2nd ques.I am not getting how to take collision and back off delay... then how to solve for bridges.

commented in Computer Networks Oct 12, 2017

7.6k views

7 answers

17

GATE IT 2006 | Question: 67
A link of capacity $100$ $\text{Mbps}$ is carrying traffic from a number of sources. Each source generates an on-off traffic stream; when the source is on, the rate of traffic is $10$ $\text{Mbps}$, and when the source is off, the rate of traffic is zero. The duty cycle, which ... $\text{and}$ $30$ $12$ $\text{and}$ $25$ $5$ $\text{and}$ $33$ $15$ $\text{and}$ $22$

commented in Computer Networks Oct 8, 2017

11.2k views

6 answers

18

GATE CSE 2014 Set 1 | Question: 28
Consider a selective repeat sliding window protocol that uses a frame size of $1$ $\text{KB}$ to send data on a $1.5$ $\text{Mbps}$ link with a one-way latency of $50$ $\text{msec}$. To achieve a link utilization of $60\%$, the minimum number of bits required to represent the sequence number field is ________.

commented in Computer Networks Oct 6, 2017

27.1k views

6 answers

19

GATE IT 2007 | Question: 61
In the waveform (a) given below, a bit stream is encoded by Manchester encoding scheme. The same bit stream is encoded in a different coding scheme in wave form (b). The bit stream and the ... Manchester respectively $0111101000$ and Differential Manchester respectively $1000010111$ and Integral Manchester respectively $0111101000$ and Integral Manchester respectively

commented in Computer Networks Oct 5, 2017

18.0k views

3 answers

20

decompose to 3nf

commented in Databases Sep 23, 2017

1.6k views

3 answers

21

Decomposition
Consider following set of FDs on $R(A,B,C,D,E,F)$ $A \to BCD$ $BC \to DE$ $B \to D$ $D \to A$ Compute the canonical cover. Give 3NF decomposition of $R$ based on canonical cover. Give BCNF decomposition of $R$ based on original set of FD. Can you get same decomposition of $R$ as above using canonical cover?

commented in Databases Sep 23, 2017

3.5k views

3 answers

22

Find minimal cover from given functional dependencies
A -> BC CD-> E B->D E->A

commented in Databases Sep 20, 2017

8.5k views

1 answer

23

countability
if a language is not recursively enumerable, then is it uncountable language? I believe every language over ∑ is subset of ∑* which is a countable set and as subset of countable set is countable therefore every language itself is countable whether it is recursively enumerable or not.

asked in Theory of Computation Sep 4, 2017

335 views

4 answers

24

GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$

commented in Theory of Computation Aug 24, 2017

18.5k views

4 answers

25

GATE CSE 2006 | Question: 52
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$

answered in Algorithms Aug 4, 2017

53.3k views

1 answer

26

quick sort time complexity
the worst case time complexity of quicksort for an elements when the median is selected as the pivot a. o(n^2) b.o(n) c.o(nlogn) d.o(logn)

commented in Algorithms Aug 1, 2017

15.8k views

9 answers

27

GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...

commented in Mathematical Logic Jul 24, 2017

14.9k views

4 answers

28

GATE CSE 2006 | Question: 14, ISRO2011-14
Which one of the following in place sorting algorithms needs the minimum number of swaps? Quick sort Insertion sort Selection sort Heap sort

commented in Algorithms Jul 23, 2017

25.3k views

0 answers

29

number of movements in Insertion sort
will A[i+1]=key; in the insertion sort be counted as a movement in best case?

asked in Algorithms Jul 18, 2017

1.0k views

1 answer

30

first order logic notations
can someone please tell when to interpret this symbol $\Leftrightarrow$ as logical equivalence and when as double implication?

commented in Mathematical Logic Jun 17, 2017

1.0k views