Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User mdrwt
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by mdrwt
0
votes
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...
answered
in
Computer Networks
Feb 4, 2015
997
views
6
votes
2
maths_mock_test4
answered
in
Set Theory & Algebra
Feb 2, 2015
401
views
set-theory&algebra
lattice
78
votes
3
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$
answered
in
Set Theory & Algebra
Dec 12, 2014
11.0k
views
gatecse-2006
set-theory&algebra
normal
functions
9
votes
4
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
answered
in
Set Theory & Algebra
Nov 25, 2014
8.1k
views
gatecse-2009
set-theory&algebra
easy
group-theory
7
votes
5
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$
answered
in
CO and Architecture
Nov 25, 2014
22.2k
views
gatecse-2010
co-and-architecture
pipelining
normal
19
votes
6
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$
answered
in
Computer Networks
Nov 22, 2014
14.2k
views
gateit-2005
computer-networks
mac-protocol
normal
8
votes
7
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)
answered
in
Algorithms
Nov 21, 2014
11.5k
views
gatecse-2006
algorithms
identify-function
normal
64
votes
8
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)$
answered
in
Algorithms
Nov 21, 2014
17.8k
views
gatecse-2006
algorithms
normal
algorithm-design
1
vote
9
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
answered
in
Numerical Methods
Nov 13, 2014
22.1k
views
gate1998
numerical-methods
bisection-method
easy
out-of-gate-syllabus
14
votes
10
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}$
answered
in
Computer Networks
Nov 12, 2014
13.8k
views
gatecse-2007
computer-networks
network-layering
network-protocols
easy
58
votes
11
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^*$
answered
in
Set Theory & Algebra
Nov 7, 2014
8.9k
views
gatecse-2003
set-theory&algebra
group-theory
normal
64
votes
12
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
answered
in
Linear Algebra
Nov 7, 2014
10.0k
views
gatecse-2004
linear-algebra
normal
matrix
47
votes
13
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}$
answered
in
Linear Algebra
Nov 7, 2014
4.6k
views
gatecse-2002
linear-algebra
eigen-value
normal
descriptive
41
votes
14
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$
answered
in
Graph Theory
Nov 7, 2014
11.1k
views
gatecse-2002
graph-theory
graph-coloring
normal
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...