Q. Which of the following is the average number of key comparison done by sequential in the Successful case?

View solution

Q. Which of the following is not good for linked list?

View solution

Q. A complete binary tree of level 5 has how many nodes?

View solution

Q. High level languages are not concerned with the computers but with

View solution

Q. Which sort will operate in quadratic time relative to the number of elements in the array (on avg) ?

View solution

Q. How many perfect matching are there in a complete graph of 6 vertices?

View solution

Q. In a heap with n elements and with the smallest elements at the root, the 7th smallest elements can be found in time

View solution

Q. Queues serve a major role in

View solution

Q. A graph is planar if and only if,

View solution

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