Given 1 to n distinct random number of which n+1th element
was duplicated. How do find the duplicate element and
explain the time complexity of the algorithm.
In LSMW , what does the following error mean and how to
rectify it : Incorrect interface data for set 78 in method
C . This error is occuring in idoc processing step of LSMW.
Given 1 to n distinct random number of which n+1th element
was duplicated. How do find the duplicate element and
explain the time complexity of the algorithm.
Definition of priority queue was given. We have to implement
the priority queue using array of pointers with the
priorities given in the range 1..n.
The array could be accessed using the variable top. The list
corresponding to the array elements contains the items
having the priority as the array index.
Adding an item would require changing the value of top if it
has higher priority than top.
Extracting an item would require deleting the first element
from the corresponding queue.
The following class was given:
class PriorityQueue
{
int *Data[100];
int top;
public:
void put(int item, int priority); // inserts the item with
the given priority.
int get(int priority); // extract the element with the
given priority.
int count(); // returns the total elements in the priority
queue.
int isEmpty(); // check whether the priority queue is empty
or not.
};
We had to implement all these class functions.
snippet to prevent submission of form when certain/any
validations got failed
33
Code for Adding Scripting Support to an Application?
101
how to pass data between pages using URLs
33
How to use Client-side Script to Focus Controls in ASP.NET?
54
Code for Small C++ Class to Transform Any Static Control
into a Hyperlink Control?
43
Subsets
Write an algorithm that prints out all the subsets of 3
elements of a set of n elements. The elements of the set are
stored in a list that is the input to the algorithm. (Since
it is a set, you may assume all elements in the list are
distinct.)
Did you received any Funny E-Mails from your Friends and like to share with rest of our friends? Yeah!! you can post that stuff 
Site Map