In Breadth First Search of Graph, which of the following data structure is used?

How many nodes in a Tree have no ancestors?

Which of the following sorting algorithm is stable?

Which data structure is used for implementing recursion?

The prefix form of an infix expression p + q - r * t is

The worst case of quick sort has order

The extra key inserted at hte end of the array is called as

A queue is a -------

Which data structure needed to convert infix notation to postfix notation?

The result of Evaluating the post fix expression of 5 4 6 + * 4 9 3 / + * is


DATA STRUCTURES AND ALGORITHMS ... MULTIPLE CHOICE QUESTIONS AND ANSWERS.. FOR NET SLET PREPARATION . COMPUTER SCIENCE... Preparation for net / slet examinations.. objective type question answers.. based on data structures and algorithms concepts.. based on stack queue heap graph and tree...



heap sort is not stable sort...but in answers it is given as stable...correct that one...

204 days 14 hours 59 minutes ago


Your Facebook Friends on WizIQ

Explore Similar Courses