Q. Which of the following algorithm design techniques is used in finding all pairs of shortest distance in a graph?

View solution

Q. The most appropriate matching for the following pairs:

 X: Depth first search 1: chip
 Y: Breadth first search 2: queue
 Z: Sorting 3: Stack

View solution

Q. In the worst case, the number of comparisons needed to search a singly linked list, of length n for a given element is

View solution

Q. Sorting techniques that records with the same primary key occurs in the same order in the Sorted list as in the original unsorted list is said to

View solution

Q. A test is mode up of the characters a,b,c,d,e each occurring with the probability 12, -4, -15, 0.8 and 0.25 respectively. The optical coding technique will have the avg length of

View solution

Q. In towers of Hanoi problem with 3 needle and 6 disks, how many total number of moves to solve this problem?

View solution

Q. Which of the following is tree for average number of comparison needed in the average binary search tree with n nodes in approximately.

View solution

Q. Which of the following is not tree in Heap?

View solution

Q. If the binary search algorithm determines the search argument is the upper of the array, Which if the following statements will set the appropriate variable to the appropriate value?

View solution

Q. In bubble sort, the first step is swapping two of the element in the code array is to

View solution

Q. An adjacency matrix representation of graph cannot contain information of

View solution

Q. Stacks can be used to

View solution

Q. Queue can be useful to implement

View solution

Q. Which of the following technique is used in the quick sort algorithm?

View solution

Q. A 3- array tree in which every internal node has exactly 3 children, the number leaf nodes such a tree with 6 internal nodes will be

View solution

Q. Which data structure may give overflow error, even though the current number of elements in it is less than its size?

View solution

Q. Number of possible ordered trees with 3 nodes x, y, z is

View solution

Q. The best sorting methods if number of swapping done, is the only measure of efficiency is

View solution

Q. The sorting method which sorts a set of elements that is already in order or in reverse order with equal speed is

View solution

Q. The expression which access the (ij)th entry of a m x n matrix stored in column major form is

View solution