Answer Posted / dinavardhini.e

Quick sort.

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

4580

---

write a function that allocates memory for a single data type passed as a parameter.the function uses the new operator and return a pointer to the allocated memory.the function must catch and handle any exception during allocation

2893

---

Code for Easily Using Hash Table?

3045

---

Code for Two Classes for Doing Gzip in Memory?

3277

---

write a program that can LOCATE and INSERT elements in array using c++ programming languages.

4036

---

i really need help about this.. write a program to display the set of odd and even numbers separately. find the highest and lowest value of the given numbers.

2725

---

How to swap two ASCII numbers?

3053

---

write a program that reverses the input number of n.Formulate an equation to come up with the answer.

7694

---

Write a C/C++ program that connects to a MySQL server and checks if the InnoDB plug-in is installed on it. If so, your program should print the total number of disk writes by MySQL.

2527

---

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

3070

---

We need to write the function to check the password entered is correct or not based on the following conditions.. a) It must have atleast one lower case character and one digit. b)It must not have any Upper case characters and any special characters c) length should be b/w 5-12. d) It should not have any same immediate patterns like abcanan1 : not acceptable coz of an an pattern abc11se: not acceptable, coz of pattern 11 123sd123 : acceptable, as not immediate pattern adfasdsdf : not acceptable, as no digits Aasdfasd12: not acceptable, as have uppercase character

4484

---

how to take time as input in the format (12:02:13) from user so that controls remains between these columns?

2279

---

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

3635

---

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.)

4997

---

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.

4960

---