Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
rc test series
Gate Fever
asked
in
Set Theory & Algebra
Jan 3, 2019
168
views
0
votes
0
votes
The function $2x^{2}+ 2xy - y^{3}$ has
a) only one stationary point at (0,0)
b)two stationary points at (0,0) and (1/6,1/3)
c)two stationary points at (0,0) and (1,-1)
d)no stationary points
Gate Fever
asked
in
Set Theory & Algebra
Jan 3, 2019
by
Gate Fever
168
views
answer
comment
Follow
share this
share
3 Comments
by
MiNiPanda
commented
Jan 3, 2019
reply
Follow
share this
A..?
0
0
by
Gate Fever
commented
Jan 3, 2019
reply
Follow
share this
correct!
@MiNiPanda
explain pls
0
0
by
Gate Fever
commented
Jan 4, 2019
reply
Follow
share this
how u got this
@minipanda
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Gate Fever
asked
in
Graph Theory
Jan 8, 2019
366
views
rc test series
Assume G is a connected planar graph that has 12 vertices and 17 regions.all interior regions are bounded by a cycle of length 3(ie 3 edge).find the number of edges bounding the interior region?
Gate Fever
asked
in
Graph Theory
Jan 8, 2019
by
Gate Fever
366
views
0
votes
0
votes
0
answers
2
Gate Fever
asked
in
Graph Theory
Jan 8, 2019
141
views
rc test series
consider a simple graph G with k components.If each component has n1,n2,.....nk vertices,then the maximum number of edges in G is
Gate Fever
asked
in
Graph Theory
Jan 8, 2019
by
Gate Fever
141
views
0
votes
0
votes
0
answers
3
Gate Fever
asked
in
Graph Theory
Jan 8, 2019
130
views
rc test series
A graph is said to be 2 colorable if each vertex can be colored either red or blue and no two vertices of the same color are connected by an edge.If some graph is not 2 colorable then we can reduce it to become 2 colorable by removing some edges.we are given ... graph 2 colorable (ex ;- k=0 if graph is already 2 colorable) the minimum value of k to reach the worst case is ______?
Gate Fever
asked
in
Graph Theory
Jan 8, 2019
by
Gate Fever
130
views
0
votes
0
votes
0
answers
4
Gate Fever
asked
in
Databases
Jan 7, 2019
353
views
rc test series
Consider the relation R with the following information (A,B,C,D) :- A B C D a b z 1 e b r 1 a d z 1 e d r 1 a f z 2 e f r 2 find the total number of FD in above relation (ignore the self FD’s X->X,Y->Y,XY->X,XY->Y etc). i am getting only 10, but it is wrong; is there any faster and appropriate technique for this?
Gate Fever
asked
in
Databases
Jan 7, 2019
by
Gate Fever
353
views
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Discrete Mathematics
(6.5k)
Mathematical Logic
(2.2k)
Set Theory & Algebra
(1.7k)
Combinatory
(1.5k)
Graph Theory
(993)
Probability
(1.2k)
Linear Algebra
(888)
Calculus
(714)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
the paper was easy to moderate, in this paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy