Q. Let X is the adjacency matrix of a graph a with no self-loops. The entries along type principle diagonal of X are

View solution

Q. Which of the following is similar to direct files?

View solution

Q. Which of the following are not file Organization?

View solution

Q. A Linear Collection Of Data Elements Where The Linear Node Is Given By Means Of Pointer Is Called _________

View solution

Q. The processing of accessing data stored in a tape is similar to manipulating data on a

View solution

Q. Which of the following is true for binary search tree?

View solution

Q. Which of the following is true for walk in a graph

View solution

Q. The number of comparison required in heap sort under worst case is

View solution

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