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 durgesh
5
answers
1
GATE CSE 1997 | Question: 1.3
The determinant of the matrix $\begin{bmatrix} 6 & -8 & 1 & 1 \\ 0 & 2 & 4 & 6 \\ 0 & 0 & 4 & 8 \\ 0 & 0 & 0 & -1 \end{bmatrix}$ $11$ $-48$ $0$ $-24$
The determinant of the matrix $\begin{bmatrix} 6 & -8 & 1 & 1 \\ 0 & 2 & 4 & 6 \\ 0 & 0 & 4 & 8 \\ 0 & 0 & 0 & -1 \end{bmatrix}$$11$$-48$$0$$-24$
4.0k
views
answer edited
Dec 8, 2014
Linear Algebra
gate1997
linear-algebra
normal
determinant
+
–
1
answer
2
Understanding Singularity, Triviality, consistency, uniqueness of solutions of linear system
I was solving problems on deciding whether the given system of linear equations with three unknowns have trivial unique solution, non trivial unique solution, non trivial infinite solutions or no solution ... solutions? For singular A, are there infinite non-trivial solutions or unique non-trivial solution?
I was solving problems on deciding whether the given system of linear equations with three unknowns have trivial unique solution, non trivial unique solution, non trivial...
5.9k
views
answered
Dec 7, 2014
8
answers
3
GATE IT 2004 | Question: 5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n-1$ $n$ $n+1$ $2n-1$
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices?$n-1$$n$$n+1$$2n-1$
7.1k
views
answered
Dec 7, 2014
Graph Theory
gateit-2004
graph-theory
graph-connectivity
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register