Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
TusharRana
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by TusharRana
0
votes
0
answers
1
GATE 2024
Consider an n element array which is to be sorted either in ascending or descending order. The given restriction is only one pass will be used for completely sorting the array and an element can compare with only it's adjacent pair. What will be the worst time complexity? Is this related to bubble sort algorithm or not?
Consider an n element array which is to be sorted either in ascending or descending order. The given restriction is only one pass will be used for completely sorting the ...
348
views
asked
Feb 11
Algorithms
algorithms
sorting
+
–
1
votes
0
answers
2
Gate 2016
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________. I am confused with the question's language. please correct me if I have a wrong assumption. We need to tell the minimum colors required for a planar graph. Suppose I start ... is only fixed to 4. I understand the answer not to be less than 4. What does the word "any" means here?
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.I am confused with the question's language.please correct me if I have a wr...
180
views
asked
Feb 8
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register