Give two integer arrays A & B.A has n elements and B has ' n-1 ' elements . A has all the elements that are there in B. But B has one missing element. Write a function that takes arrays , A & B as imnput and finds the missing element in most optised manner .

4 Answers   Zycus Infotech,

---

how can u do connectivity in c++ language? plz send me connectivity code in c++ ?

0 Answers   Ascent,

---

What is the disadvantage of templates ?

2 Answers   NSN, Symphony,

---

What is stl stack?

0 Answers  

---

What is the stl, standard template library?

0 Answers  

---

Explain how to insert a hyperlink in to an Excel worksheet and save a Word document as a Web page.

1 Answers  

---

write a program that input four digit number and find how many 7 that number contains

4 Answers  

---

what is electronic software

1 Answers  

---

Assume I have a linked list contains all of the alphabets from "A" to "Z?" I want to find the letter "Q" in the list, how does you perform the search to find the "Q?"

2 Answers  

---

please visit this site you'll find my question this is my homework please answer it if you can http://easyscience.org/ib/lofiversion/index.php/t36168.html

0 Answers  

---

How the STL's are implemented, What the difference between templates and STL?

1 Answers   Symphony,

---

Is there any error below, its a code to delete all entires from a map #include <map> #include iostream.h int main() { int i =0; map <int, char> TestMap; while(i<3) { TesMap.insert(TestMap::value_type(i,Test)); i++; } typedef map<int, char> :: iterator mapIter =TestMap.begin(); if(mapIter!=TestMap.end()) { TestMap.erase(mapItrer); ++mapIter; } return 0; }

0 Answers  

---