Q. The searching technique which there are no unnecessary comparisons is called

View solution

Q. The balanced sort tree is also known as

View solution

Q. A sort which used binary tree concept such that any number is larger than all the numbers in the sub tree below it, is called

View solution

Q. To insert a node in a circular list at rear position, it should be inserted at....

View solution

Q. The minimum number of fields with each node of double linked list is

View solution

Q. A characteristic of the data that binary search uses but the linear search ignore, Is the

View solution

Q. The degree of an order B – tree is

View solution

Q. If a node has K children in B tree, then the node contains exactly _____ keys.

View solution

Q. Data structures suitable for the application is discussed in

View solution

Q. A linked binary tree with n nodes n≥0 has exactly

View solution

Q. The running time of 0/1 knapsack problem using the dynamic programming is (where ‘W’ is the weight)

View solution

Q. What is the time complexity for taking a list of items, cutting it in half repeatedly until there’s only one item left?

View solution

Q. Algorithm which solves the all path shortest path problem is

View solution