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
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.
If packet with TTL value = 0 received at destination, then destination discard that packet or accept that packet.
1.2k
views
commented
Jan 29, 2018
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 _______
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/...
621
views
commented
Jan 28, 2018
GATE
tbb-mockgate-2
numerical-answers
quantitative-aptitude
fractions
+
–
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$
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 $...
13.8k
views
commented
Jan 25, 2018
Operating System
gateit-2005
operating-system
disk
normal
+
–
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 _______
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 cod...
560
views
commented
Jan 25, 2018
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.
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 corr...
1.6k
views
commented
Jan 25, 2018
Compiler Design
compiler-design
left-recursion
made-easy-test-series
+
–
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$
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$ cont...
17.8k
views
commented
Jan 24, 2018
CO and Architecture
gateit-2008
co-and-architecture
microprogramming
normal
+
–
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.
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 calculat...
2.4k
views
commented
Jan 13, 2018
Computer Networks
made-easy-test-series
computer-networks
ip-packet
+
–
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.
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:Henc...
3.9k
views
commented
Jan 8, 2018
Databases
databases
er-to-relational
+
–
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?
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...
6.8k
views
commented
Dec 2, 2017
Databases
gate1993
databases
indexing
normal
descriptive
+
–
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$
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$
7.8k
views
commented
Nov 22, 2017
Set Theory & Algebra
gatecse-2000
set-theory&algebra
normal
polynomials
+
–
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$
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows:$$\begin{array}{|c|c|c|c|} \hline \textbf{+} & \textbf{a}& \textbf{b} &\textbf{c...
7.1k
views
commented
Nov 21, 2017
Set Theory & Algebra
gatecse-2003
set-theory&algebra
normal
binary-operation
+
–
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
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+1b)n...
2.2k
views
answered
Nov 20, 2017
Graph Theory
graph-theory
+
–
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$
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...
11.1k
views
commented
Nov 20, 2017
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
functions
+
–
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...
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 getti...
5.9k
views
answer selected
Nov 12, 2017
Algorithms
algorithms
time-complexity
space-complexity
sorting
binary-heap
+
–
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$
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 distanc...
23.7k
views
commented
Oct 17, 2017
Computer Networks
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
+
–
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.
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 t...
7.6k
views
commented
Oct 12, 2017
Computer Networks
computer-networks
csma-cd
back-off-delay
ethernet
routers-bridge-hubs-switches
+
–
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$
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 tr...
11.2k
views
commented
Oct 8, 2017
Computer Networks
gateit-2006
computer-networks
network-flow
normal
+
–
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 ________.
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$ $\...
27.2k
views
commented
Oct 6, 2017
Computer Networks
gatecse-2014-set1
computer-networks
sliding-window
numerical-answers
normal
+
–
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
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 ...
18.1k
views
commented
Oct 5, 2017
Computer Networks
gateit-2007
computer-networks
communication
manchester-encoding
normal
out-of-gate-syllabus
+
–
3
answers
20
decompose to 3nf
1.6k
views
commented
Sep 23, 2017
Databases
database-normalization
+
–
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?
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 cove...
3.5k
views
commented
Sep 23, 2017
Databases
databases
database-normalization
canonical-cover
+
–
3
answers
22
Find minimal cover from given functional dependencies
A -> BC CD-> E B->D E->A
A - BCCD- EB->DE->A
8.5k
views
commented
Sep 20, 2017
Databases
database-normalization
decomposition
+
–
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.
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 o...
333
views
asked
Sep 4, 2017
Theory of Computation
theory-of-computation
+
–
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$
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 s...
18.6k
views
commented
Aug 24, 2017
Theory of Computation
gatecse-2001
theory-of-computation
finite-automata
minimal-state-automata
+
–
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})$
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?$\T...
53.4k
views
answered
Aug 4, 2017
Algorithms
gatecse-2006
algorithms
sorting
easy
+
–
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)
the worst case time complexity of quicksort for an elements when the median is selected as the pivota. o(n^2)b.o(n)c.o(nlogn)d.o(logn)
15.8k
views
commented
Aug 1, 2017
Algorithms
algorithms
time-complexity
quick-sort
+
–
9
answers
27
GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...
Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...
14.8k
views
commented
Jul 24, 2017
Mathematical Logic
gateit-2005
mathematical-logic
first-order-logic
normal
+
–
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
Which one of the following in place sorting algorithms needs the minimum number of swaps?Quick sortInsertion sortSelection sortHeap sort
25.4k
views
commented
Jul 23, 2017
Algorithms
gatecse-2006
algorithms
sorting
easy
isro2011
+
–
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?
will A[i+1]=key; in the insertion sort be counted as a movement in best case?
1.0k
views
asked
Jul 18, 2017
Algorithms
algorithms
sorting
+
–
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?
can someone please tell when to interpret this symbol $\Leftrightarrow$ as logical equivalence and when as double implication?
1.0k
views
commented
Jun 17, 2017
Mathematical Logic
first-order-logic
discrete-mathematics
mathematical-logic
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register