Q. Suppose we want to arrange the n numbers stored in an array such that all negative value before all positive ones, minimum number of exchanges required in the worst case

View solution

Q. The average time required to perform a successful sequential search for an element in an array A(1:n) is given by

View solution

Q. How many comparisons are needed to sort an array of length 5 if a straight selection sort is used and array is already in opposite order?

View solution

Q. Using the standard algorithm, what is the time required to determine that a number n is prime?

View solution

Q. If B is a circuit matrix of a graph with k components, e edges and n vertices, the rank of B is

View solution

Q. In a complete binary tree of n nodes, how far all the most distant two nodes? Assume each in the path counts as 1. Assume log (n) is log base 2.

View solution

Q. The number of nodes in a full binary till of depth 4 is

View solution

Q. The ...................sort algorithms works by comparing adjacent array that are out of order.

View solution

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