Can we remove an element in a single linked list without traversing? Lets suppose the link list is like this 1 2 3 4 5 6 We need to remove 4 from this list (without traversing from beginning) and the final link list shud be 1 2 3 5 6 only thing we know is the pointer to element "4". How can we remove "4" and link "3" to "5"?

6 Answers   CSC,

---

Evaluate the following expression as C++ would do :8 * 9 + 2 * 5 a) 82 b) 79 c) 370 d) list

0 Answers  

---

How long does this loop run: for(int x=0; x=3; x++) a) Never b) Three times c) Forever

17 Answers   Datavance, Quark, VEL, Wipro,

---

If you push the numbers (in order) 1, 3, and 5 onto a stack, which pops out first a) 1 b) 5 c) 3

0 Answers  

---

How is new() different from malloc()?

0 Answers  

---

Is c++ double?

0 Answers  

---

Can there be at least some solution to determine the number of arguments passed to a variable argument list function?

0 Answers  

---

Define Virtual function in C++.

0 Answers   iNautix,

---

Show the application of a dynamic array with the help of an example.

0 Answers  

---

Define macro.

0 Answers  

---

Explain the static member function.

0 Answers  

---

How a new element can be added or pushed in a stack?

0 Answers  

---