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 moulin
3
answers
1
GATE CSE 2003 | Question: 20
Consider the following three claims: $(n+k)^m = \Theta(n^m)$ where $k$ and $m$ are constants $2^{n+1} = O(2^n)$ $2^{2n+1} = O(2^n)$ Which of the following claims are correct? I and II I and III II and III I, II, and III
Consider the following three claims:$(n+k)^m = \Theta(n^m)$ where $k$ and $m$ are constants$2^{n+1} = O(2^n)$$2^{2n+1} = O(2^n)$Which of the following claims are correct?...
18.7k
views
commented
May 29, 2018
Algorithms
gatecse-2003
algorithms
asymptotic-notation
normal
+
–
0
answers
2
GATE Marks Distribution Update
I have seen the GATE marks distribution link @ https://gatecse.in/mark-distribution-in-gate-cse. Will this be updated for Set 1 and 2 of GATE 2017?
I have seen the GATE marks distribution link @ https://gatecse.in/mark-distribution-in-gate-cse.Will this be updated for Set 1 and 2 of GATE 2017?
1.5k
views
asked
Oct 19, 2017
Study Resources
gateoverflow
preparation
general
+
–
2
answers
3
GATE Overflow Platform
First of all, I want to thank you all for creating such an amazing platform. Coming to my question, I would like to know how can I search all GATE questions from an specific subject/topic? I know I can use the GATE Overflow book, but I ... +compiler-design) won't work. Please suggest some way. Or if possible please allow the searching from more than 2 tag fields. Thanks
First of all, I want to thank you all for creating such an amazing platform.Coming to my question, I would like to know how can I search all GATE questions from an specif...
730
views
commented
Oct 9, 2017
Others
gateoverflow
site-improvement
meta
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register