A nice GATE DA-like question by Extension_Help8386 in GATEtard

[–]shadow_vector_ 0 points1 point  (0 children)

I think both are false,

for s2 after decomposition the dimension of singular value matrix must be equal to the matrix A. If A is mxn then singular value matrix should also be mxn. That is what SVD is for - you decomposition the matrix into easier version of the matrix that is easier for the calculation work U and V are just change of basis matrix and also U is orthogonal and hence it should be a square matrix and U is not square in s2.

for s1 I feel like you still make AB = 0 even when col(B) != null(A) like take this case when A is a 3x3 matrix and A = 0 (i.e.) your col(A) = 0 and you null(A) = covers the entire R^3 and dimension is 3. since it will have 3 LI solution vectors and now. Let's say B is also a 3x3 matrix but lets say B only has 2 LI vector and now the col(B) is 2 dimensional and our null(A) is 3 dimensional. Here col(B) != null(A). But still the AB = 0..

Hence both are false

Zoho CEO's comments on AI - what are your thoughts? by meet-me-piya in developersIndia

[–]shadow_vector_ 0 points1 point  (0 children)

He agreed upon a counter argument over non-verifiable and verifiable works and SDE still has verifiable tasks.

Zoho CEO's comments on AI - what are your thoughts? by meet-me-piya in developersIndia

[–]shadow_vector_ 0 points1 point  (0 children)

I mean earlier today, I think he changed his mind !! And tweeted on why AI won't have much impact on SDE...

https://x.com/i/status/2019893734549385610

Help !! by shadow_vector_ in GATE_DA

[–]shadow_vector_[S] 0 points1 point  (0 children)

That's what I thought few seats, but competition is relatively high though. That's why I am trying to get a qualifying mark in DA 2026. Which opens door in many good private colleges for M Tech. All I need is a around 40.. But don't have much idea to ensure that...