Answer Posted / deepak bansal

same in every case..
1000*1000

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.

4386

---

write a program that prompt the user to enter his height and weight,then calculate the body mass index and show the algorithm used

4294

---

Question 1: Implement a base class Appointment and derived classes Onetime, Daily, Weekly, and Monthly. An appointment has a description (for example, “see the dentist”) and a date and time. Write a virtual function occurs_on(int year, int month, int day) that checks whether the appointment occurs on that date. For example, for a monthly appointment, you must check whether the day of the month matches. Then fill a vector of Appointment* with a mixture of appointments. Have the user enter a date and print out all appointments that happen on that date. *This Should Be Done IN C++

540

---

write a function that reverse the elements of an array in place.The function must accept only one pointer value and return void.

3942

---

output for printf("printf");

1972

---

---

Code for Easily Using Hash Table?

2377

---

What output does this program generate as shown? Why? class A { A() { cout << "A::A()" << endl; } ~A() { cout << "A::~A()" << endl; throw "A::exception"; } }; class B { B() { cout << "B::B()" << endl; throw "B::exception"; } ~B() { cout << "B::~B()"; } }; int main(int, char**) { try { cout << "Entering try...catch block" << endl; A objectA; B objectB; cout << "Exiting try...catch block" << endl; } catch (char* ex) { cout << ex << endl; } return 0; }

570

---

create a stucture student containing field for roll no,class,year and marks.create 10 student annd store them in a file

2206

---

write a program to convert temperature from fa height into celcius and vise versa,use modular programming

2427

---

Teta-Omeg-Big-Oh Show that f(n) = n2 + 3n3 is ;(n3).

3182

---

1+1/2!+1/3!+...+1/n!

1933

---

Code for Small C++ Class to Transform Any Static Control into a Hyperlink Control?

2549

---

find level of following tree (state, parent) " J,D I,D H,C E,B F,B G,C B,A D,A C,A A,& K,E L,E L,F M,F N,G O,H P,I P,H Q,I R,J S,K U,P T,L

1992

---

Write a (n) algorithm that sorts n distinct integers, ranging in size between 1 and kn inclusive, where k is a constant positive integer. (Hint: Use a kn-element array.)

4433

---

write a program that reads a series of strings and prints only those strings begging with letter "b"

2656

---