The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Saurabh Sharma
User Saurabh Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Saurabh Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
Give the result of partitioning the keys after the 1st pass of quicksort.
THISCOURSEISOVER Choose the last elements as pivot elements (R). Also for duplicates, adopt the convention that both pointers stop. a) EHIOCOIERRUSSVTS b) EHISCOIERRUSOVTS b) EHIOCOUESRTSSVTR c) EHIOOCIERRUSSVTS
asked
Jul 22, 2015
in
Algorithms

245
views
sorting
algorithms
quicksort
+1
vote
1
answer
2
Solve the recurrence
T(n) = T(n  1) + 1/n a) O(1) b) O(n) c) O(log n) d) O(log log n)
asked
Jul 20, 2015
in
Algorithms

267
views
algorithms
recurrence
+4
votes
4
answers
3
DFA to accept a binary number divisible by 2
Sorry for the bad quality picture. Which of these is correct? (1 or 2)
asked
May 8, 2015
in
Theory of Computation

7.2k
views
finiteautomata
50,833
questions
57,729
answers
199,453
comments
107,863
users