Register

Gate CS 2019

603 views
0 votes
0 votes
S1=Matrix is Invertible

S2=Determinant of matrix is Non-zero

 

 

What is the Answer..
User Avatar

1 Answer

2 votes
2 votes
Both the statements are equivalent.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
SumitBM asked Aug 21, 2023
362 views
GATE CS/IT - (2005) Digital Logic. (Made Easy PYQ Book - 2019 book)
Which is the following expression is equivalent to $(A \oplus B) \oplus C$ ? $(A + B + C) (\bar{A} + \bar{B} + \bar{C})$ $(A + B + C) (\bar{A} + \bar{B} + C)$ $ABC + \bar{A} (B\oplus C) + \bar{B} (A \oplus C)$ None of these.
Which is the following expression is equivalent to $(A \oplus B) \oplus C$ ?$(A + B + C) (\bar{A} + \bar{B} + \bar{C})$ $(A + B + C) (\bar{A} + \bar{B} + C)$$ABC + \bar{A...
User Avatar
1 votes
1 votes
0 answers
2
Yamini Kuldeep asked Aug 26, 2018
1,141 views
Gate 2019 CS /IT book...
Q :- Perform the subtraction in X-3 code 57.6 subtract 27.8 a) 0101 1100.1011 b) 0010 1001.1100 c) 00011101.1100 d) 1010 1110.1011
Q :- Perform the subtraction in X-3 code 57.6 subtract 27.8a) 0101 1100.1011b) 0010 1001.1100c) 00011101.1100d) 1010 1110.1011
User Avatar
0 votes
0 votes
1 answer
3
Priya0612 asked Aug 21, 2018
619 views
Do we need to study call by name, call by need parameter passing techniques for Gate Cs 2019??
User Avatar
0 votes
0 votes
1 answer
4
suvasish114 asked 3 days ago
40 views
ISI kolkata MTech CS 2019
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths from $u$ to $v$ that do not contain the vertex $w$.
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths fro...
User Avatar
Link Copied!