Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2010
31
votes
8
answers
61
GATE CSE 2010 | Question: 5
What is the value of $ \displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}$ ? $0$ $e^{-2}$ $e^{-1/2}$ $1$
What is the value of $ \displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}$ ?$0$$e^{-2}$$e^{-1/2}$$1$
gatecse
9.0k
views
gatecse
asked
Sep 21, 2014
Calculus
gatecse-2010
calculus
limits
normal
+
–
27
votes
4
answers
62
GATE CSE 2010 | Question: 4
Consider the set $S = \{1, ω, ω^2\}$, where $ω$ and $ω^2$ are cube roots of unity. If $*$ denotes the multiplication operation, the structure $(S, *)$ forms A Group A Ring An integral domain A field
Consider the set $S = \{1, ω, ω^2\}$, where $ω$ and $ω^2$ are cube roots of unity. If $*$ denotes the multiplication operation, the structure $(S, *)$ formsA GroupA R...
gatecse
9.9k
views
gatecse
asked
Sep 21, 2014
Set Theory & Algebra
gatecse-2010
set-theory&algebra
normal
group-theory
+
–
32
votes
4
answers
63
GATE CSE 2010 | Question: 3
What is the possible number of reflexive relations on a set of $5$ elements? $2^{10}$ $2^{15}$ $2^{20}$ $2^{25}$
What is the possible number of reflexive relations on a set of $5$ elements?$2^{10}$$2^{15}$$2^{20}$$2^{25}$
gatecse
8.6k
views
gatecse
asked
Sep 21, 2014
Set Theory & Algebra
gatecse-2010
set-theory&algebra
easy
relations
+
–
3
votes
1
answer
64
GATE CSE 2010 | Question: 2
Newton-Raphson method is used to compute a root of the equation $x^2 - 13 = 0$ with 3.5 as the initial value. The approximation after one iteration is 3.575 3.676 3.667 3.607
Newton-Raphson method is used to compute a root of the equation $x^2 - 13 = 0$ with 3.5 as the initial value. The approximation after one iteration is3.5753.6763.6673.607...
gatecse
6.2k
views
gatecse
asked
Sep 21, 2014
Numerical Methods
gatecse-2010
numerical-methods
newton-raphson
easy
non-gate
+
–
51
votes
5
answers
65
GATE CSE 2010 | Question: 1
Let $G=(V, E)$ be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in $G.$ If $S$ and $T$ are two different trees with $\xi(S) = \xi(T)$, then $| S| = 2| T |$ $| S | = | T | - 1$ $| S| = | T | $ $| S | = | T| + 1$
Let $G=(V, E)$ be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in $G.$ If $S$ and $T$ are two different trees with ...
gatecse
11.5k
views
gatecse
asked
Sep 21, 2014
Graph Theory
gatecse-2010
graph-theory
normal
degree-of-graph
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register