Save extra with 2 Offers
Get Rs.50 Instant Cashback on the purchase of Rs.400 or aboveNEW35,
Get Flat 35% Off on your First OrderProduct Specifications
| Publisher | Faculty Notes |
| Author: | Panel Of Experts |
| Number of Pages | 188 |
| Available | Available in all digital devices |
In order to get the contents of a Binary search tree in ascending order, one has to traverse it in A pre-order. B in-order. C post order. D not possible.
Ans. B Q.85
Which of the following sorting algorithm is stable A insertion sort. B bubble sort. C quick sort. D heap sort.
Ans. D Q.86
The prefix form of an infix expression p q r t is
13
DC08
DATA STRUCTURES A pq rt . C pq rt .
B pqr t . D pqrt .
Ans. C Q.87
Which data structure is used for implementing recursion A Queue. B Stack. C Arrays. D List.
Ans. B Q.88
In binary search, average number of comparison required for searching an element in a list if n numbers is A log 2 n . B n 2 . C n. D n 1.
Ans. A
Request Books