Answer Posted / karthickkumar

tree

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

4010

---

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

2402

---

write a program using virtual function to find the transposing of a square matrix?

3356

---

Create a program to read two random data set in two files named data1.txt and data2.txt manifold contains integer numbers, whereas data2.txt file contains the float type numbers. Simpanlahmasing each into 2 pieces of data that is an array of type integer array and an array of type float, then calculate the average numbers in the second array.

2594

---

Code for Two Classes for Doing Gzip in Memory?

3250

---

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

4560

---

How to Split Strings with Regex in Managed C++ Applications?

3649

---

What output does the following code generate? Why? What output does it generate if you make A::Foo() a pure virtual function? class A { A() { this->Foo(); } virtual void Foo() { cout << "A::Foo()" << endl; } }; class B : public A { B() { this->Foo(); } virtual void Foo() { cout << "A::Foo()" << endl; } }; int main(int, char**) { A objectA; B objectB; return 0; }

1216

---

Write a C++ program without using any loop (if, for, while etc) to print prime numbers from 1 to 100 and 100 to 1 (Do not use 200 print statements!!!)

3741

---

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.

4939

---

can you please write a program for deadlock that can detect deadlock and to prevent deadlock.

3228

---

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

2451

---

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

4846

---

write a program to perform generic sort in arrays?

3061

---

develop a program to calculate and print body mass index for 200 employees

2652

---