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 mdrwt
2
answers
1
TCP/ UDP
At transport layer "pseodoheader" is attached with each outgoing data from transport layer(along with data from upper layer and its own header).Psedoheader is a part or snapshot of header from network layer.. My question is being upper layer of network layer how transport layer generates the pseodoheader,, which is generated by network layer in as next step...
At transport layer "pseodoheader" is attached with each outgoing data from transport layer(along with data from upper layer and its own header).Psedoheader is a part or s...
1.0k
views
answered
Feb 4, 2015
1
answer
2
maths_mock_test4
399
views
answered
Feb 2, 2015
Set Theory & Algebra
set-theory&algebra
lattice
+
–
8
answers
3
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
The product of the non-zero eigenvalues of the matrix is ____$\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & ...
37.3k
views
commented
Jan 28, 2015
Linear Algebra
gatecse-2014-set2
linear-algebra
eigen-value
normal
numerical-answers
+
–
7
answers
4
GATE CSE 2012 | Question: 27
Consider the following transactions with data items $P$ and $Q$ initialized to zero: ${\begin{array}{|c|l|r|c|}\hline \textbf{$ ... leads to a serializable schedule a schedule that is not conflict serializable a conflict serializable schedule a schedule for which a precedence graph cannot be drawn
Consider the following transactions with data items $P$ and $Q$ initialized to zero:$${\begin{array}{|c|l|r|c|}\hline \textbf{$T_1$}& \text{read (P);}\\ & \text{read...
22.8k
views
commented
Jan 26, 2015
Databases
gatecse-2012
databases
transaction-and-concurrency
normal
+
–
6
answers
5
GATE IT 2004 | Question: 87
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame and the second network can carry a maximum payload of $400$ $bytes$ per frame, excluding ... second network for this transmission? $\text{40 bytes}$ $\text{80 bytes}$ $\text{120 bytes}$ $\text{160 bytes}$
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame an...
19.4k
views
commented
Jan 22, 2015
Computer Networks
gateit-2004
computer-networks
network-flow
normal
+
–
3
answers
6
GATE CSE 2010 | Question: 33
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID, OF and WO stages take $1$ clock cycle each for any instruction. The PO stage takes $1$ clock cycle for ... $13$ $15$ $17$ $19$
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID,...
22.1k
views
commented
Jan 20, 2015
CO and Architecture
gatecse-2010
co-and-architecture
pipelining
normal
+
–
4
answers
7
GATE IT 2004 | Question: 42
Using a $4-bit$ $2's$ complement arithmetic, which of the following additions will result in an overflow? $1100 + 1100$ $0011 + 0111$ $1111 + 0111$ i only ii only iii only i and iii only
Using a $4-bit$ $2's$ complement arithmetic, which of the following additions will result in an overflow?$1100 + 1100$$0011 + 0111$$1111 + 0111$i onlyii onlyiii onlyi and...
10.4k
views
commented
Jan 8, 2015
Digital Logic
gateit-2004
digital-logic
number-representation
normal
+
–
4
answers
8
GATE IT 2008 | Question: 40
A non pipelined single cycle processor operating at $100\;\text{MHz}$ is converted into a synchronous pipelined processor with five stages requiring $2.5\;\text{nsec}, 1.5\;\text{nsec}, 2\;\text{nsec}, 1.5\;\text{nsec}$ and $2.5\;\text{nsec}$, respectively ... $4.5$ $4.0$ $3.33$ $3.0$
A non pipelined single cycle processor operating at $100\;\text{MHz}$ is converted into a synchronous pipelined processor with five stages requiring $2.5\;\text{nsec}, ...
13.7k
views
commented
Dec 27, 2014
CO and Architecture
gateit-2008
co-and-architecture
pipelining
normal
+
–
5
answers
9
TIFR CSE 2014 | Part B | Question: 7
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}$
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^{...
4.0k
views
commented
Dec 13, 2014
Algorithms
tifr2014
algorithms
time-complexity
+
–
9
answers
10
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
answered
Dec 12, 2014
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
functions
+
–
7
answers
11
GATE CSE 2008 | Question: 38
In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is: before effective address calculation has started during effective address calculation after effective address calculation has completed after data cache lookup has completed
In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is:before effective address calculation has starteddur...
19.3k
views
commented
Dec 4, 2014
CO and Architecture
gatecse-2008
co-and-architecture
virtual-memory
normal
+
–
4
answers
12
GATE CSE 2009 | Question: 1
Which one of the following is NOT necessarily a property of a Group? Commutativity Associativity Existence of inverse for every element Existence of identity
Which one of the following is NOT necessarily a property of a Group?CommutativityAssociativity Existence of inverse for every element Existence of identity
8.2k
views
answered
Nov 25, 2014
Set Theory & Algebra
gatecse-2009
set-theory&algebra
easy
group-theory
+
–
4
answers
13
GATE IT 2005 | Question: 75
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmit $100$ $\text{bits}$ ... in the LAN so that the throughput of each station can be $2/3$ $\text{Mbps}$ is $3$ $5$ $10$ $20$
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmi...
14.1k
views
answered
Nov 22, 2014
Computer Networks
gateit-2005
computer-networks
mac-protocol
normal
+
–
3
answers
14
GATE CSE 2006 | Question: 53
Consider the following C-function in which $a[n]$ and $b[m]$ are two sorted integer arrays and $c[n+m]$ be another integer array, void xyz(int a[], int b [], int c []){ int i,j,k; i=j=k=0; while ((i<n) && (j<m)) if (a[i] < b[j]) c[k++] = ... $b[m-1]\leq a[i]$ if $j=m$ only (i) only (ii) either (i) or (ii) but not both neither (i) nor (ii)
Consider the following C-function in which $a[n]$ and $b[m]$ are two sorted integer arrays and $c[n+m]$ be another integer array,void xyz(int a[], int b [], int c []){ in...
11.6k
views
answered
Nov 21, 2014
Algorithms
gatecse-2006
algorithms
identify-function
normal
+
–
7
answers
15
GATE CSE 2006 | Question: 51, ISRO2016-34
Consider the following recurrence: $ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$ Which one of the following is true? $ T(n)=\Theta (\log\log n)$ $ T(n)=\Theta (\log n)$ $ T(n)=\Theta (\sqrt{n})$ $ T(n)=\Theta (n)$
Consider the following recurrence:$ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$Which one of the following is true?$ T(n)=\Theta (\log\log n)$$ T(n)=\Theta (\log n)$$ T(n...
28.5k
views
commented
Nov 21, 2014
Algorithms
algorithms
recurrence-relation
isro2016
gatecse-2006
+
–
7
answers
16
GATE CSE 2006 | Question: 17
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it in linear time using a left to right pass of the array solves it in linear time using ... pass of the array solves it using divide and conquer in time $\Theta (n\log n)$ solves it in time $\Theta( n^2)$
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it i...
17.9k
views
answered
Nov 21, 2014
Algorithms
gatecse-2006
algorithms
normal
algorithm-design
+
–
1
answer
17
GATE CSE 1998 | Question: 1.3
Which of the following statements applies to the bisection method used for finding roots of functions: converges within a few iterations guaranteed to work for all continuous functions is faster than the Newton-Raphson method requires that there be no error in determining the sign of the function
Which of the following statements applies to the bisection method used for finding roots of functions:converges within a few iterationsguaranteed to work for all continuo...
22.4k
views
answered
Nov 13, 2014
Numerical Methods
gate1998
numerical-methods
bisection-method
easy
out-of-gate-syllabus
+
–
4
answers
18
GATE CSE 2007 | Question: 70
Match the following: ... $\text{P - 1, Q - 4, R - 2, S - 5}$ $\text{P - 2, Q - 4, R - 1, S - 3}$
Match the following:$$\begin{array}{llll} \text{(P)} & \text{SMTP} &(1)& \text{Application layer} \\ \text{(Q)} & \text{BGP}& (2) & \text{Transport layer} \\ \text{(R)}...
13.9k
views
answered
Nov 12, 2014
Computer Networks
gatecse-2007
computer-networks
network-layering
network-protocols
easy
+
–
2
answers
19
GATE CSE 2003 | Question: 7
Consider the set $\Sigma^*$ of all strings over the alphabet $\Sigma = \{0, 1\}$. $\Sigma^*$ with the concatenation operator for strings does not form a group forms a non-commutative group does not have a right identity element forms a group if the empty string is removed from $\Sigma^*$
Consider the set $\Sigma^*$ of all strings over the alphabet $\Sigma = \{0, 1\}$. $\Sigma^*$ with the concatenation operator for stringsdoes not form a groupforms a non-c...
8.9k
views
answered
Nov 7, 2014
Set Theory & Algebra
gatecse-2003
set-theory&algebra
group-theory
normal
+
–
4
answers
20
GATE CSE 2004 | Question: 27
Let $A, B, C, D$ be $n \times n$ matrices, each with non-zero determinant. If $ABCD = I$, then $B^{-1}$ is $D^{-1}C^{-1}A^{-1}$ $CDA$ $ADC$ Does not necessarily exist
Let $A, B, C, D$ be $n \times n$ matrices, each with non-zero determinant. If $ABCD = I$, then $B^{-1}$ is $D^{-1}C^{-1}A^{-1}$ $CDA$ $ADC$ Does not necessarily e...
10.1k
views
answered
Nov 7, 2014
Linear Algebra
gatecse-2004
linear-algebra
normal
matrix
+
–
5
answers
21
GATE CSE 2002 | Question: 5a
Obtain the eigen values of the matrix$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$
Obtain the eigen values of the matrix$$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$$
4.6k
views
answered
Nov 7, 2014
Linear Algebra
gatecse-2002
linear-algebra
eigen-value
normal
descriptive
+
–
6
answers
22
GATE CSE 2002 | Question: 1.4
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is $2$ $3$ $4$ $n-2 \left \lfloor \frac{n}{2} \right \rfloor+2$
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is$2$$3$$4$$n-2 \lef...
11.2k
views
answered
Nov 7, 2014
Graph Theory
gatecse-2002
graph-theory
graph-coloring
normal
+
–
3
answers
23
GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular
Consider the following grammars. Names representing terminals have been specified in capital letters.$$\begin{array}{llll}\hline \text{$G1$ :} & \text{stmnt} & \text{$\...
12.8k
views
commented
Nov 3, 2014
Theory of Computation
gateit-2007
theory-of-computation
context-free-language
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register