Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
raj26
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by raj26
1
votes
1
GATE IT 2008 | Question: 11
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE? If X can be solved in polynomial time, then so can Y X is NP-complete X is NP-hard X is in NP, but not necessarily NP-complete
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE?If X can be solved in polynomial time, then so can YX is NP-c...
7.0k
views
answered
Jan 24, 2022
Algorithms
gateit-2008
algorithms
p-np-npc-nph
normal
out-of-syllabus-now
+
–
1
votes
2
GATE CSE 2008 | Question: 3
The following system of equations $x_1 + x_2 + 2x_3 = 1$ $x_1 + 2x_2 + 3x_3 = 2$ $x_1 + 4x_2 + αx_3 = 4$ has a unique solution. The only possible value(s) for $α$ is/are $0$ either $0$ or $1$ one of $0, 1$, or $-1$ any real number
The following system of equations$x_1 + x_2 + 2x_3 = 1$$x_1 + 2x_2 + 3x_3 = 2$$x_1 + 4x_2 + αx_3 = 4$has a unique solution. The only possible value(s) for $α$ is/are$0$...
9.9k
views
answered
Oct 18, 2021
Linear Algebra
gatecse-2008
easy
linear-algebra
system-of-equations
+
–
0
votes
3
Correct Statement ( K-Map )
Is'nt all options are correct??
Is'nt all options are correct??
2.4k
views
answered
May 6, 2021
Digital Logic
digital-logic
k-map
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register