all questions were from last 15 lectures almost.
inorder n post order question
postfix n infix question
array was given n mergesort was asked.
heap is efficient for sorting minimum, why?
selection sort n quick sort
what are divide n conqur sorting methods
what are properties of equivalence set
a code for array sort was given n asked to correct the mistakes
a code of stack n queue was given n output was asked
Comments
Post a Comment
Please give us your feedback & help us to improve this site.